Lines Matching refs:item
91 * item bitsets interpreted as binary numbers.
124 size_t item;
125 for (item = 0; cmp == 0 && item < nitems; ++item)
127 if (!Sbitset__test (self->contributions[ci], item))
129 if (Sbitset__test ((*node)->contributions[ci], item))
132 else if (!Sbitset__test ((*node)->contributions[ci], item))
208 bitset_bindex item;
209 BITSET_FOR_EACH (biter_item, follow_kernel_items[lhs_goto], item, 0)
210 if (ielr_item_has_lookahead (s, 0, item, conflicted_token,
212 Sbitset__set (*items, item);
261 /* If this kernel item is the beginning of a RHS, it must be
262 the kernel item in the start state, and so it has an empty
265 contribution. If, instead, this kernel item is the
266 successor of the start state's kernel item, the lookahead
271 /* If this kernel item is next to the beginning of the RHS,
303 /* If this kernel item is later in the RHS, then check the
304 predecessor item's lookahead set. */
307 /* We don't have to start the predecessor item search at
472 /* If this reduction is on a kernel item, just add it. */
643 Sbitset__Index item;
648 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
649 bitset_set (lookahead_filter[item], token);
662 * item is empty.
664 * - \c NULL only if the lookahead set on kernel item \c i is empty.
665 * - The (possibly empty) lookahead set on kernel item \c i.
683 Sbitset__Index item;
685 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
686 if (lookaheads[item] && bitset_test (lookaheads[item], token))
