usr.bin/grep/dfa.c

94 /* ISASCIIDIGIT differs from ISDIGIT, as follows:
1168 /* The grammar understood by the parser is as follows.
1602 	for (j = 0; j < d->follows[old.index].nelem; ++j)
1604 	    p.index = d->follows[old.index].elems[j].index;
1711   CALLOC(d->follows, position_set, d->tindex);
1736 	    merge(&tmp, &d->follows[pos[j].index], &merged);
1737 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1739 	    copy(&merged, &d->follows[pos[j].index]);
1756 	    merge(&tmp, &d->follows[pos[j].index], &merged);
1757 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1759 	    copy(&merged, &d->follows[pos[j].index]);
1820 	MALLOC(d->follows[i].elems, position, nalloc[i]);
1856 	fprintf(stderr, "follows(%d:", i);
1859 	for (j = d->follows[i].nelem - 1; j >= 0; --j)
1861 	    fprintf(stderr, " %d:", d->follows[i].elems[j].index);
1862 	    prtok(d->tokens[d->follows[i].elems[j].index]);
1866 	copy(&d->follows[i], &merged);
1868 	if (d->follows[i].nelem < merged.nelem)
1869 	  REALLOC(d->follows[i].elems, position, merged.nelem);
1870 	copy(&merged, &d->follows[i]);
1908    of the its elements' follows.  This set is the set of positions of the
1946   position_set follows;		/* Union of the follows of some group. */
2086   MALLOC(follows.elems, position, d->nleaves);
2103       copy(&d->states[0].elems, &follows);
2104       state = state_index(d, &follows, 0, 0);
2106 	state_newline = state_index(d, &follows, 1, 0);
2110 	state_letter = state_index(d, &follows, 0, 1);
2123       follows.nelem = 0;
2125       /* Find the union of the follows of the positions of the group.
2128 	for (k = 0; k < d->follows[grps[i].elems[j].index].nelem; ++k)
2129 	  insert(d->follows[grps[i].elems[j].index].elems[k], &follows);
2134 	  /* If a token in follows.elems is not 1st byte of a multibyte
2135 	     character, or the states of follows must accept the bytes
2137 	     Then, if a state of follows encounter a byte, it must not be
2139 	     We cansel to add state[0].follows to next state, because
2153 	  for (j = 0; j < follows.nelem; ++j)
2155 	      if (!(d->multibyte_prop[follows.elems[j].index] & 1))
2172 	  insert(d->states[0].elems.elems[j], &follows);
2177 	for (j = 0; j < follows.nelem; ++j)
2178 	  if (PREV_NEWLINE_DEPENDENT(follows.elems[j].constraint))
2186 	for (j = 0; j < follows.nelem; ++j)
2187 	  if (PREV_LETTER_DEPENDENT(follows.elems[j].constraint))
2190       /* Find the state(s) corresponding to the union of the follows. */
2191       state = state_index(d, &follows, 0, 0);
2193 	state_newline = state_index(d, &follows, 1, 0);
2197 	state_letter = state_index(d, &follows, 0, 1);
2219   free(follows.elems);
2644 	for (j = 0; j < d->follows[d->states[s].mbps.elems[i].index].nelem;
2646 	  insert(d->follows[d->states[s].mbps.elems[i].index].elems[j],
2667   position_set follows;
2705   follows.nelem = 0;
2706   MALLOC(follows.elems, position, d->nleaves);
2712   rs = transit_state_consume_1char(d, s, pp, match_lens, &mbclen, &follows);
2715   s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2720       follows.nelem = 0;
2721       rs = transit_state_consume_1char(d, s1, pp, NULL, &mbclen, &follows);
2727 		 j < d->follows[d->states[s1].mbps.elems[i].index].nelem; j++)
2728 	      insert(d->follows[d->states[s1].mbps.elems[i].index].elems[j],
2729 		     &follows);
2733       s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2737   free(follows.elems);
3032     if (d->follows[i].elems)
3033       free((ptr_t) d->follows[i].elems);
3034   free((ptr_t) d->follows);