| fri.patterns.interpreter.parsergenerator.parsertables |
|
| Java Source File Name | Type | Comment |
| AbstractParserTables.java | Class | Base class for all parser tables. |
| FirstSets.java | Class | Map of all FOLLOW-sets of a SLR syntax. |
| FollowSets.java | Class | Map of all FOLLOW-sets of a SLR syntax. |
| LALRParserTables.java | Class | Parser table generator for LALR interpretation. |
| LALRSyntaxNode.java | Class | LR bottom-up parser syntax node. |
| LRParserTables.java | Class | Parser table generator for LR interpretation. |
| LRSyntaxNode.java | Class | LR bottom-up parser syntax node. |
| Nullable.java | Class | Nullability of a nonterminal means that it can be "nothing", i.e.
there is a rule that contains the nonterminal on the left side and
no symbol on the right side (empty right side), expressing an optional
rule.
Algorithm:
Sort rules by size.
Search every rule that contain the nonterminal on left side.
Scan the left side of every rule until a terminal or a non-nullable
nonterminal appears. |
| ParserBuildException.java | Class | |
| SLRParserTables.java | Class | A table generator, building SLR bottom-up parser tables from a syntax.
An artifical START-node gets inserted. |
| SLRSyntaxNode.java | Class | SLR bottom-up parser syntax node.
The build() method of an no-arg-constructed node is used to fill a
state node list. |