Top Description Fields Constructors Methods
org.antlr.v4.runtime

public Class ParserInterpreter

extends Parser
Class Inheritance
Imports
org.antlr.v4.runtime.atn.ATN, .ATNState, .ActionTransition, .AtomTransition, .DecisionState, .LoopEndState, .ParserATNSimulator, .PrecedencePredicateTransition, .PredicateTransition, .RuleStartState, .RuleTransition, .StarLoopEntryState, .Transition, org.antlr.v4.runtime.misc.NotNull, .Tuple, .Tuple2, java.util.ArrayDeque, .BitSet, .Collection, .Deque

A parser simulator that mimics what ANTLR's generated parser code does. A ParserATNSimulator is used to make predictions via adaptivePredict but this class moves a pointer through the ATN to simulate parsing. ParserATNSimulator just makes us efficient rather than having to backtrack, for example. This properly creates parse trees even for left recursive rules. We rely on the left recursive rule invocation and special predicate transitions to make left recursive rules work. See TestParserInterpreter for examples.

Field Summary

Modifier and TypeField and Description
protected final Deque<Tuple2<ParserRuleContext, Integer>>
_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 ...

protected final ATN
protected final String
protected int
overrideDecision

We need a map from (decision,inputIndex)->forced alt for computing ambiguous parse trees.

protected int
protected int
protected boolean
protected InterpreterRuleContext
overrideDecisionRoot

What is the current context when we override a decisions?

protected final BitSet
pushRecursionContextStates

This identifies StarLoopEntryState's that begin the (...)* precedence loops of left recursive rules.

protected InterpreterRuleContext
protected final String[]
protected final String[]
tokenNames

Deprecated
private final Vocabulary
Inherited from org.antlr.v4.runtime.Parser:
_buildParseTrees_ctx_errHandler_input_parseListeners_precedenceStack_syntaxErrorsmatchedEOF

Constructor Summary

AccessConstructor and Description
public
ParserInterpreter(ParserInterpreter
The interpreter to copy
old
)

A copy constructor that creates a new parser interpreter by reusing the fields of a previous interpreter.

public
public
ParserInterpreter(String grammarFileName, Vocabulary vocabulary, Collection<String> ruleNames, ATN atn, TokenStream input)

Method Summary

Modifier and TypeMethod and Description
public void
addDecisionOverride(int decision, int tokenIndex, int forcedAlt)

Override this parser interpreters normal decision-making process at a particular decision and input token index.

protected InterpreterRuleContext
createInterpreterRuleContext(ParserRuleContext parent, int invokingStateNumber, int ruleIndex)

Provide simple "factory" for InterpreterRuleContext's.

public void
enterRecursionRule(ParserRuleContext localctx, int state, int ruleIndex, int precedence)

Overrides org.antlr.v4.runtime.Parser.enterRecursionRule.

public ATN
getATN()

Overrides org.antlr.v4.runtime.Recognizer.getATN.

Get the ATN used by the recognizer for prediction.
protected ATNState
public String
getGrammarFileName()

Implements abstract org.antlr.v4.runtime.Recognizer.getGrammarFileName.

For debugging and other purposes, might want the grammar name.
public InterpreterRuleContext
public InterpreterRuleContext
getRootContext()

Return the root of the parse, which can be useful if the parser bails out.

public String[]
public String[]
getTokenNames()

Implements abstract org.antlr.v4.runtime.Recognizer.getTokenNames.

Deprecated
Used to print out token names like ID during debugging and error reporting.
public Vocabulary
getVocabulary()

Overrides org.antlr.v4.runtime.Recognizer.getVocabulary.

Get the vocabulary used by the recognizer.
public ParserRuleContext
parse(int startRuleIndex)

Begin parsing at startRuleIndex

protected void
recover(RecognitionException e)

Rely on the error handler for this parser but, if no tokens are consumed to recover, add an error node.

protected Token
public void
reset()

Overrides org.antlr.v4.runtime.Parser.reset.

reset the parser's state
protected int
visitDecisionState(DecisionState p)

Method visitDecisionState() is called when the interpreter reaches a decision state (instance of DecisionState).

