HomeSort by relevance Sort by last modified time
    Searched refs:lookaheads (Results 1 - 4 of 4) sorted by null

  /external/bison/src/
ielr.c 558 * \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)
967 bitsetv lookaheads; local
    [all...]
AnnotationList.c 238 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, true)
    [all...]
AnnotationList.h 150 * - \c lookaheads describes the lookahead sets on the kernel items of some
152 * - <tt>lookaheads = NULL</tt> only if the lookahead set on every kernel
154 * - For any <tt>0 <= i < nitems</tt>, <tt>lookaheads[i]</tt> is either:
159 * - \c ContributionIndex__none iff the state described by \c lookaheads
171 * contributions due to loss of lookaheads due to splitting of the state.
179 size_t nitems, bitset *lookaheads,
  /external/chromium_org/third_party/ply/
yacc.py     [all...]

Completed in 696 milliseconds