Lines Matching full:transition
144 /* Returns true if an nfa state has an epsilon out-transition slot
152 /* Returns true if an nfa state has an epsilon out-transition character
192 #define JAM -1 /* to mark a missing DFA transition */
236 #define ONE_STACK_SIZE 500 /* stack of states with only one out-transition */
237 #define SAME_TRANS -1 /* transition is the same as "default" entry for state */
249 * that the state's transition table is first compared with a potential
250 * template of the most common out-transition instead of with the first
255 /* The percentage the number of differences between a state's transition
262 /* The percentage the number of differences between a state's transition
274 /* The percentage the number of differences between a state's transition
282 * fit the transition table into "holes" inside the nxt/chk table.
286 /* Size of region set aside to cache the complete transition table of
447 /* Variables for stack of states having only one out-transition:
449 * onesym - transition symbol
470 * transchar - transition character
471 * trans1 - transition state
472 * trans2 - 2nd transition state for epsilons
477 * rule (i.e., the state which marks the transition from
581 * nultrans - NUL transition for each state
594 * numsnpairs - number of state/nextstate transition pairs
642 * peakpairs - peak number of transition pairs we had to store internally
765 /* Generate full speed compressed transition table. */
771 extern void genftbl PROTO((void)); /* generate full transition table */
782 /* Generate the code to make a NUL transition. */
788 /* Generate data statements for the transition tables. */
797 extern void make_tables PROTO((void)); /* generate transition tables */
952 /* Create a state with a transition on a given symbol. */
1030 extern void inittbl PROTO((void)); /* initialize transition tables */
1035 * only one out-transition.
1039 /* Place a state into full speed transition table. */
1042 /* Save states with only one out-transition to be processed later. */
