X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/9fc4c025fd334dabca9c7d66ec8219e4e29a4dda..746ac9aa81dd638d35ef43b75cefaff4af7afd48:/tests/actions.at?ds=sidebyside diff --git a/tests/actions.at b/tests/actions.at index 7f2d7eed..7f825029 100644 --- a/tests/actions.at +++ b/tests/actions.at @@ -1,6 +1,6 @@ # Executing Actions. -*- Autotest -*- -# Copyright (C) 2001-2011 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 @@ -298,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)); } ; @@ -345,7 +345,7 @@ thing: ; %% /* Alias to ARGV[1]. */ -const char *source = 0; +const char *source = YY_NULL; static int yylex (]AT_LEX_FORMALS[) @@ -1363,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 @@ -1409,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]]) @@ -1525,3 +1525,67 @@ AT_PARSER_CHECK([[./input]], [[0]], [], ]]) 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 +]]) + +AT_CLEANUP