int outermostPrecedenceReturn = ((EpsilonTransition)t).outermostPrecedenceReturn(); if (outermostPrecedenceReturn == _dfa.atnStartState.ruleIndex) { c.setPrecedenceFilterSuppressed(true);
if (epsilonTransition.outermostPrecedenceReturn() != -1) { continue;
protected void epsilon(ATNState a, @NotNull ATNState b, boolean prepend) { for (Transition t : a.getTransitions()) { if (t.getSerializationType() != Transition.EPSILON) { continue; } if (t.target == b && ((EpsilonTransition)t).outermostPrecedenceReturn() == -1) { // This transition was already added return; } } if ( a!=null ) { int index = prepend ? 0 : a.getNumberOfTransitions(); a.addTransition(index, new EpsilonTransition(b)); } }
ATNState intermediate = transition.target; if (transition.getSerializationType() != Transition.EPSILON || ((EpsilonTransition)transition).outermostPrecedenceReturn() != -1 || intermediate.getStateType() != ATNState.BASIC || !intermediate.onlyHasEpsilonTransitions()) || ((EpsilonTransition)intermediate.getOptimizedTransition(j)).outermostPrecedenceReturn() != -1)
int outermostPrecedenceReturn = ((EpsilonTransition)t).outermostPrecedenceReturn(); if (outermostPrecedenceReturn == _dfa.atnStartState.ruleIndex) { c.setPrecedenceFilterSuppressed(true);
int outermostPrecedenceReturn = ((EpsilonTransition)t).outermostPrecedenceReturn(); if (outermostPrecedenceReturn == _dfa.atnStartState.ruleIndex) { c.setPrecedenceFilterSuppressed(true);
int outermostPrecedenceReturn = ((EpsilonTransition)t).outermostPrecedenceReturn(); if (outermostPrecedenceReturn == _dfa.atnStartState.ruleIndex) { c.setPrecedenceFilterSuppressed(true);
int outermostPrecedenceReturn = ((EpsilonTransition)t).outermostPrecedenceReturn(); if (outermostPrecedenceReturn == dfa.atnStartState.ruleIndex) { c.setPrecedenceFilterSuppressed(true);