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

From Regular Expressions into Non-Deterministic and Deterministic Finite Automata

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

Synopsis
regExp2Ndfa :: Eq sy => RegExp sy -> Ndfa Int sy
regExp2Dfa :: Eq sy => RegExp sy -> Dfa [Int] sy
regExp2Ndfa' :: Eq sy => RegExp sy -> Int -> (Ndfa Int sy, Int)
Documentation
regExp2Ndfa
:: Eq sy
=> RegExp syRegular expression
-> Ndfa Int syAutomaton
Compute a Ndfa from a RegExp.
regExp2Dfa
:: Eq sy
=> RegExp syRegular expression
-> Dfa [Int] syAutomaton
Compute a Dfa from a RegExp. (via the intermediate Ndfa)
regExp2Ndfa' :: Eq sy => RegExp sy -> Int -> (Ndfa Int sy, Int)
Compute a Ndfa from a RegExp. Auxiliar function threading the context: the first available int to name the states
Produced by Haddock version 0.6