Lines Matching full:predecessor
230 state **predecessor;
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor)
252 Sbitset__new_on_obstack ((*predecessor)->nitems,
272 then check all of the predecessor's goto follows for the
284 *predecessor,
299 items, (*predecessor)->nitems);
304 predecessor item's lookahead set. */
307 /* We don't have to start the predecessor item search at
311 predecessor_item < (*predecessor)->nitems;
313 if ((*predecessor)->items[predecessor_item]
316 aver (predecessor_item != (*predecessor)->nitems);
317 if (ielr_item_has_lookahead (*predecessor, 0,
332 (*predecessor)->nitems, biter, i)
338 lookaheads = xnmalloc ((*predecessor)->nitems,
340 for (j = 0; j < (*predecessor)->nitems; ++j)
351 /* If the predecessor has any contributions besides just "always" and
354 not affect merging on this predecessor state or its eventual
355 predecessor states. Moreover, all contributions that affect
360 tracked for this predecessor state. (Also, as in the isocore
369 annotations needed on predecessor states. */
374 annotation_node, (*predecessor)->nitems, lookaheads, true))
381 for (i = 0; i < (*predecessor)->nitems; ++i)
389 &annotation_lists[(*predecessor)
391 (*predecessor)->nitems))
393 ++annotation_counts[(*predecessor)->number];
395 annotation_node, *predecessor,
518 resulting annotations needed on predecessor states. */
