|
| Language.Sdf.FlowGraph | | Portability | portable
| | Stability | experimental
| | Maintainer | Tiago Alves and Joost Visser
|
|
|
|
|
|
| Description |
| Functionality regarding the flow graph of an SDF grammar.
|
|
| Synopsis |
|
|
|
| Documentation |
|
| calcNonSingletonLevels :: SDF -> [[String]] |
| Calculate and print the elements of the non-singleton components of the
grammar. |
|
| Helper functions |
|
| calcGrammarGraph :: SDF -> Gph String |
| Calculates the control flow graph of a Grammar where the node are the
non-terminals names (strings) and the edges from node a to other nodes
are created if the other nodes are non-terminals that appears in the RHS
of the non-terminal a. |
|
| ruleDeps :: Production -> [(String, String)] |
| Calculates all dependencies of a rule by creating a list of pairs which
the first element represent the non-terminal of the rule and the second
represents the dependent non-terminal. |
|
| Produced by Haddock version 0.6 |
