HomeSort by relevance Sort by last modified time
    Searched full:ritem (Results 1 - 16 of 16) 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...]
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...]
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...]
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]];
nullable.c 65 /* RITEM contains all the rules, including useless productions.
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...]
reader.c 499 | RITEM. |
509 ritem = xnmalloc (nritems + 1, sizeof *ritem);
512 *ritem++ = 0;
525 rules[ruleno].rhs = ritem + itemno;
562 ritem[itemno++] =
578 ritem[itemno++] = rule_number_as_item_number (ruleno);
state.h 45 in the RITEM vector of the items that are selected in this state.
221 ascendingly on item index in RITEM, which is sorted on rule number. */
print_graph.c 86 sp1 = sp = ritem + sitems[i];
lalr.c 257 sentinel (ritem[-1]=0) before the first rhs, so it is safe to
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/llvm/include/llvm/Support/
IntegersSubsetMapping.h 79 bool isIntersected(CaseItemIt& LItem, CaseItemIt& RItem) {
80 return LItem->first.getHigh() >= RItem->first.getLow();
83 bool isJoinable(CaseItemIt& LItem, CaseItemIt& RItem) {
84 if (LItem->second != RItem->second) {
85 assert(!isIntersected(LItem, RItem) &&
89 APInt RLow = RItem->first.getLow();
  /prebuilts/misc/linux-x86/bison/
bison 

Completed in 742 milliseconds