1 /* dfa - DFA construction routines */
10 /*  to contract no. DE-AC03-76SF00098 between the United States */
43 /* check_for_backing_up - check a DFA state for backing up
48  * ds is the number of the state to check and state[] is its out-transitions,
54 …&& !dfaacc[ds].dfaacc_set) || (!reject && !dfaacc[ds].dfaacc_state)) {	/* state is non-accepting */  in check_for_backing_up()
59 				 _("State #%d is non-accepting -\n"), ds);  in check_for_backing_up()
64 			/* Now identify it further using the out- and  in check_for_backing_up()
65 			 * jam-transitions.  in check_for_backing_up()
75 /* check_trailing_context - check to see if NFA state set constitutes
90  *  further-along scanning of the pattern.  In these cases, a warning
128 /* dump_associated_rules - list the rules associated with a DFA state
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
179  * (i.e., all those which are not out-transitions, plus EOF).  The dump
193 	fprintf (file, _(" out-transitions: "));  in dump_transitions()
201 	fprintf (file, _("\n jam-transitions: EOF "));  in dump_transitions()
209 /* epsclosure - construct the epsilon closure of a set of ndfa states
219  *  transitions going out, unioned with the set of states which have non-null
237 do{ trans1[state] = trans1[state] - MARKER_DIFFERENCE;} while(0)  in epsclosure()
342 /* increase_max_dfas - increase the maximum number of DFAs */
365 /* ntod - convert an ndfa to a dfa
375 	int     num_full_table_rows=0;	/* used only for -f */  in ntod()
425 	 * transitions on NUL characters.  We don't do this for full-speed  in ntod()
426 	 * (-F) scanners, since for them we don't have a simple state  in ntod()
492 			 * table, so build it for entries from 0 .. numecs - 1.  in ntod()
507 		 * we'll wait until we can calculate yynxt_tbl->td_hilen.  in ntod()
512 		yynxt_tbl->td_hilen = 1;  in ntod()
513 		yynxt_tbl->td_lolen = (flex_uint32_t) num_full_table_rows;  in ntod()
514 		yynxt_tbl->td_data = yynxt_data =  in ntod()
515 			calloc(yynxt_tbl->td_lolen *  in ntod()
516 					    yynxt_tbl->td_hilen,  in ntod()
524 		/* Unless -Ca, declare it "short" because it's a real  in ntod()
525 		 * long-shot that that won't be large enough.  in ntod()
587 				   ("could not create unique end-of-buffer state"));  in ntod()
617 					/* Symbol has unique out-transitions. */  in ntod()
697 			yynxt_tbl->td_hilen++;  in ntod()
698 			yynxt_tbl->td_data = yynxt_data =  in ntod()
700 						     yynxt_tbl->td_hilen *  in ntod()
701 						     yynxt_tbl->td_lolen *  in ntod()
708 			/* Supply array's 0-element. */  in ntod()
710 				mk2data (-end_of_buffer_state);  in ntod()
712 					-end_of_buffer_state;  in ntod()
724 				mk2data (state[i] ? state[i] : -ds);  in ntod()
726 					state[i] ? state[i] : -ds;  in ntod()
739 			 * it's supposed to, i.e., jam on end-of-buffer.  in ntod()
780 		 * out-transition.  in ntod()
785 			--onesp;  in ntod()
796 /* snstods - converts a set of ndfa states into a dfa state
920 /* symfollowset - follow the symbol transitions one step
939 			sym = -sym;  in symfollowset()
961 						goto bottom;  in symfollowset()
990 	      bottom:;  in symfollowset()
997 /* sympartition - partition characters with same out-transitions
1009 	 * characters which have out-transitions from the given state.  Thus  in sympartition()
1014 		duplist[i] = i - 1;  in sympartition()
1026 			if (tch < -lastccl || tch >= csize) {  in sympartition()
1039 				tch = -tch;  in sympartition()