Uses of Package
me.jaimegarza.syntax.model.parser

Packages that use me.jaimegarza.syntax.model.parser

Package	Description
me.jaimegarza.syntax
me.jaimegarza.syntax.algorithm
me.jaimegarza.syntax.env
me.jaimegarza.syntax.generator
me.jaimegarza.syntax.language
me.jaimegarza.syntax.model.parser

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax

Class and Description
Type ~pojo class defines the convenience type used for $$, $1, $2 etc to be used in code generation rules.

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax.algorithm

Class and Description
Dot ~pojo class During the table creation process an algorithm is performed to obtain a state machine (turing machine) with the shifts and reduces needed at all states of the system.
LookAhead ~pojo class When the parser table is generated with a LALR parser, a set of lookaheads is computed.
Rule ~pojo class During the parsing process, the grammar is represented as a list of rules.
RuleItem ~pojo class During the parsing process, the grammar is represented as a list of Rules.
State ~pojo class A grammar G is defined as a set {N, T, Σ ∈ N, R} ni ∈ N is the set of NonTerminal symbols ti ∈ T is the set of Terminal symbols Σ ∈ N, is the "distinguished symbol", or the root of the grammar R is the set of Rules of the form

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax.env

Class and Description
Driver A parser can be driven by a traditional parsing technique of reading the input stream until the end of string is reached.
NonTerminal ~pojo class Represents a non terminal in the grammar (i.e.
Rule ~pojo class During the parsing process, the grammar is represented as a list of rules.
RuleItem ~pojo class During the parsing process, the grammar is represented as a list of Rules.
State ~pojo class A grammar G is defined as a set {N, T, Σ ∈ N, R} ni ∈ N is the set of NonTerminal symbols ti ∈ T is the set of Terminal symbols Σ ∈ N, is the "distinguished symbol", or the root of the grammar R is the set of Rules of the form
Symbol ~pojo class Represents a symbol in the grammar.
Terminal ~pojo class Represents a terminal (lexical element) in the grammar (i.e.
TokenGroup
Type ~pojo class defines the convenience type used for $$, $1, $2 etc to be used in code generation rules.

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax.generator

Class and Description
Associativity Associativity is the property of rules and symbols provided to resolve conflicts.
NonTerminal ~pojo class Represents a non terminal in the grammar (i.e.
Rule ~pojo class During the parsing process, the grammar is represented as a list of rules.
RuleItem ~pojo class During the parsing process, the grammar is represented as a list of Rules.
Symbol ~pojo class Represents a symbol in the grammar.
Terminal ~pojo class Represents a terminal (lexical element) in the grammar (i.e.
Type ~pojo class defines the convenience type used for $$, $1, $2 etc to be used in code generation rules.

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax.language

Class and Description
Action ~pojo class For packed parsers, the parsing table is divided in a list of Action and GoTo.
ErrorToken ~pojo class Represents an error non terminal in the grammar .
GoTo ~pojo class A goto is associated to a non-terminal, and defines the transitions from a state to the destination state with the NonTerminal.
State ~pojo class A grammar G is defined as a set {N, T, Σ ∈ N, R} ni ∈ N is the set of NonTerminal symbols ti ∈ T is the set of Terminal symbols Σ ∈ N, is the "distinguished symbol", or the root of the grammar R is the set of Rules of the form
Symbol ~pojo class Represents a symbol in the grammar.
Terminal ~pojo class Represents a terminal (lexical element) in the grammar (i.e.

Classes in me.jaimegarza.syntax.model.parser used by me.jaimegarza.syntax.model.parser

Class and Description
Action ~pojo class For packed parsers, the parsing table is divided in a list of Action and GoTo.
Associativity Associativity is the property of rules and symbols provided to resolve conflicts.
Dot ~pojo class During the table creation process an algorithm is performed to obtain a state machine (turing machine) with the shifts and reduces needed at all states of the system.
Driver A parser can be driven by a traditional parsing technique of reading the input stream until the end of string is reached.
GoTo ~pojo class A goto is associated to a non-terminal, and defines the transitions from a state to the destination state with the NonTerminal.
NonTerminal ~pojo class Represents a non terminal in the grammar (i.e.
Rule ~pojo class During the parsing process, the grammar is represented as a list of rules.
RuleItem ~pojo class During the parsing process, the grammar is represented as a list of Rules.
State ~pojo class A grammar G is defined as a set {N, T, Σ ∈ N, R} ni ∈ N is the set of NonTerminal symbols ti ∈ T is the set of Terminal symbols Σ ∈ N, is the "distinguished symbol", or the root of the grammar R is the set of Rules of the form
Symbol ~pojo class Represents a symbol in the grammar.
Terminal ~pojo class Represents a terminal (lexical element) in the grammar (i.e.
Type ~pojo class defines the convenience type used for $$, $1, $2 etc to be used in code generation rules.