/** How many states does the DFA predictor have? */ public int getNumberOfStates() { return dfa.getNumberOfStates(); }
/** How many states does the DFA predictor have? */ public int getNumberOfStates() { return dfa.getNumberOfStates(); }
/** How many states does the DFA predictor have? */ public int getNumberOfStates() { return dfa.getNumberOfStates(); }
/** How many states does the DFA predictor have? */ public int getNumberOfStates() { return dfa.getNumberOfStates(); }
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 boolean canInlineDecision() { return !isCyclic() && !probe.isNonLLStarDecision() && getNumberOfStates() < CodeGenerator.MAX_ACYCLIC_DFA_STATES_INLINE; }
special = new Vector<Integer>(this.getNumberOfStates()); // Vector<short> special.setSize(this.getNumberOfStates()); specialStates = new ArrayList<DFAState>(); // List<DFAState> specialStateSTs = new ArrayList<ST>(); // List<ST> accept = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> accept.setSize(this.getNumberOfStates()); eot = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> eot.setSize(this.getNumberOfStates()); eof = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> eof.setSize(this.getNumberOfStates()); min = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> min.setSize(this.getNumberOfStates()); max = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> max.setSize(this.getNumberOfStates()); transition = new Vector<Vector<Integer>>(this.getNumberOfStates()); // Vector<Vector<int>> transition.setSize(this.getNumberOfStates()); transitionEdgeTables = new Vector<Integer>(this.getNumberOfStates()); // Vector<int> transitionEdgeTables.setSize(this.getNumberOfStates());
special = new Vector(this.getNumberOfStates()); // Vector<short> special.setSize(this.getNumberOfStates()); specialStates = new ArrayList(); // List<DFAState> specialStateSTs = new ArrayList(); // List<ST> accept = new Vector(this.getNumberOfStates()); // Vector<int> accept.setSize(this.getNumberOfStates()); eot = new Vector(this.getNumberOfStates()); // Vector<int> eot.setSize(this.getNumberOfStates()); eof = new Vector(this.getNumberOfStates()); // Vector<int> eof.setSize(this.getNumberOfStates()); min = new Vector(this.getNumberOfStates()); // Vector<int> min.setSize(this.getNumberOfStates()); max = new Vector(this.getNumberOfStates()); // Vector<int> max.setSize(this.getNumberOfStates()); transition = new Vector(this.getNumberOfStates()); // Vector<Vector<int>> transition.setSize(this.getNumberOfStates()); transitionEdgeTables = new Vector(this.getNumberOfStates()); // Vector<Vector<int>> transitionEdgeTables.setSize(this.getNumberOfStates());
special = new Vector(this.getNumberOfStates()); // Vector<short> special.setSize(this.getNumberOfStates()); specialStates = new ArrayList(); // List<DFAState> specialStateSTs = new ArrayList(); // List<ST> accept = new Vector(this.getNumberOfStates()); // Vector<int> accept.setSize(this.getNumberOfStates()); eot = new Vector(this.getNumberOfStates()); // Vector<int> eot.setSize(this.getNumberOfStates()); eof = new Vector(this.getNumberOfStates()); // Vector<int> eof.setSize(this.getNumberOfStates()); min = new Vector(this.getNumberOfStates()); // Vector<int> min.setSize(this.getNumberOfStates()); max = new Vector(this.getNumberOfStates()); // Vector<int> max.setSize(this.getNumberOfStates()); transition = new Vector(this.getNumberOfStates()); // Vector<Vector<int>> transition.setSize(this.getNumberOfStates()); transitionEdgeTables = new Vector(this.getNumberOfStates()); // Vector<Vector<int>> transitionEdgeTables.setSize(this.getNumberOfStates());
if ( snum!=getNumberOfStates() ) { ErrorManager.internalError("DFA "+decisionNumber+": "+ decisionNFAStartState.getDescription()+" num unique states "+getNumberOfStates()+ "!= num renumbered states "+snum);
if (dfa.getNumberOfStates() != 0) { info += dfa.getNumberOfStates()+" states";
if ( snum!=getNumberOfStates() ) { ErrorManager.internalError("DFA "+decisionNumber+": "+ decisionNFAStartState.getDescription()+" num unique states "+getNumberOfStates()+ "!= num renumbered states "+snum);
if ( snum!=getNumberOfStates() ) { ErrorManager.internalError("DFA "+decisionNumber+": "+ decisionNFAStartState.getDescription()+" num unique states "+getNumberOfStates()+ "!= num renumbered states "+snum);
if ( snum!=getNumberOfStates() ) { ErrorManager.internalError("DFA "+decisionNumber+": "+ decisionNFAStartState.getDescription()+" num unique states "+getNumberOfStates()+ "!= num renumbered states "+snum);
System.out.println("cost: "+lookaheadDFA.getNumberOfStates()+ " states, "+(int)(stopDFA-startDFA)+" ms");
System.out.println("cost: "+lookaheadDFA.getNumberOfStates()+ " states, "+(int)(stopDFA-startDFA)+" ms");
System.out.println("cost: "+lookaheadDFA.getNumberOfStates()+ " states, "+(int)(stopDFA-startDFA)+" ms");
System.out.println("cost: "+lookaheadDFA.getNumberOfStates()+ " states, "+(int)(stopDFA-startDFA)+" ms");