| Safe Haskell | None | 
|---|---|
| Language | Haskell2010 | 
Text.Regex.TDFA.TDFA
Description
Text.Regex.TDFA.TDFA converts the QNFA from TNFA into the DFA. A DFA state corresponds to a Set of QNFA states, represented as list of Index which are used to lookup the DFA state in a lazy Trie which holds all possible subsets of QNFA states.
Synopsis
- patternToRegex :: (Pattern, (GroupIndex, DoPa)) -> CompOption -> ExecOption -> Regex
 - data DFA = DFA {}
 - data DT
 - examineDFA :: Regex -> String
 - nfaToDFA :: ((Index, Array Index QNFA), Array Tag OP, Array GroupIndex [GroupInfo]) -> CompOption -> ExecOption -> Regex
 - dfaMap :: DFA -> Map SetIndex DFA
 
Documentation
patternToRegex :: (Pattern, (GroupIndex, DoPa)) -> CompOption -> ExecOption -> Regex Source #
Internal DFA node, identified by the Set of indices of the QNFA nodes it represents.
Internal to the DFA node
Constructors
| Simple' | |
Fields 
  | |
| Testing' | |
examineDFA :: Regex -> String Source #