UMinho Haskell Libraries (1.0) Contents Index

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 sy Regular expression -> Ndfa Int sy Automaton Compute a Ndfa form a RegExp.

regExp2Dfa

:: Eq sy => RegExp sy Regular expression -> Dfa [Int] sy Automaton Compute a Ndfa form a RegExp.

regExp2Ndfa' :: Eq sy => RegExp sy -> Int -> (Ndfa Int sy, Int)

Produced by Haddock version 0.6