Lines Matching defs:states
60 * is represented internall with a DFA comprised of multiple states, each of
63 * Because of this, you need to iterate over this list of DFA states. You'll
66 * will be one of the iterated states from stateToSyntacticallyAmbiguousAltsSet.
74 /** Track all DFA states with nondeterministic alternatives.
113 /** The set of states w/o emanating edges and w/o resolving sem preds. */
189 /** If no states are dead-ends, no alts are unreachable, there are
230 /** How many states does the DFA predictor have? */
238 * conflict resolution or alts w/o accept states).
244 /** return set of states w/o emanating edges and w/o resolving sem preds.
245 * These states come about because the analysis algorithm had to
271 /** Return all DFA states in this DFA that have NFA configurations that
283 * accept states for that alt that make an alt reachable.
333 * find the path of NFA states associated with the labels sequence.
354 * using states 9, 11, and 12 rather than 5, 7, 8 because state 5, for
365 // first add all NFA states leading up to altStart state
460 //System.err.println("no emanating edges for states: "+danglingStates);
535 // now walk truly unique (unaliased) list of dfa states with inf recur
707 * target state. Also, compute the set of DFA states
708 * that are on a path from start to target; return in states parameter.
712 Set states) {
714 states.add(targetState);
742 if ( reachesState(edgeTarget, targetState, states) ) {
743 states.add(s);
764 * between the two ignoring epsilon. Limit your scan to a set of states
767 * a parameter. The incoming states set must be all states that lead
774 Set states,
779 // pick the first edge in states as the one to traverse
783 if ( states.contains(edgeTarget) &&
791 states,
804 * path taken through the NFA. Return the list of NFA states visited
814 List path) // output list of NFA states
828 System.out.println("enter state "+s.stateNumber+" visited states: "+
832 // pick the first edge whose target is in states and whose