HomeSort by relevance Sort by last modified time
    Searched refs:ruleno (Results 1 - 5 of 5) sorted by null

  /external/bison/src/
nullable.c 58 rule_number ruleno; local
77 for (ruleno = 0; ruleno < nrules; ++ruleno)
78 if (rules[ruleno].useful)
80 rule *rules_ruleno = &rules[ruleno];
95 rcount[ruleno]++;
106 == ruleno);
graphviz.c 100 conclude_red (struct obstack *out, int source, rule_number ruleno,
110 char const *color = enabled ? ruleno ? "3" : "1" : "5";
117 source, ruleno, ed);
133 source, ruleno, ed);
134 if (ruleno)
135 fprintf (fout, "R%d", ruleno);
178 rule_number ruleno = reds->rules[j]->number; local
206 conclude_red (&dout, source, ruleno, false, firstd, fout);
207 conclude_red (&eout, source, ruleno, true, firste && !defaulted, fout);
closure.c 203 rule_number ruleno;
220 BITSET_FOR_EACH (iter, ruleset, ruleno, 0)
222 item_number itemno = rules[ruleno].rhs - ritem;
200 rule_number ruleno; local
conflicts.c 254 | RULENO is the number of the lookahead bitset to consider. |
261 resolve_sr_conflict (state *s, int ruleno, symbol **errors, int *nerrs)
266 rule *redrule = reds->rules[ruleno];
268 bitset lookahead_tokens = reds->lookahead_tokens[ruleno];
  /external/libppp/src/
filter.c 248 int action, family, ruleno, val, width; local
250 ruleno = strtol(*argv, &wp, 0);
251 if (*argv == wp || ruleno >= MAXFILTERS) {
255 if (ruleno < 0) {
256 for (ruleno = 0; ruleno < MAXFILTERS; ruleno++) {
263 ofp += ruleno;
275 if (val <= ruleno) {
277 ruleno);
    [all...]

Completed in 238 milliseconds