|
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 |
|
|
|
Documentation |
|
|
:: Eq sy | | => Dfa Int sy | Deterministic Automaton
| -> RegExp sy | Equivalent Regular Expression
| Compute a regular expression from a Dfa.
|
|
|
|
:: Eq st | | => st -> sy -> st | Transition Function
| -> [sy] | Vocabulary
| -> st | Origin State
| -> st | Destination State
| -> RegExp sy | Regular Expression
| Compute a regular expression that defines the transitions from an
origin to a destination in a Dfa.
|
|
|
|
:: Eq st | | => st -> Maybe sy -> [st] | Transition Function
| -> [sy] | Vocabulary
| -> st | Origin State
| -> st | Destination State
| -> RegExp sy | Regular Expression
| Compute a regular expression that defines the transitions from an
origin to a destination in a Ndfa.
|
|
|
Produced by Haddock version 2.3.0 |