Searched defs:lookaheads (Results 1 - 2 of 2) sorted by relevance

/external/bison/src/
H A DAnnotationList.c238 bitset *lookaheads = NULL; local
335 if (!lookaheads)
338 lookaheads = xnmalloc ((*predecessor)->nitems,
339 sizeof *lookaheads);
341 lookaheads[j] = NULL;
343 if (!lookaheads[i])
344 lookaheads[i] = bitset_create (ntokens, BITSET_FIXED);
345 bitset_set (lookaheads[i], contribution_token);
359 in eventual successor states will not be affected by lookaheads
374 annotation_node, (*predecessor)->nitems, lookaheads, tru
672 AnnotationList__stateMakesContribution(AnnotationList const *self, size_t nitems, ContributionIndex ci, bitset *lookaheads) argument
693 AnnotationList__computeDominantContribution(AnnotationList const *self, size_t nitems, bitset *lookaheads, bool require_split_stable) argument
[all...]
H A Dielr.c558 * \c NULL iff all lookahead sets are empty. <tt>lookaheads[i] = NULL</tt>
561 bitset *lookaheads; member in struct:state_list
578 * in state \c s based on the lookaheads stored in <tt>s->lookaheads</tt>.
587 if (s->lookaheads)
592 if (s->lookaheads[item])
593 bitset_or (follow_set, follow_set, s->lookaheads[item]);
604 * - The number of rows in \c lookaheads is at least the number of items in
607 * - <tt>lookaheads[i][j]</tt> is set iff both:
615 bitsetv lookaheads)
613 ielr_compute_lookaheads(bitsetv follow_kernel_items, bitsetv always_follows, state_list *s, state *t, bitsetv lookahead_filter, bitsetv lookaheads) argument
699 ielr_compute_state(bitsetv follow_kernel_items, bitsetv always_follows, AnnotationList **annotation_lists, state *t, bitsetv lookaheads, state_list **last_statep, ContributionIndex work1[], bitsetv work2, state **tp) argument
967 bitsetv lookaheads; local
[all...]

Completed in 651 milliseconds