Cross Reference: /src/external/gpl2/gettext/dist/gettext-tools/libgrep/dfa.c

Lines Matching defs:follows
79 /* ISASCIIDIGIT differs from ISDIGIT, as follows:
1147 /* The grammar understood by the parser is as follows.
1583 	for (j = 0; j < d->follows[old.index].nelem; ++j)
1585 	    p.index = d->follows[old.index].elems[j].index;
1692   CALLOC(d->follows, position_set, d->tindex);
1717 	    merge(&tmp, &d->follows[pos[j].index], &merged);
1718 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1720 	    copy(&merged, &d->follows[pos[j].index]);
1737 	    merge(&tmp, &d->follows[pos[j].index], &merged);
1738 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1740 	    copy(&merged, &d->follows[pos[j].index]);
1801 	MALLOC(d->follows[i].elems, position, nalloc[i]);
1837 	fprintf(stderr, "follows(%d:", i);
1840 	for (j = d->follows[i].nelem - 1; j >= 0; --j)
1842 	    fprintf(stderr, " %d:", d->follows[i].elems[j].index);
1843 	    prtok(d->tokens[d->follows[i].elems[j].index]);
1847 	copy(&d->follows[i], &merged);
1849 	if (d->follows[i].nelem < merged.nelem)
1850 	  REALLOC(d->follows[i].elems, position, merged.nelem);
1851 	copy(&merged, &d->follows[i]);
1889    of the its elements' follows.  This set is the set of positions of the
1927   position_set follows;		/* Union of the follows of some group. */
2067   MALLOC(follows.elems, position, d->nleaves);
2084       copy(&d->states[0].elems, &follows);
2085       state = state_index(d, &follows, 0, 0);
2087 	state_newline = state_index(d, &follows, 1, 0);
2091 	state_letter = state_index(d, &follows, 0, 1);
2104       follows.nelem = 0;
2106       /* Find the union of the follows of the positions of the group.
2109 	for (k = 0; k < d->follows[grps[i].elems[j].index].nelem; ++k)
2110 	  insert(d->follows[grps[i].elems[j].index].elems[k], &follows);
2115 	  /* If a token in follows.elems is not 1st byte of a multibyte
2116 	     character, or the states of follows must accept the bytes
2118 	     Then, if a state of follows encounter a byte, it must not be
2120 	     We cansel to add state[0].follows to next state, because
2134 	  for (j = 0; j < follows.nelem; ++j)
2136 	      if (!(d->multibyte_prop[follows.elems[j].index] & 1))
2153 	  insert(d->states[0].elems.elems[j], &follows);
2158 	for (j = 0; j < follows.nelem; ++j)
2159 	  if (PREV_NEWLINE_DEPENDENT(follows.elems[j].constraint))
2167 	for (j = 0; j < follows.nelem; ++j)
2168 	  if (PREV_LETTER_DEPENDENT(follows.elems[j].constraint))
2171       /* Find the state(s) corresponding to the union of the follows. */
2172       state = state_index(d, &follows, 0, 0);
2174 	state_newline = state_index(d, &follows, 1, 0);
2178 	state_letter = state_index(d, &follows, 0, 1);
2200   free(follows.elems);
2623 	for (j = 0; j < d->follows[d->states[s].mbps.elems[i].index].nelem;
2625 	  insert(d->follows[d->states[s].mbps.elems[i].index].elems[j],
2646   position_set follows;
2684   follows.nelem = 0;
2685   MALLOC(follows.elems, position, d->nleaves);
2691   rs = transit_state_consume_1char(d, s, pp, match_lens, &mbclen, &follows);
2694   s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2699       follows.nelem = 0;
2700       rs = transit_state_consume_1char(d, s1, pp, NULL, &mbclen, &follows);
2706 		 j < d->follows[d->states[s1].mbps.elems[i].index].nelem; j++)
2707 	      insert(d->follows[d->states[s1].mbps.elems[i].index].elems[j],
2708 		     &follows);
2712       s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2716   free(follows.elems);
3021     if (d->follows[i].elems)
3022       free((ptr_t) d->follows[i].elems);
3023   free((ptr_t) d->follows);
OpenGrok
