|
|
|
Description |
Text.Regex.TDFA.TDFA converts the QNFA from TNFA into the DFA.
A DFA state corresponds to a Set of QNFA states, repesented 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 |
|
|
|
Documentation |
|
|
|
|
Internal DFA node, identified by the Set of indices of the QNFA
nodes it represents.
| Constructors | |
|
|
|
Internal to the DFA node
| Constructors | Simple' | | | 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
|
|
|
|
|
|
|
|
|
|
|
Produced by Haddock version 2.6.1 |