contrib/flex/dfa.c

82  *				int accset[nacc+1], int nacc );
96  *    accset[1 .. nacc] is the list of accepting numbers for the DFA state.
99 void check_trailing_context (nfa_states, num_states, accset, nacc)
101      int    *accset;
122 				if (accset[j] & YY_TRAILING_HEAD_MASK) {
222  *			int accset[num_rules+1], int *nacc_addr,
231  *  accset holds a list of the accepting numbers, and the size of accset is
238 int    *epsclosure (t, ns_addr, accset, nacc_addr, hv_addr)
239      int    *t, *ns_addr, accset[], *nacc_addr, *hv_addr;
258 accset[++nacc] = nfaccnum; \
383 	int    *accset, ds, nacc, newds;
405 	/* accset needs to be large enough to hold all of the rules present
408 	accset = allocate_integer_array ((num_rules + 1) * 2);
425 		accset[i] = NIL;
587 		nset = epsclosure (nset, &numstates, accset, &nacc,
590 		if (snstods (nset, numstates, accset, nacc, hashval, &ds)) {
597 							accset, nacc);
602 		if (!snstods (nset, 0, accset, 0, 0, &end_of_buffer_state))
640 							   accset, &nacc,
644 					    (nset, numstates, accset, nacc,
655 								 accset,
808 	flex_free ((void *) accset);
817  *				int accset[num_rules+1], int nacc,
823 int snstods (sns, numstates, accset, nacc, hashval, newds_addr)
824      int sns[], numstates, accset[], nacc, hashval, *newds_addr;
897 		qsort (&accset [1], nacc, sizeof (accset [1]), intcmp);
904 			dfaacc[newds].dfaacc_set[i] = accset[i];
906 			if (accset[i] <= num_rules)
910 				rule_useful[accset[i]] = true;
923 			if (accset[i] < j)
924 				j = accset[i];