tests/actions.at

   1 # Executing Actions.                               -*- Autotest -*-
   2 # Copyright (C) 2001-2010 Free Software Foundation, Inc.
   3
   4 # This program is free software: you can redistribute it and/or modify
   5 # it under the terms of the GNU General Public License as published by
   6 # the Free Software Foundation, either version 3 of the License, or
   7 # (at your option) any later version.
   8 #
   9 # This program is distributed in the hope that it will be useful,
  10 # but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 # GNU General Public License for more details.
  13 #
  14 # You should have received a copy of the GNU General Public License
  15 # along with this program.  If not, see <http://www.gnu.org/licenses/>.
  16
  17 AT_BANNER([[User Actions.]])
  18
  19 ## ------------------ ##
  20 ## Mid-rule actions.  ##
  21 ## ------------------ ##
  22
  23 AT_SETUP([Mid-rule actions])
  24
  25 # Bison once forgot the mid-rule actions.  It was because the action
  26 # was attached to the host rule (the one with the mid-rule action),
  27 # instead of being attached to the empty rule dedicated to this
  28 # action.
  29
  30 AT_DATA_GRAMMAR([[input.y]],
  31 [[%define parse.error verbose
  32 %debug
  33 %{
  34 # include <stdio.h>
  35 # include <stdlib.h>
  36   static void yyerror (const char *msg);
  37   static int yylex (void);
  38 %}
  39 %%
  40 exp:     { putchar ('0'); }
  41      '1' { putchar ('1'); }
  42      '2' { putchar ('2'); }
  43      '3' { putchar ('3'); }
  44      '4' { putchar ('4'); }
  45      '5' { putchar ('5'); }
  46      '6' { putchar ('6'); }
  47      '7' { putchar ('7'); }
  48      '8' { putchar ('8'); }
  49      '9' { putchar ('9'); }
  50          { putchar ('\n'); }
  51    ;
  52 %%
  53 static int
  54 yylex (void)
  55 {
  56   static char const input[] = "123456789";
  57   static size_t toknum;
  58   if (! (toknum < sizeof input))
  59     abort ();
  60   return input[toknum++];
  61 }
  62
  63 static void
  64 yyerror (const char *msg)
  65 {
  66   fprintf (stderr, "%s\n", msg);
  67 }
  68
  69 int
  70 main (void)
  71 {
  72   return yyparse ();
  73 }
  74 ]])
  75
  76 AT_BISON_CHECK([-d -v -o input.c input.y])
  77 AT_COMPILE([input])
  78 AT_PARSER_CHECK([./input], 0,
  79 [[0123456789
  80 ]])
  81
  82 AT_CLEANUP
  83
  84
  85
  86
  87
  88 ## ---------------- ##
  89 ## Exotic Dollars.  ##
  90 ## ---------------- ##
  91
  92 AT_SETUP([Exotic Dollars])
  93
  94 AT_DATA_GRAMMAR([[input.y]],
  95 [[%define parse.error verbose
  96 %debug
  97 %{
  98 # include <stdio.h>
  99 # include <stdlib.h>
 100   static void yyerror (const char *msg);
 101   static int yylex (void);
 102 # define USE(Var)
 103 %}
 104
 105 %union
 106 {
 107   int val;
 108 };
 109
 110 %type <val> a_1 a_2 a_5
 111             sum_of_the_five_previous_values
 112
 113 %%
 114 exp: a_1 a_2 { $<val>$ = 3; } { $<val>$ = $<val>3 + 1; } a_5
 115      sum_of_the_five_previous_values
 116     {
 117        USE (($1, $2, $<foo>3, $<foo>4, $5));
 118        printf ("%d\n", $6);
 119     }
 120 ;
 121 a_1: { $$ = 1; };
 122 a_2: { $$ = 2; };
 123 a_5: { $$ = 5; };
 124
 125 sum_of_the_five_previous_values:
 126     {
 127        $$ = $<val>0 + $<val>-1 + $<val>-2 + $<val>-3 + $<val>-4;
 128     }
 129 ;
 130
 131 %%
 132 static int
 133 yylex (void)
 134 {
 135   static int called;
 136   if (called++)
 137     abort ();
 138   return EOF;
 139 }
 140
 141 static void
 142 yyerror (const char *msg)
 143 {
 144   fprintf (stderr, "%s\n", msg);
 145 }
 146
 147 int
 148 main (void)
 149 {
 150   return yyparse ();
 151 }
 152 ]])
 153
 154 AT_BISON_CHECK([-d -v -o input.c input.y], 0)
 155 AT_COMPILE([input])
 156 AT_PARSER_CHECK([./input], 0,
 157 [[15
 158 ]])
 159
 160 AT_CLEANUP
 161
 162
 163
 164 ## -------------------------- ##
 165 ## Printers and Destructors.  ##
 166 ## -------------------------- ##
 167
 168 # _AT_CHECK_PRINTER_AND_DESTRUCTOR($1, $2, $3, $4, BISON-DIRECTIVE, UNION-FLAG)
 169 # -----------------------------------------------------------------------------
 170 m4_define([_AT_CHECK_PRINTER_AND_DESTRUCTOR],
 171 [# Make sure complex $n work.
 172 m4_if([$1$2$3], $[1]$[2]$[3], [],
 173        [m4_fatal([$0: Invalid arguments: $@])])dnl
 174
 175 # Be sure to pass all the %directives to this macro to have correct
 176 # helping macros.  So don't put any directly in the Bison file.
 177 AT_BISON_OPTION_PUSHDEFS([$5])
 178 AT_DATA_GRAMMAR([[input.y]],
 179 [[%code requires {
 180 #include <stdio.h>
 181 #include <stdlib.h>
 182 #include <string.h>
 183 #include <assert.h>
 184
 185 #define YYINITDEPTH 10
 186 #define YYMAXDEPTH 10
 187 ]AT_LALR1_CC_IF(
 188   [#define RANGE(Location) (Location).begin.line, (Location).end.line],
 189   [#define RANGE(Location) (Location).first_line, (Location).last_line])
 190 [}
 191
 192 $5]
 193 m4_ifval([$6], [%union
 194 {
 195   int ival;
 196 }])
 197 AT_LALR1_CC_IF([%define global_tokens_and_yystype])
 198 m4_ifval([$6], [[%code provides {]], [[%code {]])
 199 AT_LALR1_CC_IF([typedef yy::location YYLTYPE;])
 200 [static int yylex (]AT_LEX_FORMALS[);
 201 ]AT_LALR1_CC_IF([], [static void yyerror (const char *msg);])
 202 [}
 203
 204 ]m4_ifval([$6], [%type <ival> '(' 'x' 'y' ')' ';' thing line input END])[
 205
 206 /* FIXME: This %printer isn't actually tested.  */
 207 %printer
 208   {
 209     ]AT_LALR1_CC_IF([debug_stream () << $$;],
 210                     [fprintf (yyoutput, "%d", $$)])[;
 211   }
 212   input line thing 'x' 'y'
 213
 214 %destructor
 215   { printf ("Freeing nterm input (%d@%d-%d)\n", $$, RANGE (@$)); }
 216   input
 217
 218 %destructor
 219   { printf ("Freeing nterm line (%d@%d-%d)\n", $$, RANGE (@$)); }
 220   line
 221
 222 %destructor
 223   { printf ("Freeing nterm thing (%d@%d-%d)\n", $$, RANGE (@$)); }
 224   thing
 225
 226 %destructor
 227   { printf ("Freeing token 'x' (%d@%d-%d)\n", $$, RANGE (@$)); }
 228   'x'
 229
 230 %destructor
 231   { printf ("Freeing token 'y' (%d@%d-%d)\n", $$, RANGE (@$)); }
 232   'y'
 233
 234 %token END 0
 235 %destructor
 236   { printf ("Freeing token END (%d@%d-%d)\n", $$, RANGE (@$)); }
 237   END
 238
 239 %%
 240 /*
 241    This grammar is made to exercise error recovery.
 242    "Lines" starting with `(' support error recovery, with
 243    ')' as synchronizing token.  Lines starting with 'x' can never
 244    be recovered from if in error.
 245 */
 246
 247 input:
 248   /* Nothing. */
 249     {
 250       $$ = 0;
 251       printf ("input (%d@%d-%d): /* Nothing */\n", $$, RANGE (@$));
 252     }
 253 | line input /* Right recursive to load the stack so that popping at
 254                 END can be exercised.  */
 255     {
 256       $$ = 2;
 257       printf ("input (%d@%d-%d): line (%d@%d-%d) input (%d@%d-%d)\n",
 258               $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2));
 259     }
 260 ;
 261
 262 line:
 263   thing thing thing ';'
 264     {
 265       $$ = $1;
 266       printf ("line (%d@%d-%d): thing (%d@%d-%d) thing (%d@%d-%d) thing (%d@%d-%d) ';' (%d@%d-%d)\n",
 267               $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2),
 268               $3, RANGE (@3), $4, RANGE (@4));
 269     }
 270 | '(' thing thing ')'
 271     {
 272       $$ = $1;
 273       printf ("line (%d@%d-%d): '(' (%d@%d-%d) thing (%d@%d-%d) thing (%d@%d-%d) ')' (%d@%d-%d)\n",
 274               $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2),
 275               $3, RANGE (@3), $4, RANGE (@4));
 276     }
 277 | '(' thing ')'
 278     {
 279       $$ = $1;
 280       printf ("line (%d@%d-%d): '(' (%d@%d-%d) thing (%d@%d-%d) ')' (%d@%d-%d)\n",
 281               $$, RANGE (@$), $1, RANGE (@1), $2, RANGE (@2), $3, RANGE (@3));
 282     }
 283 | '(' error ')'
 284     {
 285       $$ = -1;
 286       printf ("line (%d@%d-%d): '(' (%d@%d-%d) error (@%d-%d) ')' (%d@%d-%d)\n",
 287               $$, RANGE (@$), $1, RANGE (@1), RANGE (@2), $3, RANGE (@3));
 288     }
 289 ;
 290
 291 thing:
 292   'x'
 293     {
 294       $$ = $1;
 295       printf ("thing (%d@%d-%d): 'x' (%d@%d-%d)\n",
 296               $$, RANGE (@$), $1, RANGE (@1));
 297     }
 298 ;
 299 %%
 300 /* Alias to ARGV[1]. */
 301 const char *source = 0;
 302
 303 static int
 304 yylex (]AT_LEX_FORMALS[)
 305 {
 306   static unsigned int counter = 0;
 307
 308   int c = ]AT_VAL[]m4_ifval([$6], [.ival])[ = counter++;
 309   /* As in BASIC, line numbers go from 10 to 10.  */
 310 ]AT_LALR1_CC_IF(
 311 [ AT_LOC.begin.line = AT_LOC.begin.column = 10 * c;
 312   AT_LOC.end.line = AT_LOC.end.column = AT_LOC.begin.line + 9;
 313 ],
 314 [ AT_LOC.first_line = AT_LOC.first_column = 10 * c;
 315   AT_LOC.last_line = AT_LOC.last_column = AT_LOC.first_line + 9;
 316 ])[
 317
 318   if (! (0 <= c && c <= strlen (source)))
 319     abort ();
 320   if (source[c])
 321     printf ("sending: '%c'", source[c]);
 322   else
 323     printf ("sending: END");
 324   printf (" (%d@%d-%d)\n", c, RANGE (]AT_LOC[));
 325   return source[c];
 326 }
 327
 328 ]AT_LALR1_CC_IF(
 329 [/* A C++ error reporting function. */
 330 void
 331 yy::parser::error (const location& l, const std::string& m)
 332 {
 333   printf ("%d-%d: %s\n", RANGE (l), m.c_str());
 334 }
 335
 336 static bool yydebug;
 337 int
 338 yyparse ()
 339 {
 340   yy::parser parser;
 341   parser.set_debug_level (yydebug);
 342   return parser.parse ();
 343 }
 344 ],
 345 [static void
 346 yyerror (const char *msg)
 347 {
 348   printf ("%d-%d: %s\n", RANGE (yylloc), msg);
 349 }])[
 350
 351 int
 352 main (int argc, const char *argv[])
 353 {
 354   int status;
 355   yydebug = !!getenv ("YYDEBUG");
 356   assert (argc == 2);
 357   source = argv[1];
 358   status = yyparse ();
 359   switch (status)
 360     {
 361       case 0: printf ("Successful parse.\n"); break;
 362       case 1: printf ("Parsing FAILED.\n"); break;
 363       default: printf ("Parsing FAILED (status %d).\n", status); break;
 364     }
 365   return status;
 366 }
 367 ]])
 368
 369 AT_FULL_COMPILE([input])
 370
 371
 372 # Check the location of "empty"
 373 # -----------------------------
 374 # I.e., epsilon-reductions, as in "(x)" which ends by reducing
 375 # an empty "line" nterm.
 376 # FIXME: This location is not satisfying.  Depend on the lookahead?
 377 AT_PARSER_CHECK([./input '(x)'], 0,
 378 [[sending: '(' (0@0-9)
 379 sending: 'x' (1@10-19)
 380 thing (1@10-19): 'x' (1@10-19)
 381 sending: ')' (2@20-29)
 382 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
 383 sending: END (3@30-39)
 384 input (0@29-29): /* Nothing */
 385 input (2@0-29): line (0@0-29) input (0@29-29)
 386 Freeing token END (3@30-39)
 387 Freeing nterm input (2@0-29)
 388 Successful parse.
 389 ]])
 390
 391
 392 # Check locations in error recovery
 393 # ---------------------------------
 394 # '(y)' is an error, but can be recovered from.  But what's the location
 395 # of the error itself ('y'), and of the resulting reduction ('(error)').
 396 AT_PARSER_CHECK([./input '(y)'], 0,
 397 [[sending: '(' (0@0-9)
 398 sending: 'y' (1@10-19)
 399 10-19: syntax error, unexpected 'y', expecting 'x'
 400 Freeing token 'y' (1@10-19)
 401 sending: ')' (2@20-29)
 402 line (-1@0-29): '(' (0@0-9) error (@10-19) ')' (2@20-29)
 403 sending: END (3@30-39)
 404 input (0@29-29): /* Nothing */
 405 input (2@0-29): line (-1@0-29) input (0@29-29)
 406 Freeing token END (3@30-39)
 407 Freeing nterm input (2@0-29)
 408 Successful parse.
 409 ]])
 410
 411
 412 # Syntax errors caught by the parser
 413 # ----------------------------------
 414 # Exercise the discarding of stack top and input until `error'
 415 # can be reduced.
 416 #
 417 #     '(', 'x', 'x', 'x', 'x', 'x', ')',
 418 #
 419 # Load the stack and provoke an error that cannot be caught by the
 420 # grammar, to check that the stack is cleared.  And make sure the
 421 # lookahead is freed.
 422 #
 423 #     '(', 'x', ')',
 424 #     '(', 'x', ')',
 425 #     'y'
 426 AT_PARSER_CHECK([./input '(xxxxx)(x)(x)y'], 1,
 427 [[sending: '(' (0@0-9)
 428 sending: 'x' (1@10-19)
 429 thing (1@10-19): 'x' (1@10-19)
 430 sending: 'x' (2@20-29)
 431 thing (2@20-29): 'x' (2@20-29)
 432 sending: 'x' (3@30-39)
 433 30-39: syntax error, unexpected 'x', expecting ')'
 434 Freeing nterm thing (2@20-29)
 435 Freeing nterm thing (1@10-19)
 436 Freeing token 'x' (3@30-39)
 437 sending: 'x' (4@40-49)
 438 Freeing token 'x' (4@40-49)
 439 sending: 'x' (5@50-59)
 440 Freeing token 'x' (5@50-59)
 441 sending: ')' (6@60-69)
 442 line (-1@0-69): '(' (0@0-9) error (@10-59) ')' (6@60-69)
 443 sending: '(' (7@70-79)
 444 sending: 'x' (8@80-89)
 445 thing (8@80-89): 'x' (8@80-89)
 446 sending: ')' (9@90-99)
 447 line (7@70-99): '(' (7@70-79) thing (8@80-89) ')' (9@90-99)
 448 sending: '(' (10@100-109)
 449 sending: 'x' (11@110-119)
 450 thing (11@110-119): 'x' (11@110-119)
 451 sending: ')' (12@120-129)
 452 line (10@100-129): '(' (10@100-109) thing (11@110-119) ')' (12@120-129)
 453 sending: 'y' (13@130-139)
 454 input (0@129-129): /* Nothing */
 455 input (2@100-129): line (10@100-129) input (0@129-129)
 456 input (2@70-129): line (7@70-99) input (2@100-129)
 457 input (2@0-129): line (-1@0-69) input (2@70-129)
 458 130-139: syntax error, unexpected 'y', expecting END
 459 Freeing nterm input (2@0-129)
 460 Freeing token 'y' (13@130-139)
 461 Parsing FAILED.
 462 ]])
 463
 464
 465 # Syntax error caught by the parser where lookahead = END
 466 # --------------------------------------------------------
 467 # Load the stack and provoke an error that cannot be caught by the
 468 # grammar, to check that the stack is cleared.  And make sure the
 469 # lookahead is freed.
 470 #
 471 #     '(', 'x', ')',
 472 #     '(', 'x', ')',
 473 #     'x'
 474 AT_PARSER_CHECK([./input '(x)(x)x'], 1,
 475 [[sending: '(' (0@0-9)
 476 sending: 'x' (1@10-19)
 477 thing (1@10-19): 'x' (1@10-19)
 478 sending: ')' (2@20-29)
 479 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
 480 sending: '(' (3@30-39)
 481 sending: 'x' (4@40-49)
 482 thing (4@40-49): 'x' (4@40-49)
 483 sending: ')' (5@50-59)
 484 line (3@30-59): '(' (3@30-39) thing (4@40-49) ')' (5@50-59)
 485 sending: 'x' (6@60-69)
 486 thing (6@60-69): 'x' (6@60-69)
 487 sending: END (7@70-79)
 488 70-79: syntax error, unexpected END, expecting 'x'
 489 Freeing nterm thing (6@60-69)
 490 Freeing nterm line (3@30-59)
 491 Freeing nterm line (0@0-29)
 492 Freeing token END (7@70-79)
 493 Parsing FAILED.
 494 ]])
 495
 496
 497 # Check destruction upon stack overflow
 498 # -------------------------------------
 499 # Upon stack overflow, all symbols on the stack should be destroyed.
 500 # Only check for yacc.c.
 501 AT_YACC_IF([
 502 AT_PARSER_CHECK([./input '(x)(x)(x)(x)(x)(x)(x)'], 2,
 503 [[sending: '(' (0@0-9)
 504 sending: 'x' (1@10-19)
 505 thing (1@10-19): 'x' (1@10-19)
 506 sending: ')' (2@20-29)
 507 line (0@0-29): '(' (0@0-9) thing (1@10-19) ')' (2@20-29)
 508 sending: '(' (3@30-39)
 509 sending: 'x' (4@40-49)
 510 thing (4@40-49): 'x' (4@40-49)
 511 sending: ')' (5@50-59)
 512 line (3@30-59): '(' (3@30-39) thing (4@40-49) ')' (5@50-59)
 513 sending: '(' (6@60-69)
 514 sending: 'x' (7@70-79)
 515 thing (7@70-79): 'x' (7@70-79)
 516 sending: ')' (8@80-89)
 517 line (6@60-89): '(' (6@60-69) thing (7@70-79) ')' (8@80-89)
 518 sending: '(' (9@90-99)
 519 sending: 'x' (10@100-109)
 520 thing (10@100-109): 'x' (10@100-109)
 521 sending: ')' (11@110-119)
 522 line (9@90-119): '(' (9@90-99) thing (10@100-109) ')' (11@110-119)
 523 sending: '(' (12@120-129)
 524 sending: 'x' (13@130-139)
 525 thing (13@130-139): 'x' (13@130-139)
 526 sending: ')' (14@140-149)
 527 line (12@120-149): '(' (12@120-129) thing (13@130-139) ')' (14@140-149)
 528 sending: '(' (15@150-159)
 529 sending: 'x' (16@160-169)
 530 thing (16@160-169): 'x' (16@160-169)
 531 sending: ')' (17@170-179)
 532 line (15@150-179): '(' (15@150-159) thing (16@160-169) ')' (17@170-179)
 533 sending: '(' (18@180-189)
 534 sending: 'x' (19@190-199)
 535 thing (19@190-199): 'x' (19@190-199)
 536 sending: ')' (20@200-209)
 537 200-209: memory exhausted
 538 Freeing nterm thing (19@190-199)
 539 Freeing nterm line (15@150-179)
 540 Freeing nterm line (12@120-149)
 541 Freeing nterm line (9@90-119)
 542 Freeing nterm line (6@60-89)
 543 Freeing nterm line (3@30-59)
 544 Freeing nterm line (0@0-29)
 545 Parsing FAILED (status 2).
 546 ]])
 547 ])
 548
 549 ])
 550
 551
 552 # AT_CHECK_PRINTER_AND_DESTRUCTOR([BISON-OPTIONS], [UNION-FLAG], [SKIP_FLAG])
 553 # ---------------------------------------------------------------------------
 554 m4_define([AT_CHECK_PRINTER_AND_DESTRUCTOR],
 555 [AT_SETUP([Printers and Destructors $2: $1])
 556
 557 $3
 558 _AT_CHECK_PRINTER_AND_DESTRUCTOR($[1], $[2], $[3], $[4],
 559 [%define parse.error verbose
 560 %debug
 561 %verbose
 562 %locations
 563 $1], [$2])
 564
 565 AT_CLEANUP
 566 ])
 567
 568
 569 AT_CHECK_PRINTER_AND_DESTRUCTOR([])
 570 AT_CHECK_PRINTER_AND_DESTRUCTOR([], [with union])
 571
 572 AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"])
 573 AT_CHECK_PRINTER_AND_DESTRUCTOR([%defines %skeleton "lalr1.cc"], [with union])
 574
 575 AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser])
 576 AT_CHECK_PRINTER_AND_DESTRUCTOR([%glr-parser], [with union])
 577
 578
 579
 580 ## ----------------------------------------- ##
 581 ## Default tagless %printer and %destructor. ##
 582 ## ----------------------------------------- ##
 583
 584 # Check that the right %printer and %destructor are called, that they're not
 585 # called for $end, and that $$ and @$ work correctly.
 586
 587 AT_SETUP([Default tagless %printer and %destructor])
 588
 589 AT_DATA_GRAMMAR([[input.y]],
 590 [[%define parse.error verbose
 591 %debug
 592 %locations
 593 %initial-action {
 594   @$.first_line = @$.last_line = 1;
 595   @$.first_column = @$.last_column = 1;
 596 }
 597
 598 %{
 599 # include <stdio.h>
 600 # include <stdlib.h>
 601   static void yyerror (const char *msg);
 602   static int yylex (void);
 603 # define USE(SYM)
 604 %}
 605
 606 %printer {
 607   fprintf (yyoutput, "<*> printer should not be called.\n");
 608 } <*>
 609
 610 %printer {
 611   fprintf (yyoutput, "<> printer for '%c' @ %d", $$, @$.first_column);
 612 } <>
 613 %destructor {
 614   fprintf (stdout, "<> destructor for '%c' @ %d.\n", $$, @$.first_column);
 615 } <>
 616
 617 %printer {
 618   fprintf (yyoutput, "'b'/'c' printer for '%c' @ %d", $$, @$.first_column);
 619 } 'b' 'c'
 620 %destructor {
 621   fprintf (stdout, "'b'/'c' destructor for '%c' @ %d.\n", $$, @$.first_column);
 622 } 'b' 'c'
 623
 624 %destructor {
 625   fprintf (yyoutput, "<*> destructor should not be called.\n");
 626 } <*>
 627
 628 %%
 629
 630 start: 'a' 'b' 'c' 'd' 'e' { $$ = 'S'; USE(($1, $2, $3, $4, $5)); } ;
 631
 632 %%
 633
 634 static int
 635 yylex (void)
 636 {
 637   static char const input[] = "abcd";
 638   static size_t toknum;
 639   if (! (toknum < sizeof input))
 640     abort ();
 641   yylval = input[toknum++];
 642   yylloc.first_line = yylloc.last_line = 1;
 643   yylloc.first_column = yylloc.last_column = toknum;
 644   return yylval;
 645 }
 646
 647 static void
 648 yyerror (const char *msg)
 649 {
 650   fprintf (stderr, "%s\n", msg);
 651 }
 652
 653 int
 654 main (void)
 655 {
 656   yydebug = 1;
 657   return yyparse ();
 658 }
 659 ]])
 660
 661 AT_BISON_CHECK([-o input.c input.y])
 662 AT_COMPILE([input])
 663 AT_PARSER_CHECK([./input], 1,
 664 [[<> destructor for 'd' @ 4.
 665 'b'/'c' destructor for 'c' @ 3.
 666 'b'/'c' destructor for 'b' @ 2.
 667 <> destructor for 'a' @ 1.
 668 ]],
 669 [[Starting parse
 670 Entering state 0
 671 Reading a token: Next token is token 'a' (1.1-1.1: <> printer for 'a' @ 1)
 672 Shifting token 'a' (1.1-1.1: <> printer for 'a' @ 1)
 673 Entering state 1
 674 Reading a token: Next token is token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
 675 Shifting token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
 676 Entering state 3
 677 Reading a token: Next token is token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
 678 Shifting token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
 679 Entering state 5
 680 Reading a token: Next token is token 'd' (1.4-1.4: <> printer for 'd' @ 4)
 681 Shifting token 'd' (1.4-1.4: <> printer for 'd' @ 4)
 682 Entering state 6
 683 Reading a token: Now at end of input.
 684 syntax error, unexpected $end, expecting 'e'
 685 Error: popping token 'd' (1.4-1.4: <> printer for 'd' @ 4)
 686 Stack now 0 1 3 5
 687 Error: popping token 'c' (1.3-1.3: 'b'/'c' printer for 'c' @ 3)
 688 Stack now 0 1 3
 689 Error: popping token 'b' (1.2-1.2: 'b'/'c' printer for 'b' @ 2)
 690 Stack now 0 1
 691 Error: popping token 'a' (1.1-1.1: <> printer for 'a' @ 1)
 692 Stack now 0
 693 Cleanup: discarding lookahead token $end (1.5-1.5: )
 694 Stack now 0
 695 ]])
 696
 697 AT_CLEANUP
 698
 699
 700
 701 ## ------------------------------------------------------ ##
 702 ## Default tagged and per-type %printer and %destructor.  ##
 703 ## ------------------------------------------------------ ##
 704
 705 AT_SETUP([Default tagged and per-type %printer and %destructor])
 706
 707 AT_DATA_GRAMMAR([[input.y]],
 708 [[%define parse.error verbose
 709 %debug
 710
 711 %{
 712 # include <stdio.h>
 713 # include <stdlib.h>
 714   static void yyerror (const char *msg);
 715   static int yylex (void);
 716 # define USE(SYM)
 717 %}
 718
 719 %printer {
 720   fprintf (yyoutput, "<> printer should not be called.\n");
 721 } <>
 722
 723 %union { int field0; int field1; int field2; }
 724 %type <field0> start 'a' 'g'
 725 %type <field1> 'e'
 726 %type <field2> 'f'
 727 %printer {
 728   fprintf (yyoutput, "<*>/<field2>/e printer");
 729 } <*> 'e' <field2>
 730 %destructor {
 731   fprintf (stdout, "<*>/<field2>/e destructor.\n");
 732 } <*> 'e' <field2>
 733
 734 %type <field1> 'b'
 735 %printer { fprintf (yyoutput, "<field1> printer"); } <field1>
 736 %destructor { fprintf (stdout, "<field1> destructor.\n"); } <field1>
 737
 738 %type <field0> 'c'
 739 %printer { fprintf (yyoutput, "'c' printer"); } 'c'
 740 %destructor { fprintf (stdout, "'c' destructor.\n"); } 'c'
 741
 742 %type <field1> 'd'
 743 %printer { fprintf (yyoutput, "'d' printer"); } 'd'
 744 %destructor { fprintf (stdout, "'d' destructor.\n"); } 'd'
 745
 746 %destructor {
 747   fprintf (yyoutput, "<> destructor should not be called.\n");
 748 } <>
 749
 750 %%
 751
 752 start:
 753   'a' 'b' 'c' 'd' 'e' 'f' 'g'
 754     {
 755       USE(($1, $2, $3, $4, $5, $6, $7));
 756       $$ = 'S';
 757     }
 758   ;
 759
 760 %%
 761
 762 static int
 763 yylex (void)
 764 {
 765   static char const input[] = "abcdef";
 766   static size_t toknum;
 767   if (! (toknum < sizeof input))
 768     abort ();
 769   return input[toknum++];
 770 }
 771
 772 static void
 773 yyerror (const char *msg)
 774 {
 775   fprintf (stderr, "%s\n", msg);
 776 }
 777
 778 int
 779 main (void)
 780 {
 781   yydebug = 1;
 782   return yyparse ();
 783 }
 784 ]])
 785
 786 AT_BISON_CHECK([-o input.c input.y])
 787 AT_COMPILE([input])
 788 AT_PARSER_CHECK([./input], 1,
 789 [[<*>/<field2>/e destructor.
 790 <*>/<field2>/e destructor.
 791 'd' destructor.
 792 'c' destructor.
 793 <field1> destructor.
 794 <*>/<field2>/e destructor.
 795 ]],
 796 [[Starting parse
 797 Entering state 0
 798 Reading a token: Next token is token 'a' (<*>/<field2>/e printer)
 799 Shifting token 'a' (<*>/<field2>/e printer)
 800 Entering state 1
 801 Reading a token: Next token is token 'b' (<field1> printer)
 802 Shifting token 'b' (<field1> printer)
 803 Entering state 3
 804 Reading a token: Next token is token 'c' ('c' printer)
 805 Shifting token 'c' ('c' printer)
 806 Entering state 5
 807 Reading a token: Next token is token 'd' ('d' printer)
 808 Shifting token 'd' ('d' printer)
 809 Entering state 6
 810 Reading a token: Next token is token 'e' (<*>/<field2>/e printer)
 811 Shifting token 'e' (<*>/<field2>/e printer)
 812 Entering state 7
 813 Reading a token: Next token is token 'f' (<*>/<field2>/e printer)
 814 Shifting token 'f' (<*>/<field2>/e printer)
 815 Entering state 8
 816 Reading a token: Now at end of input.
 817 syntax error, unexpected $end, expecting 'g'
 818 Error: popping token 'f' (<*>/<field2>/e printer)
 819 Stack now 0 1 3 5 6 7
 820 Error: popping token 'e' (<*>/<field2>/e printer)
 821 Stack now 0 1 3 5 6
 822 Error: popping token 'd' ('d' printer)
 823 Stack now 0 1 3 5
 824 Error: popping token 'c' ('c' printer)
 825 Stack now 0 1 3
 826 Error: popping token 'b' (<field1> printer)
 827 Stack now 0 1
 828 Error: popping token 'a' (<*>/<field2>/e printer)
 829 Stack now 0
 830 Cleanup: discarding lookahead token $end ()
 831 Stack now 0
 832 ]])
 833
 834 AT_CLEANUP
 835
 836
 837
 838 ## ------------------------------------------------------------- ##
 839 ## Default %printer and %destructor for user-defined end token.  ##
 840 ## ------------------------------------------------------------- ##
 841
 842 AT_SETUP([Default %printer and %destructor for user-defined end token])
 843
 844 # _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(TYPED)
 845 # -----------------------------------------------------------------------------
 846 m4_define([_AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN],
 847 [m4_if($1, 0,
 848   [m4_pushdef([kind], []) m4_pushdef([not_kind], [*])],
 849   [m4_pushdef([kind], [*]) m4_pushdef([not_kind], [])])
 850
 851 AT_DATA_GRAMMAR([[input]]$1[[.y]],
 852 [[%define parse.error verbose
 853 %debug
 854 %locations
 855 %initial-action {
 856   @$.first_line = @$.last_line = 1;
 857   @$.first_column = @$.last_column = 1;
 858 }
 859
 860 %{
 861 # include <stdio.h>
 862 # include <stdlib.h>
 863   static void yyerror (const char *msg);
 864   static int yylex (void);
 865 # define USE(SYM)
 866 %}
 867
 868 %destructor {
 869   fprintf (yyoutput, "<]]not_kind[[> destructor should not be called.\n");
 870 } <]]not_kind[[>
 871
 872 %token END 0
 873 %printer {
 874   fprintf (yyoutput, "<]]kind[[> for '%c' @ %d", $$, @$.first_column);
 875 } <]]kind[[>
 876 %destructor {
 877   fprintf (stdout, "<]]kind[[> for '%c' @ %d.\n", $$, @$.first_column);
 878 } <]]kind[[>
 879
 880 %printer {
 881   fprintf (yyoutput, "<]]not_kind[[> printer should not be called.\n");
 882 } <]]not_kind[[>
 883
 884 ]]m4_if($1, 0, [[[
 885 ]]],
 886 [[[%union { char tag; }
 887 %type <tag> start END]]])[[
 888
 889 %%
 890
 891 start: { $$ = 'S'; } ;
 892
 893 %%
 894
 895 static int
 896 yylex (void)
 897 {
 898   static int called;
 899   if (called++)
 900     abort ();
 901   yylval]]m4_if($1, 0,, [[[.tag]]])[[ = 'E';
 902   yylloc.first_line = yylloc.last_line = 1;
 903   yylloc.first_column = yylloc.last_column = 1;
 904   return 0;
 905 }
 906
 907 static void
 908 yyerror (const char *msg)
 909 {
 910   fprintf (stderr, "%s\n", msg);
 911 }
 912
 913 int
 914 main (void)
 915 {
 916   yydebug = 1;
 917   return yyparse ();
 918 }
 919 ]])
 920
 921 AT_BISON_CHECK([-o input$1.c input$1.y])
 922 AT_COMPILE([input$1])
 923 AT_PARSER_CHECK([./input$1], 0,
 924 [[<]]kind[[> for 'E' @ 1.
 925 <]]kind[[> for 'S' @ 1.
 926 ]],
 927 [[Starting parse
 928 Entering state 0
 929 Reducing stack by rule 1 (line 46):
 930 -> $$ = nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1)
 931 Stack now 0
 932 Entering state 1
 933 Reading a token: Now at end of input.
 934 Shifting token END (1.1-1.1: <]]kind[[> for 'E' @ 1)
 935 Entering state 2
 936 Stack now 0 1 2
 937 Cleanup: popping token END (1.1-1.1: <]]kind[[> for 'E' @ 1)
 938 Cleanup: popping nterm start (1.1-1.1: <]]kind[[> for 'S' @ 1)
 939 ]])
 940
 941 m4_popdef([kind])
 942 m4_popdef([not_kind])
 943 ])
 944
 945 _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(0)
 946 _AT_CHECK_DEFAULT_PRINTER_AND_DESTRUCTOR_FOR_END_TOKEN(1)
 947
 948 AT_CLEANUP
 949
 950
 951
 952 ## ------------------------------------------------------------------ ##
 953 ## Default %printer and %destructor are not for error or $undefined.  ##
 954 ## ------------------------------------------------------------------ ##
 955
 956 AT_SETUP([Default %printer and %destructor are not for error or $undefined])
 957
 958 # If Bison were to apply the default %printer and %destructor to the error
 959 # token or to $undefined:
 960 #   - For the error token:
 961 #     - It would generate warnings for unused $n.
 962 #     - It would invoke the %printer and %destructor on the error token's
 963 #       semantic value, which would be initialized from the lookahead, which
 964 #       would be destroyed separately.
 965 #   - For $undefined, who knows what the semantic value would be.
 966
 967 AT_DATA_GRAMMAR([[input.y]],
 968 [[%debug
 969
 970 %{
 971 # include <stdio.h>
 972 # include <stdlib.h>
 973   static void yyerror (const char *msg);
 974   static int yylex (void);
 975 # define USE(SYM)
 976 %}
 977
 978 %printer {
 979   fprintf (yyoutput, "'%c'", $$);
 980 } <> <*>
 981 %destructor {
 982   fprintf (stderr, "DESTROY '%c'\n", $$);
 983 } <> <*>
 984
 985 %%
 986
 987 start:
 988   { $$ = 'S'; }
 989   /* In order to reveal the problems that this bug caused during parsing, add
 990    * $2 to USE.  */
 991   | 'a' error 'b' 'c' { USE(($1, $3, $4)); $$ = 'S'; }
 992   ;
 993
 994 %%
 995
 996 static int
 997 yylex (void)
 998 {
 999   static char const input[] = "abd";
1000   static size_t toknum;
1001   if (! (toknum < sizeof input))
1002     abort ();
1003   yylval = input[toknum++];
1004   return yylval;
1005 }
1006
1007 static void
1008 yyerror (const char *msg)
1009 {
1010   fprintf (stderr, "%s\n", msg);
1011 }
1012
1013 int
1014 main (void)
1015 {
1016   yydebug = 1;
1017   return yyparse ();
1018 }
1019 ]])
1020
1021 AT_BISON_CHECK([-o input.c input.y])
1022 AT_COMPILE([input])
1023 AT_PARSER_CHECK([./input], [1], [],
1024 [[Starting parse
1025 Entering state 0
1026 Reading a token: Next token is token 'a' ('a')
1027 Shifting token 'a' ('a')
1028 Entering state 1
1029 Reading a token: Next token is token 'b' ('b')
1030 syntax error
1031 Shifting token error ()
1032 Entering state 3
1033 Next token is token 'b' ('b')
1034 Shifting token 'b' ('b')
1035 Entering state 5
1036 Reading a token: Next token is token $undefined ()
1037 Error: popping token 'b' ('b')
1038 DESTROY 'b'
1039 Stack now 0 1 3
1040 Error: popping token error ()
1041 Stack now 0 1
1042 Shifting token error ()
1043 Entering state 3
1044 Next token is token $undefined ()
1045 Error: discarding token $undefined ()
1046 Error: popping token error ()
1047 Stack now 0 1
1048 Shifting token error ()
1049 Entering state 3
1050 Reading a token: Now at end of input.
1051 Cleanup: discarding lookahead token $end ()
1052 Stack now 0 1 3
1053 Cleanup: popping token error ()
1054 Cleanup: popping token 'a' ('a')
1055 DESTROY 'a'
1056 ]])
1057
1058 AT_CLEANUP
1059
1060
1061
1062 ## ------------------------------------------------------ ##
1063 ## Default %printer and %destructor are not for $accept.  ##
1064 ## ------------------------------------------------------ ##
1065
1066 AT_SETUP([Default %printer and %destructor are not for $accept])
1067
1068 # If YYSTYPE is a union and Bison were to apply the default %printer and
1069 # %destructor to $accept:
1070 #   - The %printer and %destructor code generated for $accept would always be
1071 #     dead code because $accept is currently never shifted onto the stack.
1072 #   - $$ for $accept would always be of type YYSTYPE because it's not possible
1073 #     to declare `%type <field> $accept'.  (Also true for $undefined.)
1074 #   - Thus, the compiler might complain that the user code assumes the wrong
1075 #     type for $$ since the code might assume the type associated with a
1076 #     specific union field, which is especially reasonable in C++ since that
1077 #     type may be a base type.  This test case checks for this problem.  (Also
1078 #     true for $undefined and the error token, so there are three warnings for
1079 #     %printer and three for %destructor.)
1080
1081 AT_DATA_GRAMMAR([[input.y]],
1082 [[%debug /* So that %printer is actually compiled.  */
1083
1084 %{
1085 # include <stdio.h>
1086 # include <stdlib.h>
1087   static void yyerror (const char *msg);
1088   static int yylex (void);
1089 # define USE(SYM)
1090 %}
1091
1092 %printer {
1093   char chr = $$;
1094   fprintf (yyoutput, "'%c'", chr);
1095 } <> <*>
1096 %destructor {
1097   char chr = $$;
1098   fprintf (stderr, "DESTROY '%c'\n", chr);
1099 } <> <*>
1100
1101 %union { char chr; }
1102 %type <chr> start
1103
1104 %%
1105
1106 start: { USE($$); } ;
1107
1108 %%
1109
1110 static int
1111 yylex (void)
1112 {
1113   static int called;
1114   if (called++)
1115     abort ();
1116   return 0;
1117 }
1118
1119 static void
1120 yyerror (const char *msg)
1121 {
1122   fprintf (stderr, "%s\n", msg);
1123 }
1124
1125 int
1126 main (void)
1127 {
1128   return yyparse ();
1129 }
1130 ]])
1131
1132 AT_BISON_CHECK([-o input.c input.y])
1133 AT_COMPILE([input])
1134
1135 AT_CLEANUP
1136
1137
1138
1139 ## ------------------------------------------------------ ##
1140 ## Default %printer and %destructor for mid-rule values.  ##
1141 ## ------------------------------------------------------ ##
1142
1143 AT_SETUP([Default %printer and %destructor for mid-rule values])
1144
1145 AT_DATA_GRAMMAR([[input.y]],
1146 [[%debug /* So that %printer is actually compiled.  */
1147
1148 %{
1149 # include <stdio.h>
1150 # include <stdlib.h>
1151   static void yyerror (const char *msg);
1152   static int yylex (void);
1153 # define USE(SYM)
1154 # define YYLTYPE int
1155 # define YYLLOC_DEFAULT(Current, Rhs, N)
1156 # define YY_LOCATION_PRINT(File, Loc)
1157 %}
1158
1159 %printer { fprintf (yyoutput, "%d", @$); } <>
1160 %destructor { fprintf (stderr, "DESTROY %d\n", @$); } <>
1161 %printer { fprintf (yyoutput, "<*> printer should not be called"); } <*>
1162 %destructor { fprintf (yyoutput, "<*> destructor should not be called"); } <*>
1163
1164 %%
1165
1166 start:
1167   {           @$ = 1; } // Not set or used.
1168   { USE ($$); @$ = 2; } // Both set and used.
1169   { USE ($$); @$ = 3; } // Only set.
1170   {           @$ = 4; } // Only used.
1171   'c'
1172   { USE (($$, $2, $4, $5)); @$ = 0; }
1173   ;
1174
1175 %%
1176
1177 static int
1178 yylex (void)
1179 {
1180   static int called;
1181   if (called++)
1182     abort ();
1183   return 0;
1184 }
1185
1186 static void
1187 yyerror (const char *msg)
1188 {
1189   fprintf (stderr, "%s\n", msg);
1190 }
1191
1192 int
1193 main (void)
1194 {
1195   yydebug = 1;
1196   return yyparse ();
1197 }
1198 ]])
1199
1200 AT_BISON_CHECK([-o input.c input.y], 0,,
1201 [[input.y:33.3-23: warning: unset value: $$
1202 input.y:30.3-35.37: warning: unused value: $3
1203 ]])
1204
1205 AT_COMPILE([input])
1206 AT_PARSER_CHECK([./input], 1,,
1207 [[Starting parse
1208 Entering state 0
1209 Reducing stack by rule 1 (line 30):
1210 -> $$ = nterm $@1 (: )
1211 Stack now 0
1212 Entering state 2
1213 Reducing stack by rule 2 (line 31):
1214 -> $$ = nterm @2 (: 2)
1215 Stack now 0 2
1216 Entering state 4
1217 Reducing stack by rule 3 (line 32):
1218 -> $$ = nterm @3 (: 3)
1219 Stack now 0 2 4
1220 Entering state 5
1221 Reducing stack by rule 4 (line 33):
1222 -> $$ = nterm @4 (: 4)
1223 Stack now 0 2 4 5
1224 Entering state 6
1225 Reading a token: Now at end of input.
1226 syntax error
1227 Error: popping nterm @4 (: 4)
1228 DESTROY 4
1229 Stack now 0 2 4 5
1230 Error: popping nterm @3 (: 3)
1231 DESTROY 3
1232 Stack now 0 2 4
1233 Error: popping nterm @2 (: 2)
1234 DESTROY 2
1235 Stack now 0 2
1236 Error: popping nterm $@1 (: )
1237 Stack now 0
1238 Cleanup: discarding lookahead token $end (: )
1239 Stack now 0
1240 ]])
1241
1242 AT_CLEANUP
1243
1244
1245 ## ----------------------- ##
1246 ## @$ implies %locations.  ##
1247 ## ----------------------- ##
1248
1249 # Bison once forgot to check for @$ in actions other than semantic actions.
1250
1251 # AT_CHECK_ACTION_LOCATIONS(ACTION-DIRECTIVE)
1252 # -------------------------------------------------------
1253 m4_define([AT_CHECK_ACTION_LOCATIONS],
1254 [AT_SETUP([[@$ in ]$1[ implies %locations]])
1255
1256 AT_DATA_GRAMMAR([[input.y]],
1257 [[%code {
1258   #include <stdio.h>
1259   static int yylex (void);
1260   static void yyerror (char const *msg);
1261 }
1262
1263 %debug
1264
1265 ]$1[ {
1266   printf ("%d\n", @$.first_line);
1267 } ]m4_if($1, [%initial-action], [], [[start]])[
1268
1269 %%
1270
1271 start:  ;
1272
1273 %%
1274
1275 static int
1276 yylex (void)
1277 {
1278   return 0;
1279 }
1280
1281 static void
1282 yyerror (char const *msg)
1283 {
1284   fprintf (stderr, "%s\n", msg);
1285 }
1286
1287 int
1288 main (void)
1289 {
1290   return yyparse ();
1291 }
1292 ]])
1293
1294 AT_BISON_CHECK([[-o input.c input.y]])
1295 AT_COMPILE([[input]])
1296
1297 AT_CLEANUP])
1298
1299 AT_CHECK_ACTION_LOCATIONS([[%initial-action]])
1300 AT_CHECK_ACTION_LOCATIONS([[%destructor]])
1301 AT_CHECK_ACTION_LOCATIONS([[%printer]])
1302
1303
1304 ## ----------------------------------------------- ##
1305 ## Fix user actions without a trailing semicolon.  ##
1306 ## ----------------------------------------------- ##
1307
1308 AT_SETUP([[Fix user actions without a trailing semicolon]])
1309
1310 # This feature is undocumented, but we accidentally broke it in 2.3a,
1311 # and there was a complaint at:
1312 # <http://lists.gnu.org/archive/html/bug-bison/2008-11/msg00001.html>.
1313
1314 AT_DATA([input.y],
1315 [[%%
1316 start: test2 test1 test0 testc;
1317
1318 test2
1319 : 'a' { semi;                   /* TEST:N:2 */ }
1320 | 'b' { if (0) {no_semi}        /* TEST:N:2 */ }
1321 | 'c' { if (0) {semi;}          /* TEST:N:2 */ }
1322 | 'd' { semi;   no_semi         /* TEST:Y:2 */ }
1323 | 'e' { semi(); no_semi()       /* TEST:Y:2 */ }
1324 | 'f' { semi[]; no_semi[]       /* TEST:Y:2 */ }
1325 | 'g' { semi++; no_semi++       /* TEST:Y:2 */ }
1326 | 'h' { {no_semi} no_semi       /* TEST:Y:2 */ }
1327 | 'i' { {semi;}   no_semi       /* TEST:Y:2 */ }
1328 ;
1329 test1
1330   : 'a' { semi;                 // TEST:N:1 ;
1331 } | 'b' { if (0) {no_semi}      // TEST:N:1 ;
1332 } | 'c' { if (0) {semi;}        // TEST:N:1 ;
1333 } | 'd' { semi;   no_semi       // TEST:Y:1 ;
1334 } | 'e' { semi(); no_semi()     // TEST:Y:1 ;
1335 } | 'f' { semi[]; no_semi[]     // TEST:Y:1 ;
1336 } | 'g' { semi++; no_semi++     // TEST:Y:1 ;
1337 } | 'h' { {no_semi} no_semi     // TEST:Y:1 ;
1338 } | 'i' { {semi;}   no_semi     // TEST:Y:1 ;
1339 } ;
1340 test0
1341   : 'a' { semi;                 // TEST:N:1 {}
1342 } | 'b' { if (0) {no_semi}      // TEST:N:1 {}
1343 } | 'c' { if (0) {semi;}        // TEST:N:1 {}
1344 } | 'd' { semi;   no_semi       // TEST:Y:1 {}
1345 } | 'e' { semi(); no_semi()     // TEST:Y:1 {}
1346 } | 'f' { semi[]; no_semi[]     // TEST:Y:1 {}
1347 } | 'g' { semi++; no_semi++     // TEST:Y:1 {}
1348 } | 'h' { {no_semi} no_semi     // TEST:Y:1 {}
1349 } | 'i' { {semi;}   no_semi     // TEST:Y:1 {}
1350 } ;
1351
1352 testc
1353 : 'a' {
1354 #define TEST_MACRO_N \
1355 []"broken\" $ @ $$ @$ [];\
1356 string;"}
1357 | 'b' {
1358 no_semi
1359 #define TEST_MACRO_N \
1360 []"broken\" $ @ $$ @$ [];\
1361 string;"}
1362 ]])
1363
1364 AT_BISON_CHECK([[-o input.c input.y]], [0], [],
1365 [[input.y:8.48: warning: a `;' might be needed at the end of action code
1366 input.y:8.48: warning: future versions of Bison will not add the `;'
1367 input.y:9.48: warning: a `;' might be needed at the end of action code
1368 input.y:9.48: warning: future versions of Bison will not add the `;'
1369 input.y:10.48: warning: a `;' might be needed at the end of action code
1370 input.y:10.48: warning: future versions of Bison will not add the `;'
1371 input.y:11.48: warning: a `;' might be needed at the end of action code
1372 input.y:11.48: warning: future versions of Bison will not add the `;'
1373 input.y:12.48: warning: a `;' might be needed at the end of action code
1374 input.y:12.48: warning: future versions of Bison will not add the `;'
1375 input.y:13.48: warning: a `;' might be needed at the end of action code
1376 input.y:13.48: warning: future versions of Bison will not add the `;'
1377 input.y:20.1: warning: a `;' might be needed at the end of action code
1378 input.y:20.1: warning: future versions of Bison will not add the `;'
1379 input.y:21.1: warning: a `;' might be needed at the end of action code
1380 input.y:21.1: warning: future versions of Bison will not add the `;'
1381 input.y:22.1: warning: a `;' might be needed at the end of action code
1382 input.y:22.1: warning: future versions of Bison will not add the `;'
1383 input.y:23.1: warning: a `;' might be needed at the end of action code
1384 input.y:23.1: warning: future versions of Bison will not add the `;'
1385 input.y:24.1: warning: a `;' might be needed at the end of action code
1386 input.y:24.1: warning: future versions of Bison will not add the `;'
1387 input.y:25.1: warning: a `;' might be needed at the end of action code
1388 input.y:25.1: warning: future versions of Bison will not add the `;'
1389 input.y:31.1: warning: a `;' might be needed at the end of action code
1390 input.y:31.1: warning: future versions of Bison will not add the `;'
1391 input.y:32.1: warning: a `;' might be needed at the end of action code
1392 input.y:32.1: warning: future versions of Bison will not add the `;'
1393 input.y:33.1: warning: a `;' might be needed at the end of action code
1394 input.y:33.1: warning: future versions of Bison will not add the `;'
1395 input.y:34.1: warning: a `;' might be needed at the end of action code
1396 input.y:34.1: warning: future versions of Bison will not add the `;'
1397 input.y:35.1: warning: a `;' might be needed at the end of action code
1398 input.y:35.1: warning: future versions of Bison will not add the `;'
1399 input.y:36.1: warning: a `;' might be needed at the end of action code
1400 input.y:36.1: warning: future versions of Bison will not add the `;'
1401 ]])
1402
1403 AT_MATCHES_CHECK([input.c], [[/\* TEST:N:2 \*/ \}$]],       [[3]])
1404 AT_MATCHES_CHECK([input.c], [[/\* TEST:Y:2 \*/ ;\}$]],      [[6]])
1405 AT_MATCHES_CHECK([input.c], [[// TEST:N:1 [;{}]*\n\}$]],    [[6]])
1406 AT_MATCHES_CHECK([input.c], [[// TEST:Y:1 [;{}]*\n;\}$]],  [[12]])
1407 AT_MATCHES_CHECK([input.c], [[#define TEST_MACRO_N \\\n\[\]"broken\\" \$ \@ \$\$ \@\$ \[\];\\\nstring;"\}]], [[2]])
1408
1409 AT_CLEANUP
1410
1411
1412 ## -------------------------------------------------- ##
1413 ## Destroying lookahead assigned by semantic action.  ##
1414 ## -------------------------------------------------- ##
1415
1416 AT_SETUP([[Destroying lookahead assigned by semantic action]])
1417
1418 AT_DATA_GRAMMAR([input.y],
1419 [[
1420 %code {
1421   #include <assert.h>
1422   #include <stdio.h>
1423   static void yyerror (char const *);
1424   static int yylex (void);
1425   #define USE(Var)
1426 }
1427
1428 %destructor { fprintf (stderr, "'a' destructor\n"); } 'a'
1429 %destructor { fprintf (stderr, "'b' destructor\n"); } 'b'
1430
1431 %%
1432
1433 // In a previous version of Bison, yychar assigned by the semantic
1434 // action below was not translated into yytoken before the lookahead was
1435 // discarded and thus before its destructor (selected according to
1436 // yytoken) was called in order to return from yyparse.  This would
1437 // happen even if YYACCEPT was performed in a later semantic action as
1438 // long as only consistent states with default reductions were visited
1439 // in between.  However, we leave YYACCEPT in the same semantic action
1440 // for this test in order to show that skeletons cannot simply translate
1441 // immediately after every semantic action because a semantic action
1442 // that has set yychar might not always return normally.  Instead,
1443 // skeletons must translate before every use of yytoken.
1444 start: 'a' accept { USE($1); } ;
1445 accept: /*empty*/ {
1446   assert (yychar == YYEMPTY);
1447   yychar = 'b';
1448   YYACCEPT;
1449 } ;
1450
1451 %%
1452
1453 static void
1454 yyerror (char const *msg)
1455 {
1456   fprintf (stderr, "%s\n", msg);
1457 }
1458
1459 static int
1460 yylex (void)
1461 {
1462   static char const *input = "a";
1463   return *input++;
1464 }
1465
1466 int
1467 main (void)
1468 {
1469   return yyparse ();
1470 }
1471 ]])
1472
1473 AT_BISON_CHECK([[-o input.c input.y]])
1474 AT_COMPILE([[input]])
1475 AT_PARSER_CHECK([[./input]], [[0]], [],
1476 [['b' destructor
1477 'a' destructor
1478 ]])
1479
1480 AT_CLEANUP