| /external/bison/src/ |
| state.c | 94 | Reductions. |
99 | Create a new array of NUM reductions. |
102 static reductions *
106 reductions *res = xmalloc (offsetof (reductions, rules) + rules_size);
144 res->reductions = NULL;
166 free (s->reductions);
185 | Set the reductions of S. |
191 assert (!s->reductions);
192 s->reductions = reductions_new (num, reds)
[all...] |
| state.h | 51 reductions (combine the last n things on the stack via a rule,
65 Each reductions structure describes the possible reductions at the
182 | Reductions. |
190 } reductions; typedef in typeref:struct:__anon1422
203 reductions *reductions; member in struct:state
229 /* Set the reductions of STATE. */
|
| print_graph.c | 95 reductions *reds = s->reductions;
128 reductions *reds = s->reductions;
|
| conflicts.c | 187 reductions *reds = s->reductions;
270 reductions *reds = s->reductions;
341 reductions *reds = s->reductions;
367 | conflicting reductions. |
374 reductions *reds = s->reductions;
437 | reductions for the same state and look-ahead as one
[all...] |
| lalr.c | 222 sp->next = lookback[(s->reductions->look_ahead_tokens - LA) + ri];
224 lookback[(s->reductions->look_ahead_tokens - LA) + ri] = sp;
345 reductions *rp = s->reductions;
349 reductions (i.e., there are two or more), or to distinguish a
380 /* Compute the total number of reductions requiring a look-ahead. */
391 /* Initialize the members LOOK_AHEAD_TOKENS for each state whose reductions
398 states[i]->reductions->look_ahead_tokens = pLA;
417 reductions *reds = states[i]->reductions;
[all...] |
| print.c | 217 reductions *reds = s->reductions;
266 reductions (in R/R conflicts, we keep the first reductions).
310 reductions *reds = s->reductions;
356 /* Report look-ahead tokens (or $default) and reductions. */
397 | Report on OUT all the actions (shifts, gotos, reductions, and |
|
| tables.c | 177 | reductions that are alternatives to the shift or reduction |
179 | reductions followed by a 0 in CONFLICT_LIST, updating |
188 reductions *reds = s->reductions;
198 /* Find all reductions for token J, and record all that do not
245 reductions *reds = s->reductions;
|
| LR0.c | 265 | current state and make a reductions structure for the state to |
292 /* Make a reductions structure and copy the data into it. */
312 the states have valid transitions and reductions members,
318 if (!s->reductions)
361 /* Record the reductions allowed out of this state. */
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Semaphore.java | 174 final void reducePermits(int reductions) {
177 int next = current - reductions;
|
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
