|  | 
| | Language.HaLex.RegExpAsDiGraph | | Portability | portable |  | Stability | provisional |  | Maintainer | jas@di.uminho.pt | 
 | 
 | 
|  | 
|  | 
|  | 
| Description | 
| Regular Expressions as Directed Graphs (in GraphViz)
Code Included in the Lecture Notes on 
Language Processing (with a functional flavour). | 
|  | 
| Synopsis | 
|  | 
|  | 
|  | 
| Documentation | 
|  | 
| re2graphviz | 
| | :: (Ord sy, Show sy) |  |  | => RegExp sy | Regular Expression (Abstract) |  | -> [Char] | Graph's Name |  | -> Bool | True: Deterministic ; False: Non-Deterministic |  | -> Bool | Minimized? |  | -> Bool | Beautified?   (states as numbers) |  | -> Bool | Sync State? |  | -> [Char] |  |  | Print a RegExp in GraphViz | 
 | 
|  | 
| re2DiGraph :: (Show sy, Ord sy) => RegExp sy -> [Char] -> [Char] | 
|  | 
| re2DiGraph''' :: (Show sy, Ord sy) => RegExp sy -> [Char] -> [Char] | 
|  | 
| re2DiGraphIO :: (Show sy, Ord sy) => RegExp sy -> [Char] -> IO () | 
|  | 
| Produced by Haddock version 0.6 |