| /external/bison/src/ |
| D | state.c | 100 static reductions *
104 reductions *res = xmalloc (offsetof (reductions, rules) + rules_size); in reductions_new()
142 res->reductions = NULL; in state_new()
170 res->reductions = reductions_new (s->reductions->num, s->reductions->rules); in state_new_isocore()
192 free (s->reductions); in state_free()
217 aver (!s->reductions); in state_reductions_set()
218 s->reductions = reductions_new (num, reds); in state_reductions_set()
226 reductions *reds = s->reductions; in state_reduction_find()
256 reductions *reds = s->reductions; in state_rule_lookahead_tokens_print()
280 reductions *reds = s->reductions; in state_rule_lookahead_tokens_print_xml()
|
| D | conflicts.c | 263 reductions *reds = s->reductions; in resolve_sr_conflict()
332 reductions *reds = s->reductions; in set_conflicts()
432 reductions *reds = s->reductions; in count_sr_conflicts()
465 reductions *reds = s->reductions; in count_rr_conflicts()
|
| D | lalr.c | 211 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()
332 reductions *rp = s->reductions; in state_lookahead_tokens_count()
401 states[i]->reductions->lookahead_tokens = pLA; in initialize_LA()
420 reductions *reds = states[i]->reductions; in lookahead_tokens_print()
499 states[s]->reductions->lookahead_tokens = NULL; in lalr_free()
|
| D | AnnotationList.c | 166 reductions *reds) in AnnotationList__compute_conflicted_tokens()
433 AnnotationList__compute_conflicted_tokens (shift_tokens, s->reductions); in AnnotationList__compute_from_inadequacies()
441 bitset actions = bitset_create (s->reductions->num + 1, BITSET_FIXED); in AnnotationList__compute_from_inadequacies()
448 for (rule_i = 0; rule_i < s->reductions->num; ++rule_i) in AnnotationList__compute_from_inadequacies()
449 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
465 for (rule_i = 0; rule_i < s->reductions->num; ++rule_i) in AnnotationList__compute_from_inadequacies()
467 rule *the_rule = s->reductions->rules[rule_i]; in AnnotationList__compute_from_inadequacies()
468 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
523 bitset_set (actions, s->reductions->num); in AnnotationList__compute_from_inadequacies()
613 ->reductions->rules[rulei]->number); in AnnotationList__debug()
[all …]
|
| D | print_graph.c | 110 reductions *reds = s->reductions; in print_core()
145 if (!trans->num && !s->reductions) in print_actions()
168 output_red (s, s->reductions, fgraph); in print_actions()
|
| D | state.h | 188 } reductions; typedef
203 reductions *reductions; member
|
| D | print-xml.c | 92 reductions *reds = s->reductions; in print_core()
243 reductions *reds = s->reductions; in print_reductions()
|
| D | graphviz.h | 57 void output_red (state const *s, reductions const *reds, FILE *fout);
|
| D | tables.c | 186 reductions *reds = s->reductions; in conflict_row()
243 reductions *reds = s->reductions; in action_row()
|
| D | InadequacyList.c | 60 self->manifestingState->reductions->num)) in InadequacyList__getShiftContributionIndex()
|
| D | print.c | 243 reductions *reds = s->reductions; in print_reductions()
|
| D | graphviz.c | 156 output_red (state const *s, reductions const *reds, FILE *fout) in output_red()
|
| D | ielr.c | 1044 for (r = 0; r < node->state->reductions->num; ++r) in ielr_split_states()
1046 rule *this_rule = node->state->reductions->rules[r]; in ielr_split_states()
1048 node->state->reductions->lookahead_tokens[r]; in ielr_split_states()
|
| D | LR0.c | 317 if (!s->reductions) in set_states()
|
| /external/eigen/doc/ |
| D | TutorialReductionsVisitorsBroadcasting.dox | 5 This page explains Eigen's reductions, visitors and broadcasting and how they are used with
12 scalar value. One of the most used reductions is \link DenseBase::sum() .sum() \endlink,
59 \subsection TutorialReductionsVisitorsBroadcastingReductionsBool Boolean reductions
61 The following reductions operate on boolean values:
77 \subsection TutorialReductionsVisitorsBroadcastingReductionsUserdefined User defined reductions
106 \section TutorialReductionsVisitorsBroadcastingPartialReductions Partial reductions
107 Partial reductions are reductions that can operate column- or row-wise on a Matrix or
109 returning a column or row vector with the corresponding values. Partial reductions are applied
137 …uctionsVisitorsBroadcastingPartialReductionsCombined Combining partial reductions with other opera…
140 within a matrix. With column-wise partial reductions this can be coded as:
[all …]
|
| /external/bison/tests/ |
| D | conflicts.at | 26 # I once hacked Bison in such a way that it lost its reductions on the
125 # We must disable default reductions in inconsistent states in order to
127 AT_NONASSOC_AND_EOF_CHECK([[-Dlr.default-reductions=consistent]],
130 # lr.default-reductions=consistent happens to work for this test case.
321 %define lr.default-reductions consistent]],
326 %define lr.default-reductions accepting]],
411 AT_CONSISTENT_ERRORS_CHECK([[%define lr.default-reductions consistent]],
417 AT_CONSISTENT_ERRORS_CHECK([[%define lr.default-reductions accepting]],
431 %define lr.default-reductions accepting]],
1270 ## Solved conflicts report for multiple reductions in a state. ##
[all …]
|
| D | reduce.at | 1525 ## %define lr.default-reductions. ##
1532 AT_TEST_TABLES_AND_PARSE([[no %define lr.default-reductions]],
1536 AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions most]],
1538 [[%define lr.default-reductions most]],
1540 AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions consistent]],
1542 [[%define lr.default-reductions consistent]],
1544 AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions accepting]],
1546 [[%define lr.default-reductions accepting]],
1551 /* The start state is consistent and has a shift on 'a' and no reductions.
1565 and multiple reductions. The first reduction has more lookaheads than the
|
| D | regression.at | 540 # miss some reductions. In the following test case, the reduction on
1448 // default reductions in inconsistent states
1490 # Check number of default reductions in inconsistent states to be sure
1491 # syntax error is detected before unnecessary reductions are performed.
1495 # Check number of default reductions in consistent states to be sure
|
| D | output.at | 446 ## Graph with reductions with multiple LAT. ##
449 AT_TEST([Graph with reductions with multiple LAT],
|
| /external/llvm/test/MC/Disassembler/Hexagon/ |
| D | cr.txt | 10 # Logical reductions on predicates
|
| /external/bison/ |
| D | TODO | 153 what when two reductions are possible on a given lookahead token, but one is
154 part of $default. Should we make the two reductions explicit, or just
256 Show reductions.
|
| D | NEWS | 102 The reductions are now explicitly represented as transitions to other
531 adjusted using "%define lr.default-reductions". For details on both
542 additional parser stack reductions before discovering the syntax
543 error. Such reductions can perform user semantic actions that are
553 reductions in inconsistent states, and parser state merging. Thus,
555 %nonassoc is used or if default reductions are enabled for
560 %nonassoc, default reductions, or state merging. When LAC is in
708 reductions when the output language defaulted to C (specifically, when
751 (from LALR or IELR) and default reductions, which can both add
754 default reductions. However, there is one minor problem left even
[all …]
|
| /external/llvm/test/CodeGen/Hexagon/intrinsics/ |
| D | cr.ll | 22 ; Logical reductions on predicates
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | reduction.ll | 327 ; We can vectorize conditional reductions with multi-input phis.
373 ; We can't vectorize reductions with phi inputs from outside the reduction.
418 ; We can't vectorize reductions that feed another header PHI.
|
| /external/bison/doc/ |
| D | bison.texi | 290 * Default Reductions:: Disable default reductions.
743 reductions (applications of a grammar rule) applies, or whether to apply
4845 the parser reports its actions, such as reductions. When a symbol involved
5543 @c ================================================== lr.default-reductions
5545 @item @code{lr.default-reductions}
5546 @findex %define lr.default-reductions
5552 contain default reductions. @xref{Default Reductions}. (The ability to
5553 specify where default reductions should be used is experimental. More user
6668 The parser tries, by shifts and reductions, to reduce the entire input down
6699 perform one or more reductions of tokens and groupings on the stack, while
[all …]
|