Package | Description |
---|---|
org.antlr.v4.analysis | |
org.antlr.v4.codegen.model | |
org.antlr.v4.parse | |
org.antlr.v4.semantics | |
org.antlr.v4.tool | |
org.antlr.v4.tool.ast |
Modifier and Type | Field | Description |
---|---|---|
AltAST |
LeftRecursiveRuleAltInfo.altAST |
|
AltAST |
LeftRecursiveRuleAltInfo.originalAltAST |
Modifier and Type | Method | Description |
---|---|---|
AltAST |
LeftRecursiveRuleAnalyzer.addPrecedenceArgToRules(AltAST t,
int prec) |
Modifier and Type | Method | Description |
---|---|---|
AltAST |
LeftRecursiveRuleAnalyzer.addPrecedenceArgToRules(AltAST t,
int prec) |
|
void |
LeftRecursiveRuleAnalyzer.binaryAlt(AltAST originalAltTree,
int alt) |
|
void |
LeftRecursiveRuleAnalyzer.otherAlt(AltAST originalAltTree,
int alt) |
|
void |
LeftRecursiveRuleAnalyzer.prefixAlt(AltAST originalAltTree,
int alt) |
|
void |
LeftRecursiveRuleAnalyzer.setAltAssoc(AltAST t,
int alt) |
|
void |
LeftRecursiveRuleAnalyzer.suffixAlt(AltAST originalAltTree,
int alt) |
Constructor | Description |
---|---|
LeftRecursiveRuleAltInfo(int altNum,
String altText,
String leftRecursiveRuleRefLabel,
String altLabel,
boolean isListLabel,
AltAST originalAltAST) |
Modifier and Type | Method | Description |
---|---|---|
protected void |
ElementFrequenciesVisitor.enterAlternative(AltAST tree) |
|
protected void |
ElementFrequenciesVisitor.exitAlternative(AltAST tree) |
|
protected FrequencySet<String> |
RuleFunction.getElementFrequenciesForAlt(AltAST ast) |
Given list of X and r refs in alt, compute how many of each there are
|
Modifier and Type | Method | Description |
---|---|---|
Set<Decl> |
RuleFunction.getDeclsForAllElements(List<AltAST> altASTs) |
for all alts, find which ref X or r needs List
Must see across alts.
|
Modifier and Type | Method | Description |
---|---|---|
void |
LeftRecursiveRuleWalker.binaryAlt(AltAST altTree,
int alt) |
|
void |
GrammarTreeVisitor.discoverAlt(AltAST alt) |
|
void |
GrammarTreeVisitor.discoverOuterAlt(AltAST alt) |
|
protected void |
GrammarTreeVisitor.enterAlternative(AltAST tree) |
|
protected void |
GrammarTreeVisitor.enterLexerOuterAlternative(AltAST tree) |
|
protected void |
GrammarTreeVisitor.enterOuterAlternative(AltAST tree) |
|
protected void |
GrammarTreeVisitor.exitAlternative(AltAST tree) |
|
protected void |
GrammarTreeVisitor.exitLexerOuterAlternative(AltAST tree) |
|
protected void |
GrammarTreeVisitor.exitOuterAlternative(AltAST tree) |
|
void |
GrammarTreeVisitor.finishAlt(AltAST alt) |
|
void |
GrammarTreeVisitor.finishOuterAlt(AltAST alt) |
|
void |
LeftRecursiveRuleWalker.otherAlt(AltAST altTree,
int alt) |
|
void |
LeftRecursiveRuleWalker.prefixAlt(AltAST altTree,
int alt) |
|
void |
LeftRecursiveRuleWalker.setAltAssoc(AltAST altTree,
int alt) |
|
void |
LeftRecursiveRuleWalker.suffixAlt(AltAST altTree,
int alt) |
Modifier and Type | Method | Description |
---|---|---|
void |
RuleCollector.discoverOuterAlt(AltAST alt) |
|
void |
SymbolCollector.discoverOuterAlt(AltAST alt) |
Modifier and Type | Field | Description |
---|---|---|
AltAST |
Alternative.ast |
Modifier and Type | Method | Description |
---|---|---|
Map<String,List<Pair<Integer,AltAST>>> |
LeftRecursiveRule.getAltLabels() |
Get -> labels from those alts we deleted for left-recursive rules.
|
Map<String,List<Pair<Integer,AltAST>>> |
Rule.getAltLabels() |
Get
# labels. |
List<AltAST> |
LeftRecursiveRule.getUnlabeledAltASTs() |
|
List<AltAST> |
Rule.getUnlabeledAltASTs() |
Modifier and Type | Method | Description |
---|---|---|
AltAST |
AltAST.dupNode() |
|
AltAST |
GrammarAST.getOutermostAltNode() |
Modifier and Type | Method | Description |
---|---|---|
Object |
GrammarASTVisitor.visit(AltAST node) |
Constructor | Description |
---|---|
AltAST(AltAST node) |
Copyright © 1992–2018 ANTLR. All rights reserved.