Lines Matching refs:transition
171 /** Map an edge transition table to a unique set number; ordered so
173 * and then ref them from within the transition[][] table. Like this
188 /** The unique edge transition class number; every time we see a new
191 * some of the big edge transition tables are seen about 57 times.
195 /* This DFA can be converted to a transition[state][char] table and
214 public Vector transition;
330 if ( transition==null || transition.size()==0 ) {
333 List encoded = new ArrayList(transition.size());
334 // walk Vector<Vector<FormattedInteger>> which is the transition[][] table
335 for (int i = 0; i < transition.size(); i++) {
336 Vector transitionsForState = (Vector) transition.elementAt(i);
413 transition = new Vector(this.getNumberOfStates()); // Vector<Vector<int>>
414 transition.setSize(this.getNumberOfStates());
434 // can't compute min,max,special,transition on accepts
466 System.out.println("transition="+transition);
504 Transition edge = (Transition) s.transition(j);
530 // must be predicates or pure EOT transition; just zero out min, max
553 transition.set(s.stateNumber, stateTransitions);
555 Transition edge = (Transition) s.transition(j);
566 // set the transition if the label is valid (don't do EOF)
575 // track unique state transition tables so we can reuse
590 * we need another way to test that in the DFA transition function.
594 Transition edge = (Transition) s.transition(j);
628 Transition edge = (Transition) s.transition(j);
753 (NFAState)TokensRuleStart.transition[0].target;
790 Transition t = d.transition(i);
832 Transition t = d.transition(i);
856 Transition t = d.transition(i);
877 Transition t = d.transition(i);
940 // Visit every transition, track if at least one edge reaches stop state
944 Transition t = d.transition(i);
1126 * it is all char. The EOT transition has nothing to match and is