Copyright | (c) João Saraiva 20012002200320042005 |
---|---|
License | LGPL |
Maintainer | jas@di.uminho.pt |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
From Finite Automata into Regular Expressions
Code Included in the Lecture Notes on Language Processing (with a functional flavour).
- dfa2RegExp :: Eq sy => Dfa Int sy -> RegExp sy
- regExpFromTo :: Eq st => (st -> sy -> st) -> [sy] -> st -> st -> RegExp sy
- ndfaregExpFromTo :: Eq st => (st -> Maybe sy -> [st]) -> [sy] -> st -> st -> RegExp sy