protected void
protected void
Inherited from org.antlr.v4.runtime.Parser:
addContextToParseTreeaddParseListenercompileParseTreePatterncompileParseTreePatternconsumecreateErrorNodecreateTerminalNodedumpDFAenterLeftFactoredRuleenterOuterAltenterRecursionRuleenterRuleexitRulegetATNWithBypassAltsgetBuildParseTreegetContextgetCurrentTokengetDFAStringsgetErrorHandlergetErrorListenerDispatchgetExpectedTokensgetExpectedTokensWithinCurrentRulegetInputStreamgetInvokingContextgetNumberOfSyntaxErrorsgetParseInfogetParseListenersgetPrecedencegetRuleContextgetRuleIndexgetRuleInvocationStackgetRuleInvocationStackgetSourceNamegetTokenFactorygetTrimParseTreeinContextisExpectedTokenisMatchedEOFisTracematchmatchWildcardnotifyErrorListenersnotifyErrorListenersprecpredpushNewRecursionContextremoveParseListenerremoveParseListenerssetBuildParseTreesetContextsetErrorHandlersetInputStreamsetProfilesetTracesetTrimParseTreetriggerEnterRuleEventtriggerExitRuleEventunrollRecursionContexts

Field Detail

_parentContextStackback to summary
protected final Deque<Tuple2<ParserRuleContext, Integer>> _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 ... } Those values are used to create new recursive rule invocation contexts associated with left operand of an alt like "expr '*' expr".

atnback to summary
protected final ATN atn
grammarFileNameback to summary
protected final String grammarFileName
overrideDecisionback to summary
protected int overrideDecision

We need a map from (decision,inputIndex)->forced alt for computing ambiguous parse trees. For now, we allow exactly one override.

overrideDecisionAltback to summary
protected int overrideDecisionAlt
overrideDecisionInputIndexback to summary
protected int overrideDecisionInputIndex
overrideDecisionReachedback to summary
protected boolean overrideDecisionReached
overrideDecisionRootback to summary
protected InterpreterRuleContext overrideDecisionRoot

What is the current context when we override a decisions? This tells us what the root of the parse tree is when using override for an ambiguity/lookahead check.

pushRecursionContextStatesback to summary
protected final BitSet pushRecursionContextStates

This identifies StarLoopEntryState's that begin the (...)* precedence loops of left recursive rules.

rootContextback to summary
protected InterpreterRuleContext rootContext
ruleNamesback to summary
protected final String[] ruleNames
tokenNamesback to summary
protected final String[] tokenNames

Deprecated

Annotations
@Deprecated
vocabularyback to summary
private final Vocabulary vocabulary
Annotations
@NotNull

Constructor Detail

ParserInterpreterback to summary
public ParserInterpreter(ParserInterpreter old)

A copy constructor that creates a new parser interpreter by reusing the fields of a previous interpreter.

Parameters
old:ParserInterpreter

The interpreter to copy

Since
4.5
ParserInterpreterback to summary
public ParserInterpreter(String grammarFileName, Collection<String> tokenNames, Collection<String> ruleNames, ATN atn, TokenStream input)
Annotations
@Deprecated
ParserInterpreterback to summary
public ParserInterpreter(String grammarFileName, Vocabulary vocabulary, Collection<String> ruleNames, ATN atn, TokenStream input)

Method Detail

addDecisionOverrideback to summary
public void addDecisionOverride(int decision, int tokenIndex, int forcedAlt)

Override this parser interpreters normal decision-making process at a particular decision and input token index. Instead of allowing the adaptive prediction mechanism to choose the first alternative within a block that leads to a successful parse, force it to take the alternative, 1..n for n alternatives. As an implementation limitation right now, you can only specify one override. This is sufficient to allow construction of different parse trees for ambiguous input. It means re-parsing the entire input in general because you're never sure where an ambiguous sequence would live in the various parse trees. For example, in one interpretation, an ambiguous input sequence would be matched completely in expression but in another it could match all the way back to the root. s : e '!'? ; e : ID | ID '!' ; Here, x! can be matched as (s (e ID) !) or (s (e ID !)). In the first case, the ambiguous sequence is fully contained only by the root. In the second case, the ambiguous sequences fully contained within just e, as in: (e ID !). Rather than trying to optimize this and make some intelligent decisions for optimization purposes, I settled on just re-parsing the whole input and then using {link Trees#getRootOfSubtreeEnclosingRegion} to find the minimal subtree that contains the ambiguous sequence. I originally tried to record the call stack at the point the parser detected and ambiguity but left recursive rules create a parse tree stack that does not reflect the actual call stack. That impedance mismatch was enough to make it it challenging to restart the parser at a deeply nested rule invocation. Only parser interpreters can override decisions so as to avoid inserting override checking code in the critical ALL(*) prediction execution path.

