X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/da730230ce159265f4380daa456e3e3c5f9422f4..bbaf618c3e9a5645c5d71bf2ea0de2bdeb8a4976:/tests/glr-regression.at diff --git a/tests/glr-regression.at b/tests/glr-regression.at index 2f719260..d1d0b878 100644 --- a/tests/glr-regression.at +++ b/tests/glr-regression.at @@ -1,5 +1,7 @@ # Checking GLR Parsing: Regression Tests -*- Autotest -*- -# Copyright (C) 2002, 2003, 2005, 2006, 2007 Free Software Foundation, Inc. + +# Copyright (C) 2002-2003, 2005-2007, 2009-2012 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 @@ -1687,8 +1689,8 @@ empty2: ; static void yyerror (YYLTYPE *locp, char const *msg) { - fprintf (stderr, "Error at %d.%d-%d.%d: %s.\n", locp->first_line, - locp->first_column, locp->last_line, locp->last_column, msg); + fprintf (stderr, "%d.%d-%d.%d: %s.\n", locp->first_line, + locp->first_column, locp->last_line, locp->last_column, msg); } static int @@ -1718,7 +1720,7 @@ AT_BISON_CHECK([[-o glr-regr17.c glr-regr17.y]], 0, [], AT_COMPILE([glr-regr17]) AT_PARSER_CHECK([[./glr-regr17]], 0, [], -[Error at 1.1-2.3: syntax is ambiguous. +[1.1-2.3: syntax is ambiguous. ]) AT_CLEANUP @@ -1779,10 +1781,127 @@ main (void) ]]) AT_BISON_CHECK([[-o glr-regr18.c glr-regr18.y]], 1, [], -[glr-regr18.y:26.18-24: result type clash on merge function `merge': != +[glr-regr18.y:26.18-24: result type clash on merge function 'merge': != glr-regr18.y:25.18-24: previous declaration -glr-regr18.y:27.13-19: result type clash on merge function `merge': != +glr-regr18.y:27.13-19: result type clash on merge function 'merge': != glr-regr18.y:26.18-24: previous declaration ]) AT_CLEANUP + + +## ------------------- ## +## Ambiguity reports. ## +## ------------------- ## + +AT_SETUP([Ambiguity reports]) + +AT_DATA_GRAMMAR([input.y], +[[ +%{ + #include + #include + static void yyerror (char const *); + static int yylex (void); +%} + +%debug +%glr-parser + +%% +start: + 'a' b 'c' d +| 'a' b 'c' d +; +b: 'b'; +d: /* nada. */; +%% + +static int +yylex (void) +{ + static char const input[] = "abc"; + static size_t toknum; + if (! (toknum < sizeof input)) + abort (); + return input[toknum++]; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + yydebug = 1; + return !!yyparse (); +} +]]) + +AT_BISON_CHECK([[-o input.c input.y]], 0, [], +[input.y: conflicts: 1 reduce/reduce +]) +AT_COMPILE([input]) + +AT_PARSER_CHECK([[./input]], 1, [], +[Starting parse +Entering state 0 +Reading a token: Next token is token 'a' () +Shifting token 'a' () +Entering state 1 +Reading a token: Next token is token 'b' () +Shifting token 'b' () +Entering state 3 +Reducing stack 0 by rule 3 (line 25): + $1 = token 'b' () +-> $$ = nterm b () +Entering state 4 +Reading a token: Next token is token 'c' () +Shifting token 'c' () +Entering state 6 +Reducing stack 0 by rule 4 (line 26): +-> $$ = nterm d () +Entering state 7 +Reading a token: Now at end of input. +Stack 0 Entering state 7 +Now at end of input. +Splitting off stack 1 from 0. +Reduced stack 1 by rule #2; action deferred. Now in state 2. +Stack 1 Entering state 2 +Now at end of input. +Reduced stack 0 by rule #1; action deferred. Now in state 2. +Merging stack 0 into stack 1. +Stack 1 Entering state 2 +Now at end of input. +Removing dead stacks. +Rename stack 1 -> 0. +On stack 0, shifting token $end () +Stack 0 now in state #5 +Ambiguity detected. +Option 1, + start -> + 'a' + b + 'c' + d + +Option 2, + start -> + 'a' + b + 'c' + d + +syntax is ambiguous +Cleanup: popping token $end () +Cleanup: popping unresolved nterm start () +Cleanup: popping nterm d () +Cleanup: popping token 'c' () +Cleanup: popping nterm b () +Cleanup: popping token 'a' () +]) + +AT_CLEANUP