X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/1154ccedaf2f504455446e484932c5c9ffd2a18e..1b9c21fb18c6d82f9b7512bc0f2f9d980a32c398:/tests/conflicts.at?ds=sidebyside diff --git a/tests/conflicts.at b/tests/conflicts.at index 79562a93..1cbf23ac 100644 --- a/tests/conflicts.at +++ b/tests/conflicts.at @@ -1,5 +1,6 @@ # Exercising Bison on conflicts. -*- Autotest -*- -# Copyright (C) 2002 Free Software Foundation, Inc. + +# Copyright (C) 2002, 2003, 2004, 2005 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 @@ -13,8 +14,8 @@ # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software -# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA -# 02111-1307, USA. +# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA +# 02110-1301, USA. AT_BANNER([[Conflicts.]]) @@ -37,7 +38,9 @@ exp: e 'e'; e: 'e' | /* Nothing. */; ]]) -AT_CHECK([bison input.y -o input.c]) +AT_CHECK([bison -o input.c input.y], 0, [], +[[input.y:4.9: warning: rule never reduced because of conflicts: e: /* empty */ +]]) AT_CLEANUP @@ -48,24 +51,17 @@ AT_CLEANUP AT_SETUP([%nonassoc and eof]) -AT_DATA([input.y], +AT_DATA_GRAMMAR([input.y], [[ %{ -#include -/* We don't need a perfect malloc for these tests. */ -#undef malloc #include - -#if STDC_HEADERS -# include -#endif +#include #define YYERROR_VERBOSE 1 static void yyerror (const char *msg) { fprintf (stderr, "%s\n", msg); - exit (1); } /* The current argument. */ @@ -101,7 +97,7 @@ main (int argc, const char *argv[]) ]]) # Specify the output files to avoid problems on different file systems. -AT_CHECK([bison input.y -o input.c]) +AT_CHECK([bison -o input.c input.y]) AT_COMPILE([input]) AT_PARSER_CHECK([./input '0<0']) @@ -109,16 +105,16 @@ AT_PARSER_CHECK([./input '0<0']) # no one has ever spotted it! The messages are *wrong*: there should # be nothing there, it should be expected eof. AT_PARSER_CHECK([./input '0<0<0'], [1], [], - [parse error, unexpected '<', expecting '<' or '>' + [syntax error, unexpected '<', expecting '<' or '>' ]) AT_PARSER_CHECK([./input '0>0']) AT_PARSER_CHECK([./input '0>0>0'], [1], [], - [parse error, unexpected '>', expecting '<' or '>' + [syntax error, unexpected '>', expecting '<' or '>' ]) AT_PARSER_CHECK([./input '0<0>0'], [1], [], - [parse error, unexpected '>', expecting '<' or '>' + [syntax error, unexpected '>', expecting '<' or '>' ]) AT_CLEANUP @@ -139,18 +135,18 @@ AT_DATA([input.y], exp: exp OP exp | NUM; ]]) -AT_CHECK([bison input.y -o input.c --report=all], 0, [], -[input.y contains 1 shift/reduce conflict. +AT_CHECK([bison -o input.c --report=all input.y], 0, [], +[input.y: conflicts: 1 shift/reduce ]) # Check the contents of the report. AT_CHECK([cat input.output], [], -[[State 5 contains 1 shift/reduce conflict. +[[State 5 conflicts: 1 shift/reduce Grammar - 0 $axiom: exp $ + 0 $accept: exp $end 1 exp: exp OP exp 2 | NUM @@ -158,7 +154,7 @@ Grammar Terminals, with rules where they appear -$ (0) 0 +$end (0) 0 error (256) NUM (258) 2 OP (259) 1 @@ -166,7 +162,7 @@ OP (259) 1 Nonterminals, with rules where they appear -$axiom (5) +$accept (5) on left: 0 exp (6) on left: 1 2, on right: 0 1 @@ -174,7 +170,7 @@ exp (6) state 0 - 0 $axiom: . exp $ + 0 $accept: . exp $end 1 exp: . exp OP exp 2 | . NUM @@ -192,18 +188,18 @@ state 1 state 2 - 0 $axiom: exp . $ + 0 $accept: exp . $end 1 exp: exp . OP exp - $ shift, and go to state 3 - OP shift, and go to state 4 + $end shift, and go to state 3 + OP shift, and go to state 4 state 3 - 0 $axiom: exp $ . + 0 $accept: exp $end . - $default accept + $default accept state 4 @@ -219,8 +215,8 @@ state 4 state 5 - 1 exp: exp . OP exp [$, OP] - 1 | exp OP exp . [$, OP] + 1 exp: exp . OP exp [$end, OP] + 1 | exp OP exp . [$end, OP] OP shift, and go to state 4 @@ -247,13 +243,13 @@ AT_DATA([input.y], exp: exp OP exp | NUM; ]]) -AT_CHECK([bison input.y -o input.c --report=all]) +AT_CHECK([bison -o input.c --report=all input.y]) # Check the contents of the report. AT_CHECK([cat input.output], [], [[Grammar - 0 $axiom: exp $ + 0 $accept: exp $end 1 exp: exp OP exp 2 | NUM @@ -261,7 +257,7 @@ AT_CHECK([cat input.output], [], Terminals, with rules where they appear -$ (0) 0 +$end (0) 0 error (256) NUM (258) 2 OP (259) 1 @@ -269,7 +265,7 @@ OP (259) 1 Nonterminals, with rules where they appear -$axiom (5) +$accept (5) on left: 0 exp (6) on left: 1 2, on right: 0 1 @@ -277,7 +273,7 @@ exp (6) state 0 - 0 $axiom: . exp $ + 0 $accept: . exp $end 1 exp: . exp OP exp 2 | . NUM @@ -295,18 +291,18 @@ state 1 state 2 - 0 $axiom: exp . $ + 0 $accept: exp . $end 1 exp: exp . OP exp - $ shift, and go to state 3 - OP shift, and go to state 4 + $end shift, and go to state 3 + OP shift, and go to state 4 state 3 - 0 $axiom: exp $ . + 0 $accept: exp $end . - $default accept + $default accept state 4 @@ -322,11 +318,12 @@ state 4 state 5 - 1 exp: exp . OP exp [$, OP] - 1 | exp OP exp . [$, OP] + 1 exp: exp . OP exp [$end, OP] + 1 | exp OP exp . [$end, OP] $default reduce using rule 1 (exp) - Conflict between rule 2 and token OP resolved as shift (%left OP). + + Conflict between rule 1 and token OP resolved as reduce (%left OP). ]]) AT_CLEANUP @@ -339,19 +336,19 @@ AT_CLEANUP # When there are RR conflicts, some rules are disabled. Usually it is # simply displayed as: # -# $ reduce using rule 3 (num) -# $ [reduce using rule 4 (id)] +# $end reduce using rule 3 (num) +# $end [reduce using rule 4 (id)] # # But when `reduce 3' is the default action, we'd produce: # -# $ [reduce using rule 4 (id)] +# $end [reduce using rule 4 (id)] # $default reduce using rule 3 (num) # # In this precise case (a reduction is masked by the default # reduction), we make the `reduce 3' explicit: # -# $ reduce using rule 3 (num) -# $ [reduce using rule 4 (id)] +# $end reduce using rule 3 (num) +# $end [reduce using rule 4 (id)] # $default reduce using rule 3 (num) # # Maybe that's not the best display, but then, please propose something @@ -368,18 +365,24 @@ id : '0'; %% ]]) -AT_CHECK([bison input.y -o input.c --report=all], 1, [], -[input.y contains 1 reduce/reduce conflict. -]) +AT_CHECK([bison -o input.c --report=all input.y], 0, [], +[[input.y: conflicts: 1 reduce/reduce +input.y:4.6-8: warning: rule never reduced because of conflicts: id: '0' +]]) # Check the contents of the report. AT_CHECK([cat input.output], [], -[[State 1 contains 1 reduce/reduce conflict. +[[Rules never reduced + + 4 id: '0' + + +State 1 conflicts: 1 reduce/reduce Grammar - 0 $axiom: exp $ + 0 $accept: exp $end 1 exp: num 2 | id @@ -391,14 +394,14 @@ Grammar Terminals, with rules where they appear -$ (0) 0 +$end (0) 0 '0' (48) 3 4 error (256) Nonterminals, with rules where they appear -$axiom (4) +$accept (4) on left: 0 exp (5) on left: 1 2, on right: 0 @@ -410,7 +413,7 @@ id (7) state 0 - 0 $axiom: . exp $ + 0 $accept: . exp $end 1 exp: . num 2 | . id 3 num: . '0' @@ -425,19 +428,19 @@ state 0 state 1 - 3 num: '0' . [$] - 4 id: '0' . [$] + 3 num: '0' . [$end] + 4 id: '0' . [$end] - $ reduce using rule 3 (num) - $ [reduce using rule 4 (id)] + $end reduce using rule 3 (num) + $end [reduce using rule 4 (id)] $default reduce using rule 3 (num) state 2 - 0 $axiom: exp . $ + 0 $accept: exp . $end - $ shift, and go to state 5 + $end shift, and go to state 5 state 3 @@ -456,9 +459,9 @@ state 4 state 5 - 0 $axiom: exp $ . + 0 $accept: exp $end . - $default accept + $default accept ]]) AT_CLEANUP @@ -479,9 +482,9 @@ AT_DATA([input.y], exp: exp OP exp | NUM; ]]) -AT_CHECK([bison input.y -o input.c], 1, [], -[input.y contains 1 shift/reduce conflict. -expected 0 shift/reduce conflicts +AT_CHECK([bison -o input.c input.y], 1, [], +[input.y: conflicts: 1 shift/reduce +input.y: expected 0 shift/reduce conflicts ]) AT_CLEANUP @@ -499,7 +502,7 @@ AT_DATA([input.y], exp: exp OP exp | NUM; ]]) -AT_CHECK([bison input.y -o input.c]) +AT_CHECK([bison -o input.c input.y]) AT_CLEANUP @@ -516,8 +519,102 @@ AT_DATA([input.y], exp: exp OP exp | NUM; ]]) -AT_CHECK([bison input.y -o input.c], 1, [], -[input.y contains 1 shift/reduce conflict. -expected 2 shift/reduce conflicts +AT_CHECK([bison -o input.c input.y], 1, [], +[input.y: conflicts: 1 shift/reduce +input.y: expected 2 shift/reduce conflicts ]) AT_CLEANUP + + +## ------------------------------ ## +## %expect with reduce conflicts ## +## ------------------------------ ## + +AT_SETUP([%expect with reduce conflicts]) + +AT_DATA([input.y], +[[%expect 0 +%% +program: a 'a' | a a; +a: 'a'; +]]) + +AT_CHECK([bison -o input.c input.y], 1, [], +[input.y: conflicts: 1 reduce/reduce +input.y: expected 0 reduce/reduce conflicts +]) +AT_CLEANUP + + +## ------------------------------- ## +## %no-default-prec without %prec ## +## ------------------------------- ## + +AT_SETUP([%no-default-prec without %prec]) + +AT_DATA([[input.y]], +[[%left '+' +%left '*' + +%% + +%no-default-prec; + +e: e '+' e + | e '*' e + | '0' + ; +]]) + +AT_CHECK([bison -o input.c input.y], 0, [], +[[input.y: conflicts: 4 shift/reduce +]]) +AT_CLEANUP + + +## ---------------------------- ## +## %no-default-prec with %prec ## +## ---------------------------- ## + +AT_SETUP([%no-default-prec with %prec]) + +AT_DATA([[input.y]], +[[%left '+' +%left '*' + +%% + +%no-default-prec; + +e: e '+' e %prec '+' + | e '*' e %prec '*' + | '0' + ; +]]) + +AT_CHECK([bison -o input.c input.y]) +AT_CLEANUP + + +## ---------------- ## +## %default-prec ## +## ---------------- ## + +AT_SETUP([%default-prec]) + +AT_DATA([[input.y]], +[[%left '+' +%left '*' + +%% + +%default-prec; + +e: e '+' e + | e '*' e + | '0' + ; +]]) + +AT_CHECK([bison -o input.c input.y]) +AT_CLEANUP