LRMachine

Computes an LR(0) machine from a given context-free grammar. The resulting LR(0) machine is "ordered" in the sense of

J. Röhrich: "Methods for the Automatic Construction of Error Correcting Parsers", Acta Informatica 13, 115--139 (1980).

@author SöKa

Constructors

this
this(Grammar grammar, GrammarProperties grammarProperties)
Undocumented in source.

Members

Classes

State
class State
Undocumented in source.
Transition
class Transition
Undocumented in source.

Functions

computeLR0Machine
void computeLR0Machine()
Undocumented in source. Be warned that the author may not have intended to support it.
getNontTransitions
Transition[] getNontTransitions()
Undocumented in source. Be warned that the author may not have intended to support it.
getStates
State[] getStates()

Returns an unmodifiable List of the computed LR(0) machine's LRMachine.State objects. All states in this List are guaranteed to have distinct index values 0..(<i>n</i>-1) where <i>n</i> is the number of states in the List, and each state's index reflects the state's position in the List.

getTransition
Transition getTransition(State state, Symbol label)
Undocumented in source. Be warned that the author may not have intended to support it.
getTransitions
Transition[] getTransitions()
Undocumented in source. Be warned that the author may not have intended to support it.

Meta