/external/bison/src/ |
conflicts.c | 242 flush_reduce (bitset lookahead_tokens, int token) 244 bitset_reset (lookahead_tokens, token); 268 bitset lookahead_tokens = reds->lookahead_tokens[ruleno]; 271 if (bitset_test (lookahead_tokens, i) 286 flush_reduce (lookahead_tokens, i); 301 flush_reduce (lookahead_tokens, i); 312 flush_reduce (lookahead_tokens, i); 349 && !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set)) 373 if (!bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set) 267 bitset lookahead_tokens = reds->lookahead_tokens[ruleno]; local [all...] |
lalr.c | 211 sp->next = lookback[(s->reductions->lookahead_tokens - LA) + ri]; 213 lookback[(s->reductions->lookahead_tokens - LA) + ri] = sp; 363 | Compute LA, NLA, and the lookahead_tokens members. | 392 /* Initialize the members LOOKAHEAD_TOKENS for each state whose reductions 401 states[i]->reductions->lookahead_tokens = pLA; 424 if (reds->lookahead_tokens) 426 if (reds->lookahead_tokens[k]) 432 if (reds->lookahead_tokens) 434 BITSET_FOR_EACH (iter, reds->lookahead_tokens[j], k, 0) 499 states[s]->reductions->lookahead_tokens = NULL [all...] |
state.c | 106 res->lookahead_tokens = NULL; 260 if (reds->lookahead_tokens && red != -1) 266 BITSET_FOR_EACH (biter, reds->lookahead_tokens[red], k, 0) 284 if (reds->lookahead_tokens && red != -1) 289 BITSET_FOR_EACH (biter, reds->lookahead_tokens[red], k, 0)
|
graphviz.c | 188 if (reds->lookahead_tokens) 192 if (bitset_test (reds->lookahead_tokens[j], i))
|
print_graph.c | 114 if (reds->lookahead_tokens && redno != -1) 120 BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0)
|
print-xml.c | 95 if (reds->lookahead_tokens && red != -1) 267 if (reds->lookahead_tokens) 273 if (bitset_test (reds->lookahead_tokens[j], i)) 297 if (reds->lookahead_tokens) 304 if (bitset_test (reds->lookahead_tokens[j], i))
|
print.c | 267 if (reds->lookahead_tokens) 273 if (bitset_test (reds->lookahead_tokens[j], i)) 296 if (reds->lookahead_tokens) 305 if (bitset_test (reds->lookahead_tokens[j], i))
|
state.h | 65 num rules. lookahead_tokens is an array of bitsets, one per rule. 185 bitset *lookahead_tokens; member in struct:__anon74
|
AnnotationList.c | 176 bitset_and (conflicted_tokens_rule, tokens, reds->lookahead_tokens[i]); 179 bitset_or (tokens, tokens, reds->lookahead_tokens[i]); 425 /* Return an empty list if s->lookahead_tokens = NULL. */ 449 if (bitset_test (s->reductions->lookahead_tokens[rule_i], 468 if (bitset_test (s->reductions->lookahead_tokens[rule_i], [all...] |
tables.c | 199 if (bitset_test (reds->lookahead_tokens[i], j) 253 if (reds->lookahead_tokens) 263 BITSET_FOR_EACH (biter, reds->lookahead_tokens[i], j, 0)
|
ielr.c | [all...] |