| AssemblyFirstFollow |
A class to compute the first and follow of every non-terminal in a grammar
See Alfred V.
|
| AssemblyParseAcceptResult |
A successful result from parsing
|
| AssemblyParseActionGotoTable |
The Action/Goto table for a LALR(1) parser
This table is unconventional in that it permits a single cell to be populated by more than one
action.
|
| AssemblyParseActionGotoTable.AcceptAction |
An ACCEPT (acc) entry
|
| AssemblyParseActionGotoTable.Action |
An action in the Action/Goto table
|
| AssemblyParseActionGotoTable.GotoAction |
A GOTO (Gn) entry
|
| AssemblyParseActionGotoTable.ReduceAction |
A REDUCE (Rn) entry
|
| AssemblyParseActionGotoTable.ShiftAction |
A SHIFT (Sn) entry
|
| AssemblyParseErrorResult |
An unsuccessful result from parsing
|
| AssemblyParseMachine |
A class that implements the LALR(1) parsing algorithm
Instances of this class store a parse state.
|
| AssemblyParser |
A class to encapsulate LALR(1) parsing for a given grammar
This class constructs the Action/Goto table (and all the other trappings) of a LALR(1) parser
and provides a AssemblyParser.parse(String) method to parse actual sentences. |
| AssemblyParser.MergeKey |
A map key used to identify merges for Step 4 in Stephen Jackson's rant
|
| AssemblyParser.MergeValue |
|
| AssemblyParseResult |
A result of parsing a sentence
If the sentence was accepted, this yields a parse tree.
|
| AssemblyParseState |
A state in an LR(0) parsing machine
Each item consists of a kernel and an implied closure.
|
| AssemblyParseStateItem |
An item in the state of an LR(0) parser
An item is a production with a dot indicating a position while parsing
|
| AssemblyParseTransitionTable |
The transition table defining an LR(0) parsing machine
|