Language.HaLex.RegExp2Fa

From Regular Expressions into Non-Deterministic and Deterministic Finite Automata

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

Documentation

regExp2Ndfa

Arguments

:: Eq sy

=> RegExp sy

Regular expression

-> Ndfa Int sy

Automaton

Compute a Ndfa from a RegExp.

regExp2Dfa

Arguments

:: Eq sy

=> RegExp sy

Regular expression

-> Dfa [Int] sy

Automaton

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