X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/5bab9d08626390e7db164e57e1d402bf54da61f6..8b9e021fd1e3b03568d4b2167c47f33ba822a1c8:/tests/reduce.at diff --git a/tests/reduce.at b/tests/reduce.at index af13e16f..2a594539 100644 --- a/tests/reduce.at +++ b/tests/reduce.at @@ -1,6 +1,5 @@ # Exercising Bison Grammar Reduction. -*- Autotest -*- -# Copyright (C) 2001, 2002, 2007, 2008, 2009 Free Software Foundation, -# Inc. +# Copyright (C) 2001-2002, 2007-2010 Free Software Foundation, Inc. # This program is free software: you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by @@ -375,19 +374,19 @@ m4_define([AT_TEST_LR_TYPE], AT_TEST_TABLES_AND_PARSE([[no %define lr.type: ]$1], [[LALR]], [[]], [$2], m4_shiftn(2, $@)) -AT_TEST_TABLES_AND_PARSE([[%define lr.type "LALR": ]$1], +AT_TEST_TABLES_AND_PARSE([[%define lr.type lalr: ]$1], [[LALR]], [[]], - [[%define lr.type "LALR" + [[%define lr.type lalr ]$2], m4_shiftn(2, $@)) -AT_TEST_TABLES_AND_PARSE([[%define lr.type "IELR": ]$1], +AT_TEST_TABLES_AND_PARSE([[%define lr.type ielr: ]$1], [[IELR]], [[]], - [[%define lr.type "IELR" + [[%define lr.type ielr ]$2], m4_shiftn(2, $@)) -AT_TEST_TABLES_AND_PARSE([[%define lr.type "canonical LR": ]$1], +AT_TEST_TABLES_AND_PARSE([[%define lr.type canonical-lr: ]$1], [[canonical LR]], [[]], - [[%define lr.type "canonical LR" + [[%define lr.type canonical-lr ]$2], m4_shiftn(2, $@)) ]) @@ -396,7 +395,7 @@ AT_TEST_LR_TYPE([[Single State Split]], [[%left 'a' // Conflict resolution renders state 12 unreachable for canonical LR(1). We // keep it so that the paser table diff is easier to code. -%define lr.keep_unreachable_states]], +%define lr.keep-unreachable-states]], [[ S: 'a' A 'a' /* rule 1 */ | 'b' A 'b' /* rule 2 */ @@ -629,7 +628,7 @@ AT_TEST_LR_TYPE([[Lane Split]], [[%left 'a' // Conflict resolution renders state 16 unreachable for canonical LR(1). We // keep it so that the paser table diff is easier to code. -%define lr.keep_unreachable_states]], +%define lr.keep-unreachable-states]], [[ /* Similar to the last test case set but two states must be split. */ S: 'a' A 'a' /* rule 1 */ @@ -873,7 +872,7 @@ AT_TEST_LR_TYPE([[Complex Lane Split]], [[%left 'a' // Conflict resolution renders state 16 unreachable for canonical LR(1). We // keep it so that the paser table diff is easier to code. -%define lr.keep_unreachable_states]], +%define lr.keep-unreachable-states]], [[ /* Similar to the last test case set but forseeing the S/R conflict from the first state that must be split is becoming difficult. Imagine if B were @@ -1139,7 +1138,7 @@ dnl PARSER-EXIT-VALUE, PARSER-STDOUT, PARSER-STDERR ]])]) AT_TEST_LR_TYPE([[Split During Added Lookahead Propagation]], -[[%define lr.keep_unreachable_states]], +[[%define lr.keep-unreachable-states]], [[ /* The partial state chart diagram below is for LALR(1). State 0 is the start state. States are iterated for successor construction in numerical order. @@ -1454,17 +1453,17 @@ AT_TEST_TABLES_AND_PARSE([[no %define lr.default-reductions]], [[all]], [[]], [[]], [$1], [$2], [[]], [$3]) -AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions "all"]], +AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions all]], [[all]], [[]], - [[%define lr.default-reductions "all"]], + [[%define lr.default-reductions all]], [$1], [$2], [[]], [$3]) -AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions "consistent"]], +AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions consistent]], [[consistent]], [[]], - [[%define lr.default-reductions "consistent"]], + [[%define lr.default-reductions consistent]], [$1], [$2], [[]], [$3]) -AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions "accepting"]], +AT_TEST_TABLES_AND_PARSE([[%define lr.default-reductions accepting]], [[accepting]], [[]], - [[%define lr.default-reductions "accepting"]], + [[%define lr.default-reductions accepting]], [$1], [$2], [[]], [$3]) ])