Package | Description |
---|---|
org.antlr.v4.analysis | |
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<Pair<GrammarAST,String>> |
LeftRecursiveRuleAnalyzer.leftRecursiveRuleRefLabels
Pointer to ID node of ^(= ID element)
|
Modifier and Type | Method and Description |
---|---|
static List<Pair<String,Integer>> |
ScopeParser.splitDecls(String s,
int separatorChar)
Given an argument list like
x, (*a).foo(21,33), 3.2+1, '\n',
"a,oo\nick", {bl, "fdkj"eck}, ["cat\n,", x, 43]
convert to a list of attributes.
|
Modifier and Type | Method and Description |
---|---|
static Attribute |
ScopeParser.parseAttributeDef(ActionAST action,
Pair<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<Pair<String,Integer>> args) |
Modifier and Type | Field and Description |
---|---|
protected Pair<TokenSource,CharStream> |
Lexer._tokenFactorySourcePair |
protected static Pair<TokenSource,CharStream> |
CommonToken.EMPTY_SOURCE
An empty
Pair which is used as the default value of
CommonToken.source for tokens that do not have a source. |
protected Pair<TokenSource,CharStream> |
CommonToken.source
This is the backing field for
CommonToken.getTokenSource() and
CommonToken.getInputStream() . |
Modifier and Type | Field and Description |
---|---|
protected Deque<Pair<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 |
---|---|
Symbol |
TokenFactory.create(Pair<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(Pair<TokenSource,CharStream> source,
int type,
String text,
int channel,
int start,
int stop,
int line,
int charPositionInLine) |
Constructor and Description |
---|
CommonToken(Pair<TokenSource,CharStream> source,
int type,
int channel,
int start,
int stop) |
Modifier and Type | Method and Description |
---|---|
protected Pair<ATNConfigSet,ATNConfigSet> |
ParserATNSimulator.splitAccordingToSemanticValidity(ATNConfigSet configs,
ParserRuleContext outerContext)
Walk the list of configurations and split them according to
those that have preds evaluating to true/false.
|
Modifier and Type | Method and Description |
---|---|
List<Pair<K,V>> |
MultiMap.getPairs() |
Modifier and Type | Field and Description |
---|---|
List<Pair<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<Pair<Integer,AltAST>>> |
Rule.getAltLabels()
Get
# labels. |
Map<String,List<Pair<Integer,AltAST>>> |
LeftRecursiveRule.getAltLabels()
Get -> labels from those alts we deleted for left-recursive rules.
|
static List<Pair<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<Pair<GrammarAST,GrammarAST>> lexerRuleToStringLiteral) |
Copyright © 1992–2020 ANTLR. All rights reserved.