Package | Description |
---|---|
antlr |
Modifier and Type | Field and Description |
---|---|
protected Lookahead[] |
RuleBlock.cache |
Modifier and Type | Method and Description |
---|---|
Lookahead |
LLkAnalyzer.FOLLOW(int k,
antlr.RuleEndElement end)
Compute the lookahead set of whatever follows references to
the rule associated witht the FOLLOW block.
|
Lookahead |
LLkGrammarAnalyzer.FOLLOW(int k,
antlr.RuleEndElement end) |
Lookahead |
Lookahead.intersection(Lookahead q)
What is the intersection of two lookahead depths?
Only the Epsilon "bit" and bitset are considered.
|
Lookahead |
RuleBlock.look(int k) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.ActionElement action)
Actions are ignored
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.ActionElement action) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.AlternativeBlock blk)
Combine the lookahead computed for each alternative
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.AlternativeBlock blk) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.BlockEndElement end)
Compute what follows this place-holder node and possibly
what begins the associated loop unless the
node is locked.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.BlockEndElement end) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.CharLiteralElement atom)
Return this char as the lookahead if k=1.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.CharLiteralElement atom) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.CharRangeElement r) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.CharRangeElement end) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.GrammarAtom atom) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.GrammarAtom atom) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.OneOrMoreBlock blk)
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.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.OneOrMoreBlock blk) |
Lookahead |
LLkAnalyzer.look(int k,
RuleBlock blk)
Combine the lookahead computed for each alternative.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
RuleBlock blk) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.RuleEndElement end)
If not locked or noFOLLOW set, compute FOLLOW of a rule.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.RuleEndElement end) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.RuleRefElement rr)
Compute the lookahead contributed by a rule reference.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.RuleRefElement rr) |
Lookahead |
LLkAnalyzer.look(int k,
String rule)
Compute the combined lookahead for all productions of a rule.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
String rule) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.StringLiteralElement atom) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.StringLiteralElement atom) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.SynPredBlock blk)
The lookahead of a (...)=> block is the lookahead of
what follows the block.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.SynPredBlock blk) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.TokenRangeElement r) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.TokenRangeElement end) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.TreeElement t) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.TreeElement end) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.WildcardElement wc) |
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.WildcardElement wc) |
Lookahead |
LLkAnalyzer.look(int k,
antlr.ZeroOrMoreBlock blk)
The (...)* element is the combined lookahead of the alternatives and what can
follow the loop.
|
Lookahead |
LLkGrammarAnalyzer.look(int k,
antlr.ZeroOrMoreBlock blk) |
static Lookahead |
Lookahead.of(int el) |
Modifier and Type | Method and Description |
---|---|
void |
Lookahead.combineWith(Lookahead q) |
protected String |
PythonCodeGenerator.getLookaheadTestExpression(Lookahead[] look,
int k) |
protected String |
CppCodeGenerator.getLookaheadTestExpression(Lookahead[] look,
int k) |
protected String |
CSharpCodeGenerator.getLookaheadTestExpression(Lookahead[] look,
int k) |
protected String |
JavaCodeGenerator.getLookaheadTestExpression(Lookahead[] look,
int k) |
Lookahead |
Lookahead.intersection(Lookahead q)
What is the intersection of two lookahead depths?
Only the Epsilon "bit" and bitset are considered.
|
static boolean |
LLkAnalyzer.lookaheadEquivForApproxAndFullAnalysis(Lookahead[] bset,
int k)
If the first k-1 sets are singleton sets, the appoximate
lookahead analysis is equivalent to full lookahead analysis.
|
void |
DiagnosticCodeGenerator.printSet(int depth,
int k,
Lookahead lookahead)
Format a lookahead or follow set.
|
void |
HTMLCodeGenerator.printSet(int depth,
int k,
Lookahead lookahead)
Format a lookahead or follow set.
|
void |
DocBookCodeGenerator.printSet(int depth,
int k,
Lookahead lookahead)
Format a lookahead or follow set.
|
Copyright © 2015 JBoss by Red Hat. All rights reserved.