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

  /external/bison/src/
gram.c 35 item_number *ritem = NULL; variable
157 | Dump RITEM for traces. |
164 fputs ("RITEM\n", out);
166 if (ritem[i] >= 0)
167 fprintf (out, " %s", symbols[ritem[i]]->tag);
169 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)
    [all...]
closure.c 67 for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
216 if (ISVAR (ritem[core[c]]))
217 bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
223 item_number itemno = rules[ruleno].rhs - ritem;
reader.c 414 | RITEM. |
424 ritem = xnmalloc (nritems + 1, sizeof *ritem);
427 *ritem++ = 0;
437 rules[ruleno].rhs = ritem + itemno;
452 ritem[itemno++] = symbol_number_as_item_number (p->sym->number);
468 ritem[itemno++] = rule_number_as_item_number (ruleno);
gram.h 46 instance RITEM stores both symbol (the RHS) and rule numbers: the
54 RITEM, and RULES.
60 RULES[R].rhs -- the index in RITEM of the beginning of the portion
84 RITEM.
91 The portions of RITEM come in order of increasing rule number.
92 NRITEMS is the total length of RITEM. Each element of RITEM is
93 called an "item" and its index in RITEM is an item number.
118 extern item_number *ritem;
245 /* Dump RITEM for traces. *
    [all...]
LR0.c 188 if (ritem[itemset[i]] >= 0)
190 symbol_number sym = item_number_as_symbol_number (ritem[itemset[i]]);
278 item_number item = ritem[itemset[i]];
print_graph.c 71 sp1 = sp = ritem + sitems[i];
output.c 241 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems);
print.c 99 sp1 = sp = ritem + sitems[i];

Completed in 435 milliseconds