X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/3be03b13e5fd9cc9ed119f26e429e6ab1dd3568d..02803d55cd78f1fe9516f20efd3f094e35577ddf:/tests/actions.at?ds=inline diff --git a/tests/actions.at b/tests/actions.at index d0cb12f9..24c6ac8a 100644 --- a/tests/actions.at +++ b/tests/actions.at @@ -1,20 +1,19 @@ # Executing Actions. -*- Autotest -*- -# Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 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 -# the Free Software Foundation; either version 2, or (at your option) -# any later version. +# Copyright (C) 2001-2011 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 +# the Free Software Foundation, either version 3 of the License, or +# (at your option) any later version. +# # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. - +# # 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., 51 Franklin Street, Fifth Floor, Boston, MA -# 02110-1301, USA. +# along with this program. If not, see . AT_BANNER([[User Actions.]]) @@ -30,7 +29,7 @@ AT_SETUP([Mid-rule actions]) # action. AT_DATA_GRAMMAR([[input.y]], -[[%error-verbose +[[%define parse.error verbose %debug %{ # include @@ -55,8 +54,11 @@ exp: { putchar ('0'); } static int yylex (void) { - static const char *input = "123456789"; - return *input++; + static char const input[] = "123456789"; + static size_t toknum; + if (! (toknum < sizeof input)) + abort (); + return input[toknum++]; } static void @@ -72,7 +74,7 @@ main (void) } ]]) -AT_CHECK([bison -d -v -o input.c input.y]) +AT_BISON_CHECK([-d -v -o input.c input.y]) AT_COMPILE([input]) AT_PARSER_CHECK([./input], 0, [[0123456789 @@ -91,7 +93,7 @@ AT_CLEANUP AT_SETUP([Exotic Dollars]) AT_DATA_GRAMMAR([[input.y]], -[[%error-verbose +[[%define parse.error verbose %debug %{ # include @@ -131,6 +133,9 @@ sum_of_the_five_previous_values: static int yylex (void) { + static int called; + if (called++) + abort (); return EOF; } @@ -147,12 +152,58 @@ main (void) } ]]) -AT_CHECK([bison -d -v -o input.c input.y], 0) +AT_BISON_CHECK([-d -v -o input.c input.y], 0) AT_COMPILE([input]) AT_PARSER_CHECK([./input], 0, [[15 ]]) +# Make sure that fields after $n or $-n are parsed correctly. At one +# point while implementing dashes in symbol names, we were dropping +# fields after $-n. +AT_DATA_GRAMMAR([[input.y]], +[[ +%{ +# include + static int yylex (void); + static void yyerror (char const *msg); + typedef struct { int val; } stype; +# define YYSTYPE stype +%} + +%% +start: one two { $$.val = $1.val + $2.val; } sum ; +one: { $$.val = 1; } ; +two: { $$.val = 2; } ; +sum: { printf ("%d\n", $0.val + $-1.val + $-2.val); } ; + +%% + +static int +yylex (void) +{ + return 0; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse (); +} +]]) + +AT_BISON_CHECK([[-o input.c input.y]]) +AT_COMPILE([[input]]) +AT_PARSER_CHECK([[./input]], [[0]], +[[6 +]]) + AT_CLEANUP @@ -172,9 +223,10 @@ m4_if([$1$2$3], $[1]$[2]$[3], [], # helping macros. So don't put any directly in the Bison file. AT_BISON_OPTION_PUSHDEFS([$5]) AT_DATA_GRAMMAR([[input.y]], -[[%start-header { +[[%code requires { #include #include +#include #include #define YYINITDEPTH 10 @@ -189,10 +241,9 @@ m4_ifval([$6], [%union { int ival; }]) -AT_LALR1_CC_IF([%define "global_tokens_and_yystype"]) -m4_ifval([$6], [[%end-header {]], [[%start-header {]]) -AT_LALR1_CC_IF([typedef yy::location YYLTYPE; - m4_ifval([$6], , [#define YYSTYPE int])]) +AT_LALR1_CC_IF([%define global_tokens_and_yystype]) +m4_ifval([$6], [[%code provides {]], [[%code {]]) +AT_LALR1_CC_IF([typedef yy::location YYLTYPE;]) [static int yylex (]AT_LEX_FORMALS[); ]AT_LALR1_CC_IF([], [static void yyerror (const char *msg);]) [} @@ -311,6 +362,8 @@ yylex (]AT_LEX_FORMALS[) AT_LOC.last_line = AT_LOC.last_column = AT_LOC.first_line + 9; ])[ + if (! (0 <= c && c <= strlen (source))) + abort (); if (source[c]) printf ("sending: '%c'", source[c]); else @@ -360,11 +413,7 @@ main (int argc, const char *argv[]) } ]]) -AT_LALR1_CC_IF( - [AT_CHECK([bison -o input.cc input.y]) - AT_COMPILE_CXX([input])], - [AT_CHECK([bison -o input.c input.y]) - AT_COMPILE([input])]) +AT_FULL_COMPILE([input]) # Check the location of "empty" @@ -554,7 +603,7 @@ m4_define([AT_CHECK_PRINTER_AND_DESTRUCTOR], $3 _AT_CHECK_PRINTER_AND_DESTRUCTOR($[1], $[2], $[3], $[4], -[%error-verbose +[%define parse.error verbose %debug %verbose %locations @@ -567,9 +616,6 @@ AT_CLEANUP AT_CHECK_PRINTER_AND_DESTRUCTOR([]) AT_CHECK_PRINTER_AND_DESTRUCTOR([], [with union]) -# These tests currently fail on a Debian GNU/Linux 3.0r2 x86 host, -# but the 2nd test succeeds on a Solaris 9 sparc hosts (Forte 7 cc). -# Skip them until we figure out what the problem is. AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"]) AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"], [with union]) @@ -578,17 +624,17 @@ AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser], [with union]) -## --------------------------------- ## -## Default %printer and %destructor. ## -## --------------------------------- ## +## ----------------------------------------- ## +## Default tagless %printer and %destructor. ## +## ----------------------------------------- ## # Check that the right %printer and %destructor are called, that they're not # called for $end, and that $$ and @$ work correctly. -AT_SETUP([Default %printer and %destructor]) +AT_SETUP([Default tagless %printer and %destructor]) AT_DATA_GRAMMAR([[input.y]], -[[%error-verbose +[[%define parse.error verbose %debug %locations %initial-action { @@ -605,11 +651,15 @@ AT_DATA_GRAMMAR([[input.y]], %} %printer { - fprintf (yyoutput, "Default printer for '%c' @ %d", $$, @$.first_column); -} %symbol-default + fprintf (yyoutput, "<*> printer should not be called.\n"); +} <*> + +%printer { + fprintf (yyoutput, "<> printer for '%c' @ %d", $$, @$.first_column); +} <> %destructor { - fprintf (stdout, "Default destructor for '%c' @ %d.\n", $$, @$.first_column); -} %symbol-default + fprintf (stdout, "<> destructor for '%c' @ %d.\n", $$, @$.first_column); +} <> %printer { fprintf (yyoutput, "'b'/'c' printer for '%c' @ %d", $$, @$.first_column); @@ -618,6 +668,10 @@ AT_DATA_GRAMMAR([[input.y]], fprintf (stdout, "'b'/'c' destructor for '%c' @ %d.\n", $$, @$.first_column); } 'b' 'c' +%destructor { + fprintf (yyoutput, "<*> destructor should not be called.\n"); +} <*> + %% start: 'a' 'b' 'c' 'd' 'e' { $$ = 'S'; USE(($1, $2, $3, $4, $5)); } ; @@ -627,11 +681,13 @@ start: 'a' 'b' 'c' 'd' 'e' { $$ = 'S'; USE(($1, $2, $3, $4, $5)); } ; static int yylex (void) { - static const char *input = "abcd"; - static int column = 1; - yylval = *input++; + static char const input[] = "abcd"; + static size_t toknum; + if (! (toknum < sizeof input)) + abort (); + yylval = input[toknum++]; yylloc.first_line = yylloc.last_line = 1; - yylloc.first_column = yylloc.last_column = column++; + yylloc.first_column = yylloc.last_column = toknum; return yylval; } @@ -649,18 +705,18 @@ main (void) } ]]) -AT_CHECK([bison -o input.c input.y]) +AT_BISON_CHECK([-o input.c input.y]) AT_COMPILE([input]) AT_PARSER_CHECK([./input], 1, -[[Default destructor for 'd' @ 4. +[[<> destructor for 'd' @ 4. 'b'/'c' destructor for 'c' @ 3. 'b'/'c' destructor for 'b' @ 2. -Default destructor for 'a' @ 1. +<> destructor for 'a' @ 1. ]], [[Starting parse Entering state 0 -Reading a token: Next token is token 'a' (1.1-1.1: Default printer for 'a' @ 1) -Shifting token 'a' (1.1-1.1: Default printer for 'a' @ 1) +Reading a token: Next token is token 'a' (1.1-1.1: <> printer for 'a' @ 1) +Shifting token 'a' (1.1-1.1: <> printer for 'a' @ 1) Entering state 1 Reading a token: Next token is token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2) Shifting token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2) @@ -668,18 +724,18 @@ Entering state 3 Reading a token: Next token is token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3) Shifting token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3) Entering state 5 -Reading a token: Next token is token 'd' (1.4-1.4: Default printer for 'd' @ 4) -Shifting token 'd' (1.4-1.4: Default printer for 'd' @ 4) +Reading a token: Next token is token 'd' (1.4-1.4: <> printer for 'd' @ 4) +Shifting token 'd' (1.4-1.4: <> printer for 'd' @ 4) Entering state 6 Reading a token: Now at end of input. syntax error, unexpected $end, expecting 'e' -Error: popping token 'd' (1.4-1.4: Default printer for 'd' @ 4) +Error: popping token 'd' (1.4-1.4: <> printer for 'd' @ 4) Stack now 0 1 3 5 Error: popping token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3) Stack now 0 1 3 Error: popping token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2) Stack now 0 1 -Error: popping token 'a' (1.1-1.1: Default printer for 'a' @ 1) +Error: popping token 'a' (1.1-1.1: <> printer for 'a' @ 1) Stack now 0 Cleanup: discarding lookahead token $end (1.5-1.5: ) Stack now 0 @@ -689,14 +745,158 @@ AT_CLEANUP +## ------------------------------------------------------ ## +## Default tagged and per-type %printer and %destructor. ## +## ------------------------------------------------------ ## + +AT_SETUP([Default tagged and per-type %printer and %destructor]) + +AT_DATA_GRAMMAR([[input.y]], +[[%define parse.error verbose +%debug + +%{ +# include +# include + static void yyerror (const char *msg); + static int yylex (void); +# define USE(SYM) +%} + +%printer { + fprintf (yyoutput, "<> printer should not be called.\n"); +} <> + +%union { int field0; int field1; int field2; } +%type start 'a' 'g' +%type 'e' +%type 'f' +%printer { + fprintf (yyoutput, "<*>//e printer"); +} <*> 'e' +%destructor { + fprintf (stdout, "<*>//e destructor.\n"); +} <*> 'e' + +%type 'b' +%printer { fprintf (yyoutput, " printer"); } +%destructor { fprintf (stdout, " destructor.\n"); } + +%type 'c' +%printer { fprintf (yyoutput, "'c' printer"); } 'c' +%destructor { fprintf (stdout, "'c' destructor.\n"); } 'c' + +%type 'd' +%printer { fprintf (yyoutput, "'d' printer"); } 'd' +%destructor { fprintf (stdout, "'d' destructor.\n"); } 'd' + +%destructor { + fprintf (yyoutput, "<> destructor should not be called.\n"); +} <> + +%% + +start: + 'a' 'b' 'c' 'd' 'e' 'f' 'g' + { + USE(($1, $2, $3, $4, $5, $6, $7)); + $$ = 'S'; + } + ; + +%% + +static int +yylex (void) +{ + static char const input[] = "abcdef"; + static size_t toknum; + if (! (toknum < sizeof input)) + abort (); + return input[toknum++]; +} + +static void +yyerror (const char *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + yydebug = 1; + return yyparse (); +} +]]) + +AT_BISON_CHECK([-o input.c input.y]) +AT_COMPILE([input]) +AT_PARSER_CHECK([./input], 1, +[[<*>//e destructor. +<*>//e destructor. +'d' destructor. +'c' destructor. + destructor. +<*>//e destructor. +]], +[[Starting parse +Entering state 0 +Reading a token: Next token is token 'a' (<*>//e printer) +Shifting token 'a' (<*>//e printer) +Entering state 1 +Reading a token: Next token is token 'b' ( printer) +Shifting token 'b' ( printer) +Entering state 3 +Reading a token: Next token is token 'c' ('c' printer) +Shifting token 'c' ('c' printer) +Entering state 5 +Reading a token: Next token is token 'd' ('d' printer) +Shifting token 'd' ('d' printer) +Entering state 6 +Reading a token: Next token is token 'e' (<*>//e printer) +Shifting token 'e' (<*>//e printer) +Entering state 7 +Reading a token: Next token is token 'f' (<*>//e printer) +Shifting token 'f' (<*>//e printer) +Entering state 8 +Reading a token: Now at end of input. +syntax error, unexpected $end, expecting 'g' +Error: popping token 'f' (<*>//e printer) +Stack now 0 1 3 5 6 7 +Error: popping token 'e' (<*>//e printer) +Stack now 0 1 3 5 6 +Error: popping token 'd' ('d' printer) +Stack now 0 1 3 5 +Error: popping token 'c' ('c' printer) +Stack now 0 1 3 +Error: popping token 'b' ( printer) +Stack now 0 1 +Error: popping token 'a' (<*>//e printer) +Stack now 0 +Cleanup: discarding lookahead token $end () +Stack now 0 +]]) + +AT_CLEANUP + + + ## ------------------------------------------------------------- ## -## Default %printer and %destructor for user-defined end token. ## +## Default %printer and %destructor for user-defined end token. ## ## ------------------------------------------------------------- ## AT_SETUP([Default %printer and %destructor for user-defined end token]) -AT_DATA_GRAMMAR([[input.y]], -[[%error-verbose +# _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(TYPED) +# ----------------------------------------------------------------------------- +m4_define([_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN], +[m4_if($1, 0, + [m4_pushdef([kind], []) m4_pushdef([not_kind], [*])], + [m4_pushdef([kind], [*]) m4_pushdef([not_kind], [])]) + +AT_DATA_GRAMMAR([[input]]$1[[.y]], +[[%define parse.error verbose %debug %locations %initial-action { @@ -712,13 +912,26 @@ AT_DATA_GRAMMAR([[input.y]], # define USE(SYM) %} +%destructor { + fprintf (yyoutput, "<]]not_kind[[> destructor should not be called.\n"); +} <]]not_kind[[> + %token END 0 %printer { - fprintf (yyoutput, "Default printer for '%c' @ %d", $$, @$.first_column); -} %symbol-default + fprintf (yyoutput, "<]]kind[[> for '%c' @ %d", $$, @$.first_column); +} <]]kind[[> %destructor { - fprintf (stdout, "Default destructor for '%c' @ %d.\n", $$, @$.first_column); -} %symbol-default + fprintf (stdout, "<]]kind[[> for '%c' @ %d.\n", $$, @$.first_column); +} <]]kind[[> + +%printer { + fprintf (yyoutput, "<]]not_kind[[> printer should not be called.\n"); +} <]]not_kind[[> + +]]m4_if($1, 0, [[[ +]]], +[[[%union { char tag; } +%type start END]]])[[ %% @@ -729,7 +942,10 @@ start: { $$ = 'S'; } ; static int yylex (void) { - yylval = 'E'; + static int called; + if (called++) + abort (); + yylval]]m4_if($1, 0,, [[[.tag]]])[[ = 'E'; yylloc.first_line = yylloc.last_line = 1; yylloc.first_column = yylloc.last_column = 1; return 0; @@ -749,26 +965,33 @@ main (void) } ]]) -AT_CHECK([bison -o input.c input.y]) -AT_COMPILE([input]) -AT_PARSER_CHECK([./input], 0, -[[Default destructor for 'E' @ 1. -Default destructor for 'S' @ 1. +AT_BISON_CHECK([-o input$1.c input$1.y]) +AT_COMPILE([input$1]) +AT_PARSER_CHECK([./input$1], 0, +[[<]]kind[[> for 'E' @ 1. +<]]kind[[> for 'S' @ 1. ]], [[Starting parse Entering state 0 -Reducing stack by rule 1 (line 37): --> $$ = nterm start (1.1-1.1: Default printer for 'S' @ 1) +Reducing stack by rule 1 (line 46): +-> $$ = nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1) Stack now 0 Entering state 1 Reading a token: Now at end of input. -Shifting token END (1.1-1.1: Default printer for 'E' @ 1) +Shifting token END (1.1-1.1: <]]kind[[> for 'E' @ 1) Entering state 2 Stack now 0 1 2 -Cleanup: popping token END (1.1-1.1: Default printer for 'E' @ 1) -Cleanup: popping nterm start (1.1-1.1: Default printer for 'S' @ 1) +Cleanup: popping token END (1.1-1.1: <]]kind[[> for 'E' @ 1) +Cleanup: popping nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1) ]]) +m4_popdef([kind]) +m4_popdef([not_kind]) +]) + +_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(0) +_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(1) + AT_CLEANUP @@ -777,7 +1000,7 @@ AT_CLEANUP ## Default %printer and %destructor are not for error or $undefined. ## ## ------------------------------------------------------------------ ## -AT_SETUP([Default %printer and %destructor are not for error or \$undefined]) +AT_SETUP([Default %printer and %destructor are not for error or $undefined]) # If Bison were to apply the default %printer and %destructor to the error # token or to $undefined: @@ -793,6 +1016,7 @@ AT_DATA_GRAMMAR([[input.y]], %{ # include +# include static void yyerror (const char *msg); static int yylex (void); # define USE(SYM) @@ -800,10 +1024,10 @@ AT_DATA_GRAMMAR([[input.y]], %printer { fprintf (yyoutput, "'%c'", $$); -} %symbol-default +} <> <*> %destructor { fprintf (stderr, "DESTROY '%c'\n", $$); -} %symbol-default +} <> <*> %% @@ -819,8 +1043,11 @@ start: static int yylex (void) { - static const char *input = "abd"; - yylval = *input++; + static char const input[] = "abd"; + static size_t toknum; + if (! (toknum < sizeof input)) + abort (); + yylval = input[toknum++]; return yylval; } @@ -838,7 +1065,7 @@ main (void) } ]]) -AT_CHECK([bison -o input.c input.y]) +AT_BISON_CHECK([-o input.c input.y]) AT_COMPILE([input]) AT_PARSER_CHECK([./input], [1], [], [[Starting parse @@ -883,7 +1110,7 @@ AT_CLEANUP ## Default %printer and %destructor are not for $accept. ## ## ------------------------------------------------------ ## -AT_SETUP([Default %printer and %destructor are not for \$accept]) +AT_SETUP([Default %printer and %destructor are not for $accept]) # If YYSTYPE is a union and Bison were to apply the default %printer and # %destructor to $accept: @@ -903,6 +1130,7 @@ AT_DATA_GRAMMAR([[input.y]], %{ # include +# include static void yyerror (const char *msg); static int yylex (void); # define USE(SYM) @@ -911,11 +1139,11 @@ AT_DATA_GRAMMAR([[input.y]], %printer { char chr = $$; fprintf (yyoutput, "'%c'", chr); -} %symbol-default +} <> <*> %destructor { char chr = $$; fprintf (stderr, "DESTROY '%c'\n", chr); -} %symbol-default +} <> <*> %union { char chr; } %type start @@ -929,6 +1157,76 @@ start: { USE($$); } ; static int yylex (void) { + static int called; + if (called++) + abort (); + return 0; +} + +static void +yyerror (const char *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse (); +} +]]) + +AT_BISON_CHECK([-o input.c input.y]) +AT_COMPILE([input]) + +AT_CLEANUP + + + +## ------------------------------------------------------ ## +## Default %printer and %destructor for mid-rule values. ## +## ------------------------------------------------------ ## + +AT_SETUP([Default %printer and %destructor for mid-rule values]) + +AT_DATA_GRAMMAR([[input.y]], +[[%debug /* So that %printer is actually compiled. */ + +%{ +# include +# include + static void yyerror (const char *msg); + static int yylex (void); +# define USE(SYM) +# define YYLTYPE int +# define YYLLOC_DEFAULT(Current, Rhs, N) +# define YY_LOCATION_PRINT(File, Loc) +%} + +%printer { fprintf (yyoutput, "%d", @$); } <> +%destructor { fprintf (stderr, "DESTROY %d\n", @$); } <> +%printer { fprintf (yyoutput, "<*> printer should not be called"); } <*> +%destructor { fprintf (yyoutput, "<*> destructor should not be called"); } <*> + +%% + +start: + { @$ = 1; } // Not set or used. + { USE ($$); @$ = 2; } // Both set and used. + { USE ($$); @$ = 3; } // Only set. + { @$ = 4; } // Only used. + 'c' + { USE (($$, $2, $4, $5)); @$ = 0; } + ; + +%% + +static int +yylex (void) +{ + static int called; + if (called++) + abort (); return 0; } @@ -941,11 +1239,289 @@ yyerror (const char *msg) int main (void) { + yydebug = 1; return yyparse (); } ]]) -AT_CHECK([bison -o input.c input.y]) +AT_BISON_CHECK([-o input.c input.y], 0,, +[[input.y:33.3-23: warning: unset value: $$ +input.y:30.3-35.37: warning: unused value: $3 +]]) + AT_COMPILE([input]) +AT_PARSER_CHECK([./input], 1,, +[[Starting parse +Entering state 0 +Reducing stack by rule 1 (line 30): +-> $$ = nterm $@1 (: ) +Stack now 0 +Entering state 2 +Reducing stack by rule 2 (line 31): +-> $$ = nterm @2 (: 2) +Stack now 0 2 +Entering state 4 +Reducing stack by rule 3 (line 32): +-> $$ = nterm @3 (: 3) +Stack now 0 2 4 +Entering state 5 +Reducing stack by rule 4 (line 33): +-> $$ = nterm @4 (: 4) +Stack now 0 2 4 5 +Entering state 6 +Reading a token: Now at end of input. +syntax error +Error: popping nterm @4 (: 4) +DESTROY 4 +Stack now 0 2 4 5 +Error: popping nterm @3 (: 3) +DESTROY 3 +Stack now 0 2 4 +Error: popping nterm @2 (: 2) +DESTROY 2 +Stack now 0 2 +Error: popping nterm $@1 (: ) +Stack now 0 +Cleanup: discarding lookahead token $end (: ) +Stack now 0 +]]) + +AT_CLEANUP + + +## ----------------------- ## +## @$ implies %locations. ## +## ----------------------- ## + +# Bison once forgot to check for @$ in actions other than semantic actions. + +# AT_CHECK_ACTION_LOCATIONS(ACTION-DIRECTIVE) +# ------------------------------------------------------- +m4_define([AT_CHECK_ACTION_LOCATIONS], +[AT_SETUP([[@$ in ]$1[ implies %locations]]) + +AT_DATA_GRAMMAR([[input.y]], +[[%code { + #include + static int yylex (void); + static void yyerror (char const *msg); +} + +%debug + +]$1[ { + printf ("%d\n", @$.first_line); +} ]m4_if($1, [%initial-action], [], [[start]])[ + +%% + +start: ; + +%% + +static int +yylex (void) +{ + return 0; +} + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + return yyparse (); +} +]]) + +AT_BISON_CHECK([[-o input.c input.y]]) +AT_COMPILE([[input]]) + +AT_CLEANUP]) + +AT_CHECK_ACTION_LOCATIONS([[%initial-action]]) +AT_CHECK_ACTION_LOCATIONS([[%destructor]]) +AT_CHECK_ACTION_LOCATIONS([[%printer]]) + + +## ----------------------------------------------- ## +## Fix user actions without a trailing semicolon. ## +## ----------------------------------------------- ## + +AT_SETUP([[Fix user actions without a trailing semicolon]]) + +# This feature is undocumented, but we accidentally broke it in 2.3a, +# and there was a complaint at: +# . + +AT_DATA([input.y], +[[%% +start: test2 test1 test0 testc; + +test2 +: 'a' { semi; /* TEST:N:2 */ } +| 'b' { if (0) {no_semi} /* TEST:N:2 */ } +| 'c' { if (0) {semi;} /* TEST:N:2 */ } +| 'd' { semi; no_semi /* TEST:Y:2 */ } +| 'e' { semi(); no_semi() /* TEST:Y:2 */ } +| 'f' { semi[]; no_semi[] /* TEST:Y:2 */ } +| 'g' { semi++; no_semi++ /* TEST:Y:2 */ } +| 'h' { {no_semi} no_semi /* TEST:Y:2 */ } +| 'i' { {semi;} no_semi /* TEST:Y:2 */ } +; +test1 + : 'a' { semi; // TEST:N:1 ; +} | 'b' { if (0) {no_semi} // TEST:N:1 ; +} | 'c' { if (0) {semi;} // TEST:N:1 ; +} | 'd' { semi; no_semi // TEST:Y:1 ; +} | 'e' { semi(); no_semi() // TEST:Y:1 ; +} | 'f' { semi[]; no_semi[] // TEST:Y:1 ; +} | 'g' { semi++; no_semi++ // TEST:Y:1 ; +} | 'h' { {no_semi} no_semi // TEST:Y:1 ; +} | 'i' { {semi;} no_semi // TEST:Y:1 ; +} ; +test0 + : 'a' { semi; // TEST:N:1 {} +} | 'b' { if (0) {no_semi} // TEST:N:1 {} +} | 'c' { if (0) {semi;} // TEST:N:1 {} +} | 'd' { semi; no_semi // TEST:Y:1 {} +} | 'e' { semi(); no_semi() // TEST:Y:1 {} +} | 'f' { semi[]; no_semi[] // TEST:Y:1 {} +} | 'g' { semi++; no_semi++ // TEST:Y:1 {} +} | 'h' { {no_semi} no_semi // TEST:Y:1 {} +} | 'i' { {semi;} no_semi // TEST:Y:1 {} +} ; + +testc +: 'a' { +#define TEST_MACRO_N \ +[]"broken\" $ @ $$ @$ [];\ +string;"} +| 'b' { +no_semi +#define TEST_MACRO_N \ +[]"broken\" $ @ $$ @$ [];\ +string;"} +]]) + +AT_BISON_CHECK([[-o input.c input.y]], [0], [], +[[input.y:8.48: warning: a `;' might be needed at the end of action code +input.y:8.48: warning: future versions of Bison will not add the `;' +input.y:9.48: warning: a `;' might be needed at the end of action code +input.y:9.48: warning: future versions of Bison will not add the `;' +input.y:10.48: warning: a `;' might be needed at the end of action code +input.y:10.48: warning: future versions of Bison will not add the `;' +input.y:11.48: warning: a `;' might be needed at the end of action code +input.y:11.48: warning: future versions of Bison will not add the `;' +input.y:12.48: warning: a `;' might be needed at the end of action code +input.y:12.48: warning: future versions of Bison will not add the `;' +input.y:13.48: warning: a `;' might be needed at the end of action code +input.y:13.48: warning: future versions of Bison will not add the `;' +input.y:20.1: warning: a `;' might be needed at the end of action code +input.y:20.1: warning: future versions of Bison will not add the `;' +input.y:21.1: warning: a `;' might be needed at the end of action code +input.y:21.1: warning: future versions of Bison will not add the `;' +input.y:22.1: warning: a `;' might be needed at the end of action code +input.y:22.1: warning: future versions of Bison will not add the `;' +input.y:23.1: warning: a `;' might be needed at the end of action code +input.y:23.1: warning: future versions of Bison will not add the `;' +input.y:24.1: warning: a `;' might be needed at the end of action code +input.y:24.1: warning: future versions of Bison will not add the `;' +input.y:25.1: warning: a `;' might be needed at the end of action code +input.y:25.1: warning: future versions of Bison will not add the `;' +input.y:31.1: warning: a `;' might be needed at the end of action code +input.y:31.1: warning: future versions of Bison will not add the `;' +input.y:32.1: warning: a `;' might be needed at the end of action code +input.y:32.1: warning: future versions of Bison will not add the `;' +input.y:33.1: warning: a `;' might be needed at the end of action code +input.y:33.1: warning: future versions of Bison will not add the `;' +input.y:34.1: warning: a `;' might be needed at the end of action code +input.y:34.1: warning: future versions of Bison will not add the `;' +input.y:35.1: warning: a `;' might be needed at the end of action code +input.y:35.1: warning: future versions of Bison will not add the `;' +input.y:36.1: warning: a `;' might be needed at the end of action code +input.y:36.1: warning: future versions of Bison will not add the `;' +]]) + +AT_MATCHES_CHECK([input.c], [[/\* TEST:N:2 \*/ \}$]], [[3]]) +AT_MATCHES_CHECK([input.c], [[/\* TEST:Y:2 \*/ ;\}$]], [[6]]) +AT_MATCHES_CHECK([input.c], [[// TEST:N:1 [;{}]*\n\}$]], [[6]]) +AT_MATCHES_CHECK([input.c], [[// TEST:Y:1 [;{}]*\n;\}$]], [[12]]) +AT_MATCHES_CHECK([input.c], [[#define TEST_MACRO_N \\\n\[\]"broken\\" \$ \@ \$\$ \@\$ \[\];\\\nstring;"\}]], [[2]]) + +AT_CLEANUP + + +## -------------------------------------------------- ## +## Destroying lookahead assigned by semantic action. ## +## -------------------------------------------------- ## + +AT_SETUP([[Destroying lookahead assigned by semantic action]]) + +AT_DATA_GRAMMAR([input.y], +[[ +%code { + #include + #include + static void yyerror (char const *); + static int yylex (void); + #define USE(Var) +} + +%destructor { fprintf (stderr, "'a' destructor\n"); } 'a' +%destructor { fprintf (stderr, "'b' destructor\n"); } 'b' + +%% + +// In a previous version of Bison, yychar assigned by the semantic +// action below was not translated into yytoken before the lookahead was +// discarded and thus before its destructor (selected according to +// yytoken) was called in order to return from yyparse. This would +// happen even if YYACCEPT was performed in a later semantic action as +// long as only consistent states with default reductions were visited +// in between. However, we leave YYACCEPT in the same semantic action +// for this test in order to show that skeletons cannot simply translate +// immediately after every semantic action because a semantic action +// that has set yychar might not always return normally. Instead, +// skeletons must translate before every use of yytoken. +start: 'a' accept { USE($1); } ; +accept: /*empty*/ { + assert (yychar == YYEMPTY); + yychar = 'b'; + YYACCEPT; +} ; + +%% + +static void +yyerror (char const *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +static int +yylex (void) +{ + static char const *input = "a"; + return *input++; +} + +int +main (void) +{ + return yyparse (); +} +]]) + +AT_BISON_CHECK([[-o input.c input.y]]) +AT_COMPILE([[input]]) +AT_PARSER_CHECK([[./input]], [[0]], [], +[['b' destructor +'a' destructor +]]) AT_CLEANUP