Home
last modified time | relevance | path

Searched refs:lookahead_tokens (Results 1 – 12 of 12) sorted by relevance

/external/bison/src/
Dconflicts.c241 flush_reduce (bitset lookahead_tokens, int token) in flush_reduce() argument
243 bitset_reset (lookahead_tokens, token); in flush_reduce()
267 bitset lookahead_tokens = reds->lookahead_tokens[ruleno]; in resolve_sr_conflict() local
270 if (bitset_test (lookahead_tokens, i) in resolve_sr_conflict()
285 flush_reduce (lookahead_tokens, i); in resolve_sr_conflict()
300 flush_reduce (lookahead_tokens, i); in resolve_sr_conflict()
311 flush_reduce (lookahead_tokens, i); in resolve_sr_conflict()
348 && !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set)) in set_conflicts()
372 if (!bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set)) in set_conflicts()
374 bitset_or (lookahead_set, lookahead_set, reds->lookahead_tokens[i]); in set_conflicts()
[all …]
Dlalr.c211 sp->next = lookback[(s->reductions->lookahead_tokens - LA) + ri]; in add_lookback_edge()
213 lookback[(s->reductions->lookahead_tokens - LA) + ri] = sp; in add_lookback_edge()
401 states[i]->reductions->lookahead_tokens = pLA; in initialize_LA()
424 if (reds->lookahead_tokens) in lookahead_tokens_print()
426 if (reds->lookahead_tokens[k]) in lookahead_tokens_print()
432 if (reds->lookahead_tokens) in lookahead_tokens_print()
434 BITSET_FOR_EACH (iter, reds->lookahead_tokens[j], k, 0) in lookahead_tokens_print()
499 states[s]->reductions->lookahead_tokens = NULL; in lalr_free()
Dstate.c106 res->lookahead_tokens = NULL; in reductions_new()
260 if (reds->lookahead_tokens && red != -1) in state_rule_lookahead_tokens_print()
266 BITSET_FOR_EACH (biter, reds->lookahead_tokens[red], k, 0) in state_rule_lookahead_tokens_print()
284 if (reds->lookahead_tokens && red != -1) in state_rule_lookahead_tokens_print_xml()
289 BITSET_FOR_EACH (biter, reds->lookahead_tokens[red], k, 0) in state_rule_lookahead_tokens_print_xml()
Dprint-xml.c95 if (reds->lookahead_tokens && red != -1) in print_core()
267 if (reds->lookahead_tokens) in print_reductions()
273 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
297 if (reds->lookahead_tokens) in print_reductions()
304 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
Dprint.c266 if (reds->lookahead_tokens) in print_reductions()
272 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
295 if (reds->lookahead_tokens) in print_reductions()
304 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
Dprint_graph.c114 if (reds->lookahead_tokens && redno != -1) in print_core()
120 BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0) in print_core()
Dgraphviz.c188 if (reds->lookahead_tokens) in output_red()
192 if (bitset_test (reds->lookahead_tokens[j], i)) in output_red()
DAnnotationList.c176 bitset_and (conflicted_tokens_rule, tokens, reds->lookahead_tokens[i]); in AnnotationList__compute_conflicted_tokens()
179 bitset_or (tokens, tokens, reds->lookahead_tokens[i]); in AnnotationList__compute_conflicted_tokens()
449 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
468 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
Dtables.c199 if (bitset_test (reds->lookahead_tokens[i], j) in conflict_row()
253 if (reds->lookahead_tokens) in action_row()
263 BITSET_FOR_EACH (biter, reds->lookahead_tokens[i], j, 0) in action_row()
Dstate.h185 bitset *lookahead_tokens; member
Dielr.c1048 node->state->reductions->lookahead_tokens[r]; in ielr_split_states()
/external/bison/
DChangeLog-20128075 (flush_reduce): Rename argument look_ahead_tokens to lookahead_tokens.
8077 lookahead_tokens, and update other uses.
8110 (reductions.lookahead_tokens): Rename from look_ahead_tokens.