|
| 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 |
|
| dfa2RegExp :: Eq sy => Dfa Int sy -> RegExp sy |
| Compute a regular expression from a Dfa. |
|
| regExpFromTo :: Eq st => (st -> sy -> st) -> [sy] -> st -> st -> RegExp sy |
| Compute a regular expression that defines the transitions from an
origin to a destination in a Dfa. |
|
| Produced by Haddock version 0.6 |
