UMinho Haskell Libraries (2004.10.28)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 :: RegExp -> Ndfa Int Char
regExp2Dfa :: RegExp -> Dfa [Int] Char
Documentation
regExp2Ndfa
:: RegExpRegular expression
-> Ndfa Int CharAutomaton
Compute a Ndfa form a RegExp.
regExp2Dfa
:: RegExpRegular expression
-> Dfa [Int] CharAutomaton
Compute a Ndfa form a RegExp.
Produced by Haddock version 0.6