mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
Rename "default rule" to "default reduction".
This includes changing variable names in code, changing comments, and renaming %define lr.default_rules to %define lr.default_reductions. * NEWS (2.5): Update IELR documentation. * data/glr.c, data/lalr1.cc, data/lalr1.java, data/yacc.c: Adjust YYDEFACT and yydefact_ documentation. * doc/bison.texinfo (Decl Summary): Adjust lr.default_reductions and lr.type documentation. Make some other wording improvements. (Glossary): Adjust cross-references and Default Reduction definition. * src/lalr.c (state_lookahead_tokens_count): Adjust code. Remove a confusing comment pointed out by Akim Demaille. (initialize_LA): Adjust code. * src/print-xml.c (print_reductions): Adjust code. * src/print.c (print_reductions): Adjust code. * src/reader.c (reader): Adjust code. * src/tables.c (action_row): Adjust code. (token_actions): Adjust code. * src/tables.h: Adjust YYDEFACT documentation. * tests/input.at (%define lr.default_rules invalid values): Rename test group to... (%define lr.default_reductions invalid values): ... this, and update grammar file and expected output. * tests/reduce.at (AT_TEST_LR_DEFAULT_RULES): Rename to... (AT_TEST_LR_DEFAULT_REDUCTIONS): ... this, and update.
This commit is contained in:
@@ -1442,33 +1442,33 @@ dnl PARSER-EXIT-VALUE, PARSER-STDOUT, PARSER-STDERR
|
||||
|
||||
|
||||
|
||||
## -------------------------- ##
|
||||
## %define lr.default_rules. ##
|
||||
## -------------------------- ##
|
||||
## ------------------------------- ##
|
||||
## %define lr.default_reductions. ##
|
||||
## ------------------------------- ##
|
||||
|
||||
# AT_TEST_LR_DEFAULT_RULES(GRAMMAR, INPUT, TABLES)
|
||||
# ------------------------------------------------
|
||||
m4_define([AT_TEST_LR_DEFAULT_RULES],
|
||||
# AT_TEST_LR_DEFAULT_REDUCTIONS(GRAMMAR, INPUT, TABLES)
|
||||
# -----------------------------------------------------
|
||||
m4_define([AT_TEST_LR_DEFAULT_REDUCTIONS],
|
||||
[
|
||||
AT_TEST_TABLES_AND_PARSE([[no %define lr.default_rules]],
|
||||
AT_TEST_TABLES_AND_PARSE([[no %define lr.default_reductions]],
|
||||
[[all]], [[]],
|
||||
[[]],
|
||||
[$1], [$2], [[]], [$3])
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_rules "all"]],
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_reductions "all"]],
|
||||
[[all]], [[]],
|
||||
[[%define lr.default_rules "all"]],
|
||||
[[%define lr.default_reductions "all"]],
|
||||
[$1], [$2], [[]], [$3])
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_rules "consistent"]],
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_reductions "consistent"]],
|
||||
[[consistent]], [[]],
|
||||
[[%define lr.default_rules "consistent"]],
|
||||
[[%define lr.default_reductions "consistent"]],
|
||||
[$1], [$2], [[]], [$3])
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_rules "accepting"]],
|
||||
AT_TEST_TABLES_AND_PARSE([[%define lr.default_reductions "accepting"]],
|
||||
[[accepting]], [[]],
|
||||
[[%define lr.default_rules "accepting"]],
|
||||
[[%define lr.default_reductions "accepting"]],
|
||||
[$1], [$2], [[]], [$3])
|
||||
])
|
||||
|
||||
AT_TEST_LR_DEFAULT_RULES([[
|
||||
AT_TEST_LR_DEFAULT_REDUCTIONS([[
|
||||
/* The start state is consistent and has a shift on 'a' and no reductions.
|
||||
After pushing the b below, enter an inconsistent state that has a shift and
|
||||
one reduction with one lookahead. */
|
||||
@@ -1484,7 +1484,7 @@ a: 'a' ;
|
||||
|
||||
/* After the previous reduction, enter an inconsistent state that has no shift
|
||||
and multiple reductions. The first reduction has more lookaheads than the
|
||||
second, so the first should always be preferred as the default rule if
|
||||
second, so the first should always be preferred as the default reduction if
|
||||
enabled. The second reduction has one lookahead. */
|
||||
b: ;
|
||||
c: ;
|
||||
|
||||
Reference in New Issue
Block a user