| Package | Description |
|---|---|
| org.antlr.v4.analysis | |
| org.antlr.v4.codegen.model | |
| org.antlr.v4.parse | |
| org.antlr.v4.runtime | |
| org.antlr.v4.runtime.atn | |
| org.antlr.v4.runtime.misc | |
| org.antlr.v4.tool |
| Modifier and Type | Field and Description |
|---|---|
List<Tuple2<GrammarAST,String>> |
LeftRecursiveRuleAnalyzer.leftRecursiveRuleRefLabels
Pointer to ID node of ^(= ID element)
|
| Modifier and Type | Method and Description |
|---|---|
protected Tuple2<FrequencySet<String>,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 and Description |
|---|---|
static Tuple2<Integer,Integer> |
ScopeParser._parsePostfixDecl(Attribute attr,
String decl,
ActionAST a,
Grammar g) |
static Tuple2<Integer,Integer> |
ScopeParser._parsePrefixDecl(Attribute attr,
String decl,
ActionAST a,
Grammar g) |
| Modifier and Type | Method and Description |
|---|---|
static List<Tuple2<String,Integer>> |
ScopeParser.splitDecls(String s,
int separatorChar)
Given an argument list like
|
| Modifier and Type | Method and Description |
|---|---|
static Attribute |
ScopeParser.parseAttributeDef(ActionAST action,
Tuple2<String,Integer> decl,
Grammar g)
For decls like "String foo" or "char *foo32[]" compute the ID
and type declarations.
|
| Modifier and Type | Method and Description |
|---|---|
static int |
ScopeParser._splitArgumentList(String actionText,
int start,
int targetChar,
int separatorChar,
List<Tuple2<String,Integer>> args) |
| Modifier and Type | Field and Description |
|---|---|
protected Tuple2<? extends TokenSource,CharStream> |
Lexer._tokenFactorySourcePair |
protected static Tuple2<TokenSource,CharStream> |
CommonToken.EMPTY_SOURCE
An empty
Tuple2 which is used as the default value of
CommonToken.source for tokens that do not have a source. |
protected Tuple2<? extends TokenSource,CharStream> |
CommonToken.source
This is the backing field for
CommonToken.getTokenSource() and
CommonToken.getInputStream(). |
| Modifier and Type | Field and Description |
|---|---|
protected Deque<Tuple2<ParserRuleContext,Integer>> |
ParserInterpreter._parentContextStack
This stack corresponds to the _parentctx, _parentState pair of locals
that would exist on call stack frames with a recursive descent parser;
in the generated function for a left-recursive rule you'd see:
private EContext e(int _p) throws RecognitionException {
ParserRuleContext _parentctx = _ctx; // Pair.a
int _parentState = getState(); // Pair.b
...
|
| Modifier and Type | Method and Description |
|---|---|
Token |
TokenFactory.create(Tuple2<? extends TokenSource,CharStream> source,
int type,
String text,
int channel,
int start,
int stop,
int line,
int charPositionInLine)
This is the method used to create tokens in the lexer and in the
error handling strategy.
|
CommonToken |
CommonTokenFactory.create(Tuple2<? extends TokenSource,CharStream> source,
int type,
String text,
int channel,
int start,
int stop,
int line,
int charPositionInLine) |
| Constructor and Description |
|---|
CommonToken(Tuple2<? extends TokenSource,CharStream> source,
int type,
int channel,
int start,
int stop) |
| Modifier and Type | Method and Description |
|---|---|
protected Tuple2<DFAState,ParserRuleContext> |
ProfilingATNSimulator.computeTargetState(DFA dfa,
DFAState s,
ParserRuleContext remainingGlobalContext,
int t,
boolean useContext,
PredictionContextCache contextCache) |
protected Tuple2<DFAState,ParserRuleContext> |
ParserATNSimulator.computeTargetState(DFA dfa,
DFAState s,
ParserRuleContext remainingGlobalContext,
int t,
boolean useContext,
PredictionContextCache contextCache)
Compute a target state for an edge in the DFA, and attempt to add the
computed state and corresponding edge to the DFA.
|
| Modifier and Type | Method and Description |
|---|---|
static <T1,T2> Tuple2<T1,T2> |
Tuple.create(T1 item1,
T2 item2) |
| Modifier and Type | Method and Description |
|---|---|
static List<Tuple2<RuleDependency,AnnotatedElement>> |
RuleDependencyChecker.getDependencies(Class<?> clazz) |
static List<Tuple2<RuleDependency,Element>> |
RuleDependencyProcessor.getDependencies(RoundEnvironment roundEnv) |
List<Tuple2<K,V>> |
MultiMap.getPairs() |
| Modifier and Type | Field and Description |
|---|---|
List<Tuple2<GrammarAST,String>> |
LeftRecursiveRule.leftRecursiveRuleRefLabels
Did we delete any labels on direct left-recur refs? Points at ID of ^(= ID el)
|
| Modifier and Type | Method and Description |
|---|---|
Map<String,List<Tuple2<Integer,AltAST>>> |
Rule.getAltLabels()
Get
# labels. |
Map<String,List<Tuple2<Integer,AltAST>>> |
LeftRecursiveRule.getAltLabels()
Get -> labels from those alts we deleted for left-recursive rules.
|
Map<String,List<Tuple2<Integer,AltAST>>> |
Grammar.AltLabelVisitor.getLabeledAlternatives() |
Map<String,List<Tuple2<Integer,AltAST>>> |
Grammar.getLabeledAlternatives(RuleAST ast) |
static List<Tuple2<GrammarAST,GrammarAST>> |
Grammar.getStringLiteralAliasesFromLexerRules(GrammarRootAST ast)
Return list of (TOKEN_NAME node, 'literal' node) pairs
|
| Modifier and Type | Method and Description |
|---|---|
protected static boolean |
Grammar.defAlias(GrammarAST r,
String pattern,
org.antlr.runtime.tree.TreeWizard wiz,
List<Tuple2<GrammarAST,GrammarAST>> lexerRuleToStringLiteral) |
Copyright © 1992–2020 Tunnel Vision Laboratories, LLC. All rights reserved.