Uses of Class
antlr.Lookahead
Packages that use Lookahead
-
Uses of Lookahead in antlr
Modifier and TypeFieldDescriptionprotected Lookahead[]
Alternative.cache
protected Lookahead[]
RuleBlock.cache
protected Lookahead[]
RuleEndElement.cache
protected Lookahead[]
BlockWithImpliedExitPath.exitCache
lookahead to bypass block; set by deterministic().Modifier and TypeMethodDescriptionLLkAnalyzer.FOLLOW
(int k, RuleEndElement end) Compute the lookahead set of whatever follows references to the rule associated witht the FOLLOW block.LLkGrammarAnalyzer.FOLLOW
(int k, RuleEndElement end) Lookahead.intersection
(Lookahead q) What is the intersection of two lookahead depths? Only the Epsilon "bit" and bitset are considered.ActionElement.look
(int k) AlternativeBlock.look
(int k) BlockEndElement.look
(int k) CharLiteralElement.look
(int k) CharRangeElement.look
(int k) GrammarElement.look
(int k) LLkAnalyzer.look
(int k, ActionElement action) Actions are ignoredLLkAnalyzer.look
(int k, AlternativeBlock blk) Combine the lookahead computed for each alternativeLLkAnalyzer.look
(int k, BlockEndElement end) Compute what follows this place-holder node and possibly what begins the associated loop unless the node is locked.LLkAnalyzer.look
(int k, CharLiteralElement atom) Return this char as the lookahead if k=1.LLkAnalyzer.look
(int k, CharRangeElement r) LLkAnalyzer.look
(int k, GrammarAtom atom) LLkAnalyzer.look
(int k, 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.Combine the lookahead computed for each alternative.LLkAnalyzer.look
(int k, RuleEndElement end) If not locked or noFOLLOW set, compute FOLLOW of a rule.LLkAnalyzer.look
(int k, RuleRefElement rr) Compute the lookahead contributed by a rule reference.LLkAnalyzer.look
(int k, StringLiteralElement atom) LLkAnalyzer.look
(int k, SynPredBlock blk) The lookahead of a (...)=> block is the lookahead of what follows the block.LLkAnalyzer.look
(int k, TokenRangeElement r) LLkAnalyzer.look
(int k, TreeElement t) LLkAnalyzer.look
(int k, WildcardElement wc) LLkAnalyzer.look
(int k, ZeroOrMoreBlock blk) 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.LLkGrammarAnalyzer.look
(int k, ActionElement action) LLkGrammarAnalyzer.look
(int k, AlternativeBlock blk) LLkGrammarAnalyzer.look
(int k, BlockEndElement end) LLkGrammarAnalyzer.look
(int k, CharLiteralElement atom) LLkGrammarAnalyzer.look
(int k, CharRangeElement end) LLkGrammarAnalyzer.look
(int k, GrammarAtom atom) LLkGrammarAnalyzer.look
(int k, OneOrMoreBlock blk) LLkGrammarAnalyzer.look
(int k, RuleEndElement end) LLkGrammarAnalyzer.look
(int k, RuleRefElement rr) LLkGrammarAnalyzer.look
(int k, StringLiteralElement atom) LLkGrammarAnalyzer.look
(int k, SynPredBlock blk) LLkGrammarAnalyzer.look
(int k, TokenRangeElement end) LLkGrammarAnalyzer.look
(int k, TreeElement end) LLkGrammarAnalyzer.look
(int k, WildcardElement wc) LLkGrammarAnalyzer.look
(int k, ZeroOrMoreBlock blk) OneOrMoreBlock.look
(int k) RuleBlock.look
(int k) RuleEndElement.look
(int k) RuleRefElement.look
(int k) StringLiteralElement.look
(int k) SynPredBlock.look
(int k) TokenRangeElement.look
(int k) TokenRefElement.look
(int k) TreeElement.look
(int k) WildcardElement.look
(int k) ZeroOrMoreBlock.look
(int k) static Lookahead
Lookahead.of
(int el) Modifier and TypeMethodDescriptionvoid
Lookahead.combineWith
(Lookahead q) protected String
CppCodeGenerator.getLookaheadTestExpression
(Lookahead[] look, int k) protected String
CSharpCodeGenerator.getLookaheadTestExpression
(Lookahead[] look, int k) protected String
JavaCodeGenerator.getLookaheadTestExpression
(Lookahead[] look, int k) protected String
PythonCodeGenerator.getLookaheadTestExpression
(Lookahead[] look, int k) 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
Format a lookahead or follow set.void
Format a lookahead or follow set.void
Format a lookahead or follow set.void
DefaultToolErrorHandler.warnAltAmbiguity
(Grammar grammar, AlternativeBlock blk, boolean lexicalAnalysis, int depth, Lookahead[] sets, int altIdx1, int altIdx2) Issue a warning about ambiguity between a alternatesvoid
ToolErrorHandler.warnAltAmbiguity
(Grammar grammar, AlternativeBlock blk, boolean lexicalAnalysis, int depth, Lookahead[] sets, int altIdx1, int altIdx2) Issue a warning about ambiguity between a alternatesvoid
DefaultToolErrorHandler.warnAltExitAmbiguity
(Grammar grammar, BlockWithImpliedExitPath blk, boolean lexicalAnalysis, int depth, Lookahead[] sets, int altIdx) Issue a warning about ambiguity between an alternate and exit path.void
ToolErrorHandler.warnAltExitAmbiguity
(Grammar grammar, BlockWithImpliedExitPath blk, boolean lexicalAnalysis, int depth, Lookahead[] sets, int altIdx) Issue a warning about ambiguity between an alternate and exit path.