Moduleregex-tdfa-1.3.2.5Haskell2010

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.

2 types
4 values

Packageregex-tdfa-1.3.2.5
Exports6
LanguageHaskell2010
LicenceBSD-3-Clause
SourceTDFA.hs

valuepatternToRegex

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

datadata DFA

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

Constructors

DFA
- d_id :: SetIndex
- d_dt :: DT

Instances1Show

Show DFADefined in regex-tdfa-1.3.2.5 · Text.Regex.TDFA.Common

datadata DT

Internal to the DFA node

Constructors

Simple'
- dt_win :: IntMap Instructions
  Actions to perform to win
- dt_trans :: CharMap Transition
  Transition to accept Char
- dt_other :: Transition
  default accepting transition
Testing'
- dt_test :: WhichTest
  The test to perform
- dt_dopas :: EnumSet DoPa
  location(s) of the anchor(s) in the original regexp
- dt_a :: DT
  use dt_a if test is True else use dt_b
- dt_b :: DT
  use dt_a if test is True else use dt_b

Instances1Show

Show DTDefined in regex-tdfa-1.3.2.5 · Text.Regex.TDFA.Common

valueexamineDFA :: Regex -> String

valuenfaToDFA

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

valuedfaMap :: DFA -> Map SetIndex DFA