Get a lookahead character
Get a lookahead character
Return the token type of the ith token of lookahead where i=1
is the current token being examined by the parser (i.e., it
has not been matched yet).
Return the token type of the ith token of lookahead where i=1
is the current token being examined by the parser (i.e., it
has not been matched yet).
Get a lookahead token value
track tail of hidden list emanating from previous
monitored token
Map String (program name) -> Integer index
Return the length of the list.
return how much space is being used by the bits array not
how many actually have member bits on.
Lexer-specific grammar subclass
This object contains the data associated with an
input stream of characters.
A simple List interface that describes operations
on a list.
Given a character value, return a string representing the character
literal that can be recognized by the target language compiler.
Given a character value, return a string representing the character
literal that can be recognized by the target language compiler.
Given a character value, return a string representing the character
literal that can be recognized by the target language compiler.
Converts a String into a string literal
This works for languages that use double-quotes for string literals.
Converts a String into a string literal
This works for languages that use double-quotes for string literals.
Converts a String into a string literal
This works for languages that use double-quotes for string literals.
A linked list cell, which contains a ref to the object and next cell.
An enumeration of a LList.
Create an enumeration attached to a LList
A Linked List Implementation (not thread-safe for simplicity)
(adds to the tail) (has an enumeration)
A linear-approximate LL(k) grammar analzyer.
Combine the lookahead computed for each alternative
Compute what follows this place-holder node and possibly
what begins the associated loop unless the
node is locked.
Return this char as the lookahead if k=1.
The lookahead of a (...)+ block is the combined lookahead of
all alternatives and, if an empty path is found, the lookahead
of what follows the block.
Combine the lookahead computed for each alternative.
If not locked or noFOLLOW set, compute FOLLOW of a rule.
Compute the lookahead contributed by a rule reference.
The lookahead of a (...)=> block is the lookahead of
what follows the block.
The (...)* element is the combined lookahead of the alternatives and what can
follow the loop.
Compute the combined lookahead for all productions of a rule.
This object holds all information needed to represent
the lookahead for any particular lookahead computation
for a single lookahead depth.
create a new lookahead set with the LL(1) set to the parameter
create an empty lookahead set, but with cycle
If the first k-1 sets are singleton sets, the appoximate
lookahead analysis is equivalent to full lookahead analysis.
Is the lookahead for this alt empty?
Is the lookahead for this alt empty?
Is the lookahead for this alt empty?
Return the ith token of lookahead