All Classes and Interfaces
Class
Description
The base concrete class for non-terminal Nodes
Class to hold the code that comes from the grammar file
and is later "injected" into the output source files
A visitor that eliminates unused code.
A convenience base class for defining empty expansions, i.e.
Describes expansions - entities that may occur on the right hand sides of
productions.
This object is the root Node of the data structure that contains all the
information regarding a JavaCC processing job.
Token subclass to represent lexically invalid input
Token subclass to represent lexically invalid input
Token literal values and constants.
Lexical States
A rather rough-and-ready class for pretty-printing java source code.
A somewhat more sophisticated class for pretty-printing java source code.
Base object that contains lexical data.
Entry point.
A Visitor object that builds an Nfa start and end state from a Regular expression.
Class representing a single state of a Non-deterministic Finite Automaton (NFA)
Note that any given lexical state is implemented as an NFA.
Token literal values and constants.
Lexical States
An abstract base class from which all the AST nodes that
are regular expressions inherit.
This class is what remains of a bunch of horrible legacy code
that was used to build up the data structures for the parser.
A class to represent a set of Token types.