See: Description
Interface | Description |
---|---|
GraphFactory<E extends InliningGraph> | |
InliningArc<E extends InliningVertex> |
An arc in an inlining graph
|
InliningGraph<T extends InliningArc<E>,E extends InliningVertex<T>> |
An inlining graph is a graph that directs inlining of nonterminals in productions.
|
InliningVertex<E extends InliningArc> |
A vertex in an inlining graph
|
SplitIndicesFinder |
Class | Description |
---|---|
AbstractInliningArc<E extends InliningVertex> | |
AbstractInliningGraph<T extends InliningArc<E>,E extends InliningVertex<T>> | |
AbstractInliningVertex<E extends InliningArc> | |
CycleReducer<E extends InliningGraph<?,?>> |
Reduces cycles in the DGraph for a grammar until it only contains cycles to the
nodes themselves
|
InliningGraphCycleFinder |
Finds in a
DGraph all cycles in the graph provided that these cycles are disjoint. |
UnboundedAssociateRemover |
This visitor ensures that all associates are bounded for the particular grammar, that is there are no productions
of the for an(bn).
|
Copyright © 2008-2013 Mathias Schwarz.