Since
4.5
createInterpreterRuleContextback to summary
protected InterpreterRuleContext createInterpreterRuleContext(ParserRuleContext parent, int invokingStateNumber, int ruleIndex)

Provide simple "factory" for InterpreterRuleContext's.

Since
4.5.1
enterRecursionRuleback to summary
public void enterRecursionRule(ParserRuleContext localctx, int state, int ruleIndex, int precedence)

Overrides org.antlr.v4.runtime.Parser.enterRecursionRule.

Annotations
@Override
getATNback to summary
public ATN getATN()

Overrides org.antlr.v4.runtime.Recognizer.getATN.

Doc from org.antlr.v4.runtime.Recognizer.getATN.

Get the ATN used by the recognizer for prediction.

Returns:ATN

The ATN used by the recognizer for prediction.

Annotations
@Override
getATNStateback to summary
protected ATNState getATNState()
getGrammarFileNameback to summary
public String getGrammarFileName()

Implements abstract org.antlr.v4.runtime.Recognizer.getGrammarFileName.

Doc from org.antlr.v4.runtime.Recognizer.getGrammarFileName.

For debugging and other purposes, might want the grammar name. Have ANTLR generate an implementation for this method.

Annotations
@Override
getOverrideDecisionRootback to summary
public InterpreterRuleContext getOverrideDecisionRoot()
getRootContextback to summary
public InterpreterRuleContext getRootContext()

Return the root of the parse, which can be useful if the parser bails out. You still can access the top node. Note that, because of the way left recursive rules add children, it's possible that the root will not have any children if the start rule immediately called and left recursive rule that fails.

Since
4.5.1
getRuleNamesback to summary
public String[] getRuleNames()

Implements abstract org.antlr.v4.runtime.Recognizer.getRuleNames.

Annotations
@Override
getTokenNamesback to summary
public String[] getTokenNames()

Implements abstract org.antlr.v4.runtime.Recognizer.getTokenNames.

Doc from org.antlr.v4.runtime.Recognizer.getTokenNames.

Deprecated

Used to print out token names like ID during debugging and error reporting. The generated parsers implement a method that overrides this to point to their String[] tokenNames.

Annotations
@Override
@Deprecated
getVocabularyback to summary
public Vocabulary getVocabulary()

Overrides org.antlr.v4.runtime.Recognizer.getVocabulary.

Doc from org.antlr.v4.runtime.Recognizer.getVocabulary.

Get the vocabulary used by the recognizer.

Returns:Vocabulary

A Vocabulary instance providing information about the vocabulary used by the grammar.

Annotations
@Override
parseback to summary
public ParserRuleContext parse(int startRuleIndex)

Begin parsing at startRuleIndex

recoverback to summary
protected void recover(RecognitionException e)

Rely on the error handler for this parser but, if no tokens are consumed to recover, add an error node. Otherwise, nothing is seen in the parse tree.

recoverInlineback to summary
protected Token recoverInline()
resetback to summary
public void reset()

Overrides org.antlr.v4.runtime.Parser.reset.

Doc from org.antlr.v4.runtime.Parser.reset.

reset the parser's state

Annotations
@Override
visitDecisionStateback to summary
protected int visitDecisionState(DecisionState p)

Method visitDecisionState() is called when the interpreter reaches a decision state (instance of DecisionState). It gives an opportunity for subclasses to track interesting things.

visitRuleStopStateback to summary
protected void visitRuleStopState(ATNState p)
visitStateback to summary
protected void visitState(ATNState p)