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

  /external/bison/src/
gram.c 34 item_number *ritem = NULL; variable
147 fputs ("RITEM\n", out);
149 if (ritem[i] >= 0)
150 fprintf (out, " %s", symbols[ritem[i]]->tag);
152 fprintf (out, " (rule %d)\n", item_number_as_rule_number (ritem[i]));
266 fprintf (out, "Num (Prec, Assoc, Useful, Ritem Range) Lhs -> Rhs (Ritem range) [Num]\n");
271 unsigned int rhs_itemno = rule_i->rhs - ritem;
328 if (ritem)
329 free (ritem - 1)
    [all...]
closure.c 64 for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
213 if (ISVAR (ritem[core[c]]))
214 bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
216 /* core is sorted on item index in ritem, which is sorted on rule number.
222 item_number itemno = rules[ruleno].rhs - ritem;
ielr.c 44 * is set iff <tt>ritem[i]</tt> is a nonterminal after which all ritems in
46 * a goto on <tt>ritem[i]</tt> include the lookahead set of the item.
56 while (!item_number_is_rule_number (ritem[i])
57 && ISVAR (ritem[i])
58 && nullable [item_number_as_symbol_number (ritem[i]) - ntokens])
60 if (!item_number_is_rule_number (ritem[i]) && ISVAR (ritem[i]))
62 while (!item_number_is_rule_number (ritem[i]) && i>0)
136 (*rulep)->rhs - ritem))
218 if (item_number_is_symbol_number (ritem[items[j]]
    [all...]
gram.h 44 instance RITEM stores both symbol (the RHS) and rule numbers: the
52 RITEM, and RULES.
58 RULES[R].rhs -- the index in RITEM of the beginning of the portion
82 RITEM.
89 The portions of RITEM come in order of increasing rule number.
90 NRITEMS is the total length of RITEM. Each element of RITEM is
91 called an "item" and its index in RITEM is an item number.
117 extern item_number *ritem;
248 /* Dump RITEM for traces. *
    [all...]
LR0.c 171 | itemset is sorted on item index in ritem, which is sorted on |
189 if (item_number_is_symbol_number (ritem[itemset[i]]))
191 symbol_number sym = item_number_as_symbol_number (ritem[itemset[i]]);
279 item_number item = ritem[itemset[i]];
AnnotationList.c 274 if (item_number_is_rule_number (ritem[s->items[self_item]
280 !item_number_is_rule_number (ritem[rulei]);
285 &rules[item_number_as_rule_number (ritem[rulei])],
309 states are sorted by their indices in ritem. */
481 ritem[s->items[item_i]])
483 ritem[s->items[item_i]])
    [all...]
print_graph.c 86 sp1 = sp = ritem + sitems[i];
output.c 253 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems);
print-xml.c 81 sp1 = sp = ritem + sitems[i];
print.c 97 sp1 = sp = ritem + sitems[i];
  /external/chromium_org/third_party/ply/
lex.py 150 for key, ritem in self.lexstatere.items():
152 for cre, findex in ritem:
    [all...]

Completed in 520 milliseconds