Lines Matching defs:items
72 * that state has \c nitems kernel items.
198 Sbitset *items,
205 *items = Sbitset__new_on_obstack (s->nitems, annotations_obstackp);
212 Sbitset__set (*items, item);
270 aver (s->items[self_item] > 1);
274 if (item_number_is_rule_number (ritem[s->items[self_item]
277 Sbitset items;
279 for (rulei = s->items[self_item];
288 item_lookahead_sets, &items, annotations_obstackp))
299 items, (*predecessor)->nitems);
300 obstack_free (annotations_obstackp, items);
308 the beginning every time because items from both
313 if ((*predecessor)->items[predecessor_item]
314 == s->items[self_item] - 1)
481 ritem[s->items[item_i]])
483 ritem[s->items[item_i]])
491 /* Otherwise, add the kernel items whose lookahead sets
621 fprintf (stderr, ", items: ");
657 * - \c nitems is the number of kernel items in the LR(0) state that \c self
659 * - \c lookaheads describes the lookahead sets on the kernel items of some
