UMinho Haskell Libraries (2005.10.12)ContentsIndex
Language.HaLex.Fa2RegExp
Portability portable
Stability provisional
Maintainer jas@di.uminho.pt
Description

From Finite Automata into Regular Expressions

Code Included in the Lecture Notes on Language Processing (with a functional flavour).

Synopsis
dfa2RegExp :: Eq sy => Dfa Int sy -> RegExp sy
regExpFromTo :: Eq st => (st -> sy -> st) -> [sy] -> st -> st -> RegExp sy
ndfaregExpFromTo :: Eq st => (st -> Maybe sy -> [st]) -> [sy] -> st -> st -> RegExp sy
Documentation
dfa2RegExp
:: Eq sy
=> Dfa Int syDeterministic Automaton
-> RegExp syEquivalent Regular Expression
Compute a regular expression from a Dfa.
regExpFromTo
:: Eq st
=> (st -> sy -> st)Transition Function
-> [sy]Vocabulary
-> stOrigin State
-> stDestination State
-> RegExp syRegular Expression
Compute a regular expression that defines the transitions from an origin to a destination in a Dfa.
ndfaregExpFromTo
:: Eq st
=> (st -> Maybe sy -> [st])Transition Function
-> [sy]Vocabulary
-> stOrigin State
-> stDestination State
-> RegExp syRegular Expression
Compute a regular expression that defines the transitions from an origin to a destination in a Ndfa.
Produced by Haddock version 0.6