Text.Regex.TDFA.TDFA

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.

Documentation

patternToRegex :: (Pattern, (GroupIndex, DoPa)) -> CompOption -> ExecOption -> Regex

data DFA

Internal DFA node, identified by the Set of indices of the QNFA nodes it represents.

Constructors

DFA

Fields

• d_id :: SetIndex
• d_dt :: DT

Instances

Show DFA

Defined in Text.Regex.TDFA.Common

Methods

showsPrec :: Int -> DFA -> ShowS

show :: DFA -> String

showList :: [DFA] -> ShowS

data DT

Internal to the DFA node

Constructors

Simple'

Fields

• dt_win :: IntMap Instructions

  Actions to perform to win

• dt_trans :: CharMap Transition

  Transition to accept Char

• dt_other :: Transition

  default accepting transition

Testing'

Fields

• dt_test :: WhichTest

  The test to perform

• dt_dopas :: EnumSet DoPa

  location(s) of the anchor(s) in the original regexp

• dt_a, dt_b :: DT

  use dt_a if test is True else use dt_b

Instances

Show DT

Defined in Text.Regex.TDFA.Common

Methods

showsPrec :: Int -> DT -> ShowS

show :: DT -> String

showList :: [DT] -> ShowS

examineDFA :: Regex -> String

nfaToDFA :: ((Index, Array Index QNFA), Array Tag OP, Array GroupIndex [GroupInfo]) -> CompOption -> ExecOption -> Regex

dfaMap :: DFA -> Map SetIndex DFA