regex-tdfa-1.3.2.1: Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)
Safe HaskellSafe-Inferred
LanguageHaskell2010

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

Documentation

data DFA Source #

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

Constructors

DFA 

Fields

Instances

Instances details
Show DFA Source # 
Instance details

Defined in Text.Regex.TDFA.Common

Methods

showsPrec :: Int -> DFA -> ShowS

show :: DFA -> String

showList :: [DFA] -> ShowS

data DT Source #

Internal to the DFA node

Constructors

Simple' 

Fields

Testing' 

Fields

Instances

Instances details
Show DT Source # 
Instance details

Defined in Text.Regex.TDFA.Common

Methods

showsPrec :: Int -> DT -> ShowS

show :: DT -> String

showList :: [DT] -> ShowS

examineDFA :: Regex -> String Source #