/** Return k if decision is LL(k) for some k else return max int */ public int getMaxLookaheadDepth() { if ( isCyclic() ) { return Integer.MAX_VALUE; } return max_k; }
public boolean isCyclic() { return dfa.isCyclic(); }
public boolean isCyclic() { return dfa.isCyclic(); }
public boolean isCyclic() { return dfa.isCyclic(); }
public boolean isCyclic() { return dfa.isCyclic(); }
public boolean isClassicDFA() { return !isCyclic() && !nfa.grammar.decisionsWhoseDFAsUsesSemPreds.contains(this) && !nfa.grammar.decisionsWhoseDFAsUsesSynPreds.contains(this); }
public boolean isClassicDFA() { return !isCyclic() && !nfa.grammar.decisionsWhoseDFAsUsesSemPreds.contains(this) && !nfa.grammar.decisionsWhoseDFAsUsesSynPreds.contains(this); }
public boolean isClassicDFA() { return !isCyclic() && !nfa.grammar.decisionsWhoseDFAsUsesSemPreds.contains(this) && !nfa.grammar.decisionsWhoseDFAsUsesSynPreds.contains(this); }
public boolean canInlineDecision() { return !isCyclic() && !probe.isNonLLStarDecision() && getNumberOfStates() < CodeGenerator.MAX_ACYCLIC_DFA_STATES_INLINE; }
public int getNumberOfCyclicDecisions() { int n = 0; for (int i=1; i<=getNumberOfDecisions(); i++) { Decision d = getDecision(i); if ( d.dfa!=null && d.dfa.isCyclic() ) { n++; } } return n; }
public int getNumberOfCyclicDecisions() { int n = 0; for (int i=1; i<=getNumberOfDecisions(); i++) { Decision d = getDecision(i); if ( d.dfa!=null && d.dfa.isCyclic() ) { n++; } } return n; }
public boolean canInlineDecision() { return !isCyclic() && !probe.isNonLLStarDecision() && getNumberOfStates() < CodeGenerator.MAX_ACYCLIC_DFA_STATES_INLINE; }
public boolean canInlineDecision() { return !isCyclic() && !probe.isNonLLStarDecision() && getNumberOfStates() < CodeGenerator.MAX_ACYCLIC_DFA_STATES_INLINE; }
public boolean canInlineDecision() { return !isCyclic() && !probe.isNonLLStarDecision() && getNumberOfStates() < CodeGenerator.MAX_ACYCLIC_DFA_STATES_INLINE; }
public int getNumberOfCyclicDecisions() { int n = 0; for (int i=1; i<=getNumberOfDecisions(); i++) { Decision d = getDecision(i); if ( d.dfa!=null && d.dfa.isCyclic() ) { n++; } } return n; }
public int getNumberOfCyclicDecisions() { int n = 0; for (int i=1; i<=getNumberOfDecisions(); i++) { Decision d = getDecision(i); if ( d.dfa!=null && d.dfa.isCyclic() ) { n++; } } return n; }
buf.append(" decision ").append(decision).append(":"); if ( d.dfa.isCyclic() ) buf.append(" cyclic"); if ( k!=Integer.MAX_VALUE ) buf.append(" k=").append(k); // fixed, no sempreds if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated
buf.append(" decision ").append(decision).append(":"); if ( d.dfa.isCyclic() ) buf.append(" cyclic"); if ( k!=Integer.MAX_VALUE ) buf.append(" k=").append(k); // fixed, no sempreds if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated
buf.append(" decision "+decision+":"); if ( d.dfa.isCyclic() ) buf.append(" cyclic"); if ( k!=Integer.MAX_VALUE ) buf.append(" k="+k); // fixed, no sempreds if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated
c = new Color(255, 220, 0); if(dfa.isCyclic()) { if(info.length() > 0) info += ", "; info += "cyclic";