Lines Matching defs:state
40 /* add_accept - add an accepting state to a machine
48 /* Hang the accepting number off an epsilon state. if it is associated
49 * with a state that has a non-epsilon out-transition, then the state
100 _( "\n\n********** beginning dump of nfa with start state %d\n" ),
106 * starts at state 1 and ends at lastnfa.
112 fprintf( stderr, _( "state # %4d\t" ), ns );
152 int state = 0;
157 state = mkstate( transchar[i] );
161 mkxtion( finalst[state], trans1[i] + state - i );
165 mkxtion( finalst[state],
166 trans2[i] + state - i );
169 accptnum[state] = accptnum[i];
172 if ( state == 0 )
175 state_offset = state - i + 1;
314 /* mark_beginning_as_normal - mark each "beginning" state in a machine
318 * The "beginning" states are the epsilon closure of the first state
347 _( "bad state type in mark_beginning_as_normal()" ) );
390 * new = mkclos( state );
392 * new - a new state which matches the closure of "state"
395 int mkclos( state )
396 int state;
398 return mkopt( mkposcl( state ) );
428 * some state interior to "mach" might point back to the beginning
468 * state of "first" or "second" if they satisfy "FREE_EPSILON".
509 * new = mkposcl( state );
511 * new - a machine matching the positive closure of "state"
514 int mkposcl( state )
515 int state;
519 if ( SUPER_FREE_EPSILON(finalst[state]) )
521 mkxtion( finalst[state], state );
522 return state;
528 mkxtion( eps, state );
529 return link_machines( state, eps );
577 /* mkstate - create a state with a transition on a given symbol
581 * state = mkstate( sym );
583 * state - a new state matching sym
584 * sym - the symbol the new state is to have an out-transition on
587 * state array (and increments LASTNFA accordingly). The routine DUPMACHINE
661 /* mkxtion - make a transition from one state to another
667 * statefrom - the state from which the transition is to be made
668 * stateto - the state to which the transition is to be made
682 { /* second out-transition for an epsilon state */