| /external/bison/src/ |
| conflicts.c | 187 reductions *reds = s->reductions;
189 rule *redrule = reds->rules[ruleno];
191 bitset look_ahead_tokens = reds->look_ahead_tokens[ruleno];
270 reductions *reds = s->reductions;
283 for (i = 0; i < reds->num; ++i)
284 if (reds->rules[i]->prec && reds->rules[i]->prec->prec
285 && !bitset_disjoint_p (reds->look_ahead_tokens[i], look_ahead_set))
290 for (i = 0; i < reds->num; ++i)
292 if (!bitset_disjoint_p (reds->look_ahead_tokens[i], look_ahead_set)
186 reductions *reds = s->reductions; local
269 reductions *reds = s->reductions; local
340 reductions *reds = s->reductions; local
373 reductions *reds = s->reductions; local
[all...] |
| state.c | 103 reductions_new (int num, rule **reds)
105 size_t rules_size = num * sizeof *reds;
109 memcpy (res->rules, reds, rules_size);
189 state_reductions_set (state *s, int num, rule **reds)
192 s->reductions = reductions_new (num, reds);
200 reductions *reds = s->reductions; local
201 for (i = 0; i < reds->num; ++i)
202 if (reds->rules[i] == r)
230 reductions *reds = s->reductions; local
234 if (reds->look_ahead_tokens && red != -1
[all...] |
| print.c | 217 reductions *reds = s->reductions;
224 return reds->rules[0];
250 for (i = 0; i < reds->num; ++i)
256 bitset_andn (look_ahead_set, reds->look_ahead_tokens[i], shift_set);
262 default_rule = reds->rules[i];
268 bitset_or (shift_set, shift_set, reds->look_ahead_tokens[i]);
310 reductions *reds = s->reductions;
315 if (reds->num == 0)
328 if (reds->look_ahead_tokens)
333 for (j = 0; j < reds->num; ++j
216 reductions *reds = s->reductions; local
309 reductions *reds = s->reductions; local
[all...] |
| print_graph.c | 95 reductions *reds = s->reductions; local
99 if (reds->look_ahead_tokens && redno != -1)
105 BITSET_FOR_EACH (biter, reds->look_ahead_tokens[redno], k, 0)
128 reductions *reds = s->reductions; local
133 if (!trans->num && !reds)
|
| lalr.c | 417 reductions *reds = states[i]->reductions; local
421 if (reds->look_ahead_tokens)
422 for (k = 0; k < reds->num; ++k)
423 if (reds->look_ahead_tokens[k])
429 if (reds->look_ahead_tokens)
430 for (j = 0; j < reds->num; ++j)
431 BITSET_FOR_EACH (iter, reds->look_ahead_tokens[j], k, 0)
435 reds->rules[j]->number);
|
| tables.c | 188 reductions *reds = s->reductions; local
200 for (i = 0; i < reds->num; i += 1)
201 if (bitset_test (reds->look_ahead_tokens[i], j)
203 != rule_number_as_item_number (reds->rules[i]->number)))
206 conflict_list[conflict_list_cnt] = reds->rules[i]->number + 1;
245 reductions *reds = s->reductions; local
255 if (reds->look_ahead_tokens)
262 for (i = reds->num - 1; i >= 0; --i)
265 BITSET_FOR_EACH (biter, reds->look_ahead_tokens[i], j, 0)
274 actrow[j] = rule_number_as_item_number (reds->rules[i]->number)
[all...] |
| state.h | 230 void state_reductions_set (state *s, int num, rule **reds);
|
| /external/qemu/distrib/sdl-1.2.12/src/hermes/ |
| x86p_16.asm | 438 mov eax,ebx ; setup eax for reds
441 and eax,11100000111000001110000011100000b ; reds
|
| /prebuilt/common/jfreechart/ |
| jfreechart-1.0.9-swt.jar | |
| /external/blktrace/btt/doc/ |
| btt.tex | 589 out. And then one can make the broad generalization of higher reds,
[all...] |
