X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/31b850d2d433aff80a6cc31fef79ada95dab0153..d115aad9112fb4e2fe1b268c9db7390732d39539:/tests/actions.at diff --git a/tests/actions.at b/tests/actions.at index be52791c..4199a3ef 100644 --- a/tests/actions.at +++ b/tests/actions.at @@ -1,6 +1,6 @@ # Executing Actions. -*- Autotest -*- -# Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 -# Free Software Foundation, Inc. + +# Copyright (C) 2001-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 @@ -29,7 +29,7 @@ AT_SETUP([Mid-rule actions]) # action. AT_DATA_GRAMMAR([[input.y]], -[[%define parse.error "verbose" +[[%define parse.error verbose %debug %{ # include @@ -93,7 +93,7 @@ AT_CLEANUP AT_SETUP([Exotic Dollars]) AT_DATA_GRAMMAR([[input.y]], -[[%define parse.error "verbose" +[[%define parse.error verbose %debug %{ # include @@ -158,6 +158,52 @@ 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 @@ -252,11 +298,11 @@ input: printf ("input (%d@%d-%d): /* Nothing */\n", $$, RANGE (@$)); } | line input /* Right recursive to load the stack so that popping at - END can be exercised. */ + END can be exercised. */ { $$ = 2; printf ("input (%d@%d-%d): line (%d@%d-%d) input (%d@%d-%d)\n", - $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2)); + $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2)); } ; @@ -557,7 +603,7 @@ m4_define([AT_CHECK_PRINTER_AND_DESTRUCTOR], $3 _AT_CHECK_PRINTER_AND_DESTRUCTOR($[1], $[2], $[3], $[4], -[%define parse.error "verbose" +[%define parse.error verbose %debug %verbose %locations @@ -588,7 +634,7 @@ AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser], [with union]) AT_SETUP([Default tagless %printer and %destructor]) AT_DATA_GRAMMAR([[input.y]], -[[%define parse.error "verbose" +[[%define parse.error verbose %debug %locations %initial-action { @@ -706,7 +752,7 @@ AT_CLEANUP AT_SETUP([Default tagged and per-type %printer and %destructor]) AT_DATA_GRAMMAR([[input.y]], -[[%define parse.error "verbose" +[[%define parse.error verbose %debug %{ @@ -850,7 +896,7 @@ m4_define([_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN], [m4_pushdef([kind], [*]) m4_pushdef([not_kind], [])]) AT_DATA_GRAMMAR([[input]]$1[[.y]], -[[%define parse.error "verbose" +[[%define parse.error verbose %debug %locations %initial-action { @@ -1153,7 +1199,7 @@ AT_DATA_GRAMMAR([[input.y]], static int yylex (void); # define USE(SYM) # define YYLTYPE int -# define YYLLOC_DEFAULT(Current, Rhs, N) +# define YYLLOC_DEFAULT(Current, Rhs, N) (void)(Rhs) # define YY_LOCATION_PRINT(File, Loc) %} @@ -1317,37 +1363,37 @@ 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 */ } +: '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 ; + : '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 {} + : '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 @@ -1363,42 +1409,42 @@ 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 `;' +[[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]]) @@ -1408,3 +1454,139 @@ 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 + +## ---------- ## +## YYBACKUP. ## +## ---------- ## + +AT_SETUP([[YYBACKUP]]) + +AT_DATA_GRAMMAR([input.y], +[[ +%error-verbose +%debug +%pure-parser +%code { +# include +# include +# include + + static void yyerror (const char *msg); + static int yylex (YYSTYPE *yylval); +} +%% +input: + exp exp {} +; + +exp: + 'a' { printf ("a: %d\n", $1); } +| 'b' { YYBACKUP('a', 123); } +| 'c' 'd' { YYBACKUP('a', 456); } +; + +%% +static int +yylex (YYSTYPE *yylval) +{ + static char const input[] = "bcd"; + static size_t toknum; + assert (toknum < sizeof input); + *yylval = (toknum + 1) * 10; + return input[toknum++]; +} + +static void +yyerror (const char *msg) +{ + fprintf (stderr, "%s\n", msg); +} + +int +main (void) +{ + yydebug = !!getenv("YYDEBUG"); + return yyparse (); +} +]]) + +AT_BISON_CHECK([[-o input.c input.y]]) +AT_COMPILE([[input]]) +AT_PARSER_CHECK([[./input]], [[0]], +[[a: 123 +a: 456 +a: 789 +]]) + +AT_CLEANUP