Grammar for details on how they are definedSee: Description
| Interface | Description |
|---|---|
| AlphabetSymbol |
An alphabet symbol can be a
Terminal or a NonTerminal. |
| GrammarEntity |
A grammar entity is the super type of symbols and productions in a
Grammar. |
| GrammarEntityVisitor |
The alphabet symbol visitor contains three methods for each kind of
GrammarEntity class. |
| Class | Description |
|---|---|
| AbstractGrammarEntityVisitor |
This GrammarEntityVisitor will traverse the grammar graph but only traverse each production of a nonterminal
exactly once.
|
| AnyTerminal | |
| FlowGraph2Grammar | |
| FreshTerminalVisitor |
Replaces all non terminals by a fresh copy, meaning that any non terminal used somewhere in a production
is never used anywhere else.
|
| Grammar |
A context free grammar is a quadtuple (V, Σ, S, P), where
V is the non terminal alphabet
Σ is the terminal alphabet (in this version Σ is the full Unicode alphabet
V ∩ Ε = Ø
S ⊆ V is the set of all start nonterminals
U is the combined alphabet V ∪ Ε
P is a finite set of productions on the form A → θ, where A ∈ V and θ ∈ U*
We write αAω ⇒ αθω when A → θ ∈ P and α,ω ∈ U*.
|
| Grammar2StringGrammar |
Converts a grammar from the servletanalysis representation to the string grammar representation.
|
| GrammarPrettyPrinter |
A pretty printer will print a
Grammar in a readable way (similar to how grammars
are normally written in CS articles). |
| NonTerminal |
A Nonterminal in the grammar.
|
| NonTerminal2Automaton | |
| Production |
A single production is a list of
AlphabetSymbols that a NonTerminal can derive. |
| Terminal |
A terminal symbol.
|
| XMLPrettyPrinter |
Pretty prints the grammar to an XML file so that parsing is not ambigious.
|
| XMLReader |
Grammar for details on how they are definedCopyright © 2008-2013 Mathias Schwarz.