Lines Matching full:transitions

48  * ds is the number of the state to check and state[] is its out-transitions,
65 			 * jam-transitions.  in check_for_backing_up()
172 /* dump_transitions - list the transitions associated with a DFA state
177  * Goes through the set of out-transitions and lists them in human-readable
178  * form (i.e., not as equivalence classes); also lists jam transitions
179  * (i.e., all those which are not out-transitions, plus EOF).  The dump
193 	fprintf (file, _(" out-transitions: "));  in dump_transitions()
197 	/* now invert the members of the set to get the jam transitions */  in dump_transitions()
201 	fprintf (file, _("\n jam-transitions: EOF "));  in dump_transitions()
218  *  number of epsilon transitions, which themselves do not have epsilon
219  *  transitions going out, unioned with the set of states which have non-null
425 	 * transitions on NUL characters.  We don't do this for full-speed  in ntod()
440 	 * storing the transitions in a compressed table, since the code  in ntod()
448 	 * encoding NUL's transitions in the table will spoil this, we  in ntod()
476 		 * saving null transitions for later, separate encoding.  in ntod()
491 			/* We won't be including NUL's transitions in the  in ntod()
617 					/* Symbol has unique out-transitions. */  in ntod()
656 					 * transitions as duplist(sym)'s  in ntod()
746 			 * common, and how many transitions to it there are.  in ntod()
920 /* symfollowset - follow the symbol transitions one step
997 /* sympartition - partition characters with same out-transitions
1009 	 * characters which have out-transitions from the given state.  Thus  in sympartition()