Lines Matching refs:follows
78 /* ISASCIIDIGIT differs from ISDIGIT, as follows:
1146 /* The grammar understood by the parser is as follows.
1582 for (j = 0; j < d->follows[old.index].nelem; ++j)
1584 p.index = d->follows[old.index].elems[j].index;
1691 CALLOC(d->follows, position_set, d->tindex);
1716 merge(&tmp, &d->follows[pos[j].index], &merged);
1717 REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1719 copy(&merged, &d->follows[pos[j].index]);
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]);
1800 MALLOC(d->follows[i].elems, position, nalloc[i]);
1836 fprintf(stderr, "follows(%d:", i);
1839 for (j = d->follows[i].nelem - 1; j >= 0; --j)
1841 fprintf(stderr, " %d:", d->follows[i].elems[j].index);
1842 prtok(d->tokens[d->follows[i].elems[j].index]);
1846 copy(&d->follows[i], &merged);
1848 if (d->follows[i].nelem < merged.nelem)
1849 REALLOC(d->follows[i].elems, position, merged.nelem);
1850 copy(&merged, &d->follows[i]);
1888 of the its elements' follows. This set is the set of positions of the
1926 position_set follows; /* Union of the follows of some group. */
2066 MALLOC(follows.elems, position, d->nleaves);
2083 copy(&d->states[0].elems, &follows);
2084 state = state_index(d, &follows, 0, 0);
2086 state_newline = state_index(d, &follows, 1, 0);
2090 state_letter = state_index(d, &follows, 0, 1);
2103 follows.nelem = 0;
2105 /* Find the union of the follows of the positions of the group.
2108 for (k = 0; k < d->follows[grps[i].elems[j].index].nelem; ++k)
2109 insert(d->follows[grps[i].elems[j].index].elems[k], &follows);
2114 /* If a token in follows.elems is not 1st byte of a multibyte
2115 character, or the states of follows must accept the bytes
2117 Then, if a state of follows encounter a byte, it must not be
2119 We cansel to add state[0].follows to next state, because
2133 for (j = 0; j < follows.nelem; ++j)
2135 if (!(d->multibyte_prop[follows.elems[j].index] & 1))
2152 insert(d->states[0].elems.elems[j], &follows);
2157 for (j = 0; j < follows.nelem; ++j)
2158 if (PREV_NEWLINE_DEPENDENT(follows.elems[j].constraint))
2166 for (j = 0; j < follows.nelem; ++j)
2167 if (PREV_LETTER_DEPENDENT(follows.elems[j].constraint))
2170 /* Find the state(s) corresponding to the union of the follows. */
2171 state = state_index(d, &follows, 0, 0);
2173 state_newline = state_index(d, &follows, 1, 0);
2177 state_letter = state_index(d, &follows, 0, 1);
2199 free(follows.elems);
2622 for (j = 0; j < d->follows[d->states[s].mbps.elems[i].index].nelem;
2624 insert(d->follows[d->states[s].mbps.elems[i].index].elems[j],
2645 position_set follows;
2683 follows.nelem = 0;
2684 MALLOC(follows.elems, position, d->nleaves);
2690 rs = transit_state_consume_1char(d, s, pp, match_lens, &mbclen, &follows);
2693 s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2698 follows.nelem = 0;
2699 rs = transit_state_consume_1char(d, s1, pp, NULL, &mbclen, &follows);
2705 j < d->follows[d->states[s1].mbps.elems[i].index].nelem; j++)
2706 insert(d->follows[d->states[s1].mbps.elems[i].index].elems[j],
2707 &follows);
2711 s1 = state_index(d, &follows, wc == L'\n', iswalnum(wc));
2715 free(follows.elems);
3020 if (d->follows[i].elems)
3021 free((ptr_t) d->follows[i].elems);
3022 free((ptr_t) d->follows);