|
|
|
|
|
Description |
This Text.Regex.DFA.Pattern module provides the Pattern data
type and its subtypes. This Pattern type is used to represent
the parsed form of a Regular Expression and is syntax independent.
It is possible to construct values of Pattern that are invalid
regular expressions.
There are also several
|
|
Synopsis |
|
|
|
Documentation |
|
data Pattern |
Constructors | | Instances | |
|
|
data PatternSet |
Constructors | | Instances | |
|
|
newtype PatternSetCharacterClass |
Constructors | | Instances | |
|
|
newtype PatternSetCollatingElement |
Constructors | PatternSetCollatingElement | | |
| Instances | |
|
|
newtype PatternSetEquivalenceClass |
Constructors | PatternSetEquivalenceClass | | |
| Instances | |
|
|
type PatternIndex = Int |
PatternIndex is for indexing submatches from parenthesized groups (PGroup)
|
|
showPattern :: Pattern -> String |
|
showPatternP :: Pattern -> String |
|
Pattern DoPa
|
|
data DoPa |
Constructors | | Instances | |
|
|
newDoPa :: Int -> DoPa |
|
Produced by Haddock version 0.8 |