Language.HaLex.FaAsDiGraph

Finite Automata as Directed Graphs in GraphViz. Code Included in the Lecture Notes on Language Processing (with a functional flavour).

Documentation

ndfa2graphviz :: (Show a, Show sy, Ord a, Eq sy) => Ndfa a sy -> [Char] -> [Char]

Print a Ndfa in GraphViz

ndfa2graphviz2file :: (Show a, Show sy, Ord a, Eq sy) => Ndfa a sy -> [Char] -> IO ()

Print a Ndfa in GraphViz in a file

dfa2graphviz :: (Show a, Show sy, Ord a, Eq sy) => Dfa a sy -> [Char] -> [Char]

Print a Dfa in GraphViz

dfa2graphviz2file :: (Show a, Show sy, Ord a, Eq sy) => Dfa a sy -> [Char] -> IO ()

Print a Dfa in GraphViz in a file

tographviz

Arguments

:: (Eq sy, Show sy, Ord st, Show st)

=> Ndfa st sy

Automaton

-> [Char]

Graph's name

-> [Char]

Node's shape

-> [Char]

Orientation

-> (st -> [Char])

Show function to print the state ids

-> [Char]

Print a Ndfa in GraphViz

tographvizIO :: (Show st, Show sy, Ord st, Eq sy) => Ndfa st sy -> [Char] -> [Char] -> [Char] -> (st -> [Char]) -> IO ()

dfa2DiGraphWithNoSyncSt :: (Show a, Show sy, Ord a, Eq sy) => Dfa a sy -> [Char] -> [Char]

dfaDiGraphWithNoSyncStIO :: (Show a, Show sy, Ord a, Eq sy) => Dfa a sy -> [Char] -> FilePath -> IO ()

genOneArrow :: Show a => [Char] -> a -> [Char] -> [Char]