| /external/bison/src/ |
| graphviz.h | 54 * \param reds the set of reductions
57 void output_red (state const *s, reductions const *reds, FILE *fout);
|
| state.c | 92 | Reductions. |
97 | Create a new array of NUM reductions. |
100 static reductions *
104 reductions *res = xmalloc (offsetof (reductions, rules) + rules_size);
142 res->reductions = NULL;
170 res->reductions = reductions_new (s->reductions->num, s->reductions->rules);
192 free (s->reductions);
[all...] |
| state.h | 49 reductions (combine the last n things on the stack via a rule,
63 Each reductions structure describes the possible reductions at the
179 | Reductions. |
188 } reductions; typedef in typeref:struct:__anon2790
203 reductions *reductions; member in struct:state
237 /* Set the reductions of STATE. */
|
| print_graph.c | 110 reductions *reds = s->reductions;
145 if (!trans->num && !s->reductions)
167 /* Display reductions. */
168 output_red (s, s->reductions, fgraph);
|
| conflicts.c | 264 reductions *reds = s->reductions;
333 reductions *reds = s->reductions;
433 reductions *reds = s->reductions;
459 | conflicting reductions. |
466 reductions *reds = s->reductions;
529 | reductions for the same state and lookahead as one
[all...] |
| lalr.c | 211 sp->next = lookback[(s->reductions->lookahead_tokens - LA) + ri];
213 lookback[(s->reductions->lookahead_tokens - LA) + ri] = sp;
332 reductions *rp = s->reductions;
342 /* We need a lookahead either to distinguish different reductions
345 `consistent'. However, do not treat a state with any reductions as
349 reductions. */
374 muscle_percent_define_get ("lr.default-reductions");
380 /* Compute the total number of reductions requiring a lookahead. */
392 /* Initialize the members LOOKAHEAD_TOKENS for each state whose reductions
[all...] |
| AnnotationList.c | 166 reductions *reds)
433 AnnotationList__compute_conflicted_tokens (shift_tokens, s->reductions);
441 bitset actions = bitset_create (s->reductions->num + 1, BITSET_FIXED);
448 for (rule_i = 0; rule_i < s->reductions->num; ++rule_i)
449 if (bitset_test (s->reductions->lookahead_tokens[rule_i],
465 for (rule_i = 0; rule_i < s->reductions->num; ++rule_i)
467 rule *the_rule = s->reductions->rules[rule_i];
468 if (bitset_test (s->reductions->lookahead_tokens[rule_i],
523 bitset_set (actions, s->reductions->num);
613 ->reductions->rules[rulei]->number)
[all...] |
| InadequacyList.c | 60 self->manifestingState->reductions->num))
|
| reader.c | 649 muscle_percent_define_default ("lr.default-reductions", "most");
651 muscle_percent_define_default ("lr.default-reductions", "accepting");
659 "lr.default-reductions", "most", "consistent", "accepting", NULL,
|
| print-xml.c | 92 reductions *reds = s->reductions;
243 reductions *reds = s->reductions;
250 xml_puts (out, level, "<reductions/>");
290 xml_puts (out, level, "<reductions/>");
294 xml_puts (out, level, "<reductions>");
296 /* Report lookahead tokens (or $default) and reductions. */
331 xml_puts (out, level, "</reductions>");
336 | Report on OUT all the actions (shifts, gotos, reductions, and
[all...] |
| graphviz.c | 114 don't want all the reductions bearing a same rule number to point to
156 output_red (state const *s, reductions const *reds, FILE *fout)
162 /* Two obstacks are needed: one for the enabled reductions, and one
163 for the disabled reductions, because in the end we want two
|
| tables.c | 175 | reductions that are alternatives to the shift or reduction |
177 | reductions followed by a 0 in CONFLICT_LIST, updating |
186 reductions *reds = s->reductions;
196 /* Find all reductions for token J, and record all that do not
243 reductions *reds = s->reductions;
306 /* Turn off default reductions where requested by the user. See
311 muscle_percent_define_get ("lr.default-reductions");
|
| print.c | 244 reductions *reds = s->reductions;
295 /* Report lookahead tokens (or $default) and reductions. */
338 muscle_percent_define_get ("lr.default-reductions");
350 | Report on OUT all the actions (shifts, gotos, reductions, and |
|
| LR0.c | 266 | current state and make a reductions structure for the state to |
293 /* Make a reductions structure and copy the data into it. */
313 the states have valid transitions and reductions members,
319 if (!s->reductions)
360 /* Record the reductions allowed out of this state. */
|
| ielr.c | [all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Semaphore.java | 169 final void reducePermits(int reductions) {
172 int next = current - reductions;
|
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
| compiler.jar | |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
| /external/bison/tests/ |
| testsuite | 682 90;output.at:449;Graph with reductions with multiple LAT;graph;
716 124;reduce.at:1550;no %define lr.default-reductions;;
717 125;reduce.at:1550;%define lr.default-reductions most;;
718 126;reduce.at:1550;%define lr.default-reductions consistent;;
719 127;reduce.at:1550;%define lr.default-reductions accepting;;
789 197;conflicts.at:1273;Solved conflicts report for multiple reductions in a state;;
790 198;conflicts.at:1353;%nonassoc error actions for multiple reductions in a state;;
[all...] |
