tests/actions.at

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