tests/regression.at

   1 # Bison Regressions.                               -*- 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([[Regression tests.]])
  19
  20
  21 ## ------------------ ##
  22 ## Trivial grammars.  ##
  23 ## ------------------ ##
  24
  25 AT_SETUP([Trivial grammars])
  26
  27 AT_BISON_OPTION_PUSHDEFS
  28 AT_DATA_GRAMMAR([input.y],
  29 [[%{
  30 ]AT_YYERROR_DECLARE_EXTERN[
  31 ]AT_YYLEX_DECLARE_EXTERN[
  32 #define YYSTYPE int *
  33 %}
  34
  35 %error-verbose
  36
  37 %%
  38
  39 program: 'x';
  40 ]])
  41 AT_BISON_OPTION_POPDEFS
  42
  43 AT_BISON_CHECK([-o input.c input.y])
  44 AT_COMPILE([input.o], [-c input.c])
  45 AT_COMPILE([input.o], [-DYYDEBUG -c input.c])
  46
  47 AT_CLEANUP
  48
  49
  50
  51 ## ----------------- ##
  52 ## YYSTYPE typedef.  ##
  53 ## ----------------- ##
  54
  55 AT_SETUP([YYSTYPE typedef])
  56
  57 AT_BISON_OPTION_PUSHDEFS
  58 AT_DATA_GRAMMAR([input.y],
  59 [[%{
  60 ]AT_YYERROR_DECLARE_EXTERN[
  61 ]AT_YYLEX_DECLARE_EXTERN[
  62 typedef union { char const *val; } YYSTYPE;
  63 %}
  64
  65 %type <val> program
  66
  67 %%
  68
  69 program: { $$ = ""; };
  70 ]])
  71 AT_BISON_OPTION_POPDEFS
  72
  73 AT_BISON_CHECK([-o input.c input.y])
  74 AT_COMPILE([input.o], [-c input.c])
  75
  76 AT_CLEANUP
  77
  78
  79
  80 ## ------------------------------------- ##
  81 ## Early token definitions with --yacc.  ##
  82 ## ------------------------------------- ##
  83
  84
  85 AT_SETUP([Early token definitions with --yacc])
  86
  87 # Found in GCJ: they expect the tokens to be defined before the user
  88 # prologue, so that they can use the token definitions in it.
  89
  90 AT_BISON_OPTION_PUSHDEFS
  91 AT_DATA_GRAMMAR([input.y],
  92 [[%{
  93 ]AT_YYERROR_DECLARE_EXTERN[
  94 ]AT_YYLEX_DECLARE_EXTERN[
  95 %}
  96
  97 %union
  98 {
  99   int val;
 100 };
 101 %{
 102 #ifndef MY_TOKEN
 103 # error "MY_TOKEN not defined."
 104 #endif
 105 %}
 106 %token MY_TOKEN
 107 %%
 108 exp: MY_TOKEN;
 109 %%
 110 ]])
 111 AT_BISON_OPTION_POPDEFS
 112
 113 AT_BISON_CHECK([-y -o input.c input.y])
 114 AT_COMPILE([input.o], [-c input.c])
 115
 116 AT_CLEANUP
 117
 118
 119
 120 ## ---------------------------------------- ##
 121 ## Early token definitions without --yacc.  ##
 122 ## ---------------------------------------- ##
 123
 124
 125 AT_SETUP([Early token definitions without --yacc])
 126
 127 # Found in GCJ: they expect the tokens to be defined before the user
 128 # prologue, so that they can use the token definitions in it.
 129
 130 AT_BISON_OPTION_PUSHDEFS
 131 AT_DATA_GRAMMAR([input.y],
 132 [[%{
 133 #include <stdio.h>
 134 ]AT_YYERROR_DECLARE_EXTERN[
 135 ]AT_YYLEX_DECLARE_EXTERN[
 136 void print_my_token (void);
 137 %}
 138
 139 %union
 140 {
 141   int val;
 142 };
 143 %{
 144 void
 145 print_my_token (void)
 146 {
 147   enum yytokentype my_token = MY_TOKEN;
 148   printf ("%d\n", my_token);
 149 }
 150 %}
 151 %token MY_TOKEN
 152 %%
 153 exp: MY_TOKEN;
 154 %%
 155 ]])
 156 AT_BISON_OPTION_POPDEFS
 157
 158 AT_BISON_CHECK([-o input.c input.y])
 159 AT_COMPILE([input.o], [-c input.c])
 160
 161 AT_CLEANUP
 162
 163
 164
 165 ## ---------------- ##
 166 ## Braces parsing.  ##
 167 ## ---------------- ##
 168
 169
 170 AT_SETUP([Braces parsing])
 171
 172 AT_BISON_OPTION_PUSHDEFS
 173 AT_DATA([input.y],
 174 [[/* Bison used to swallow the character after '}'. */
 175
 176 %%
 177 exp: { tests = {{{{{{{{{{}}}}}}}}}}; };
 178 %%
 179 ]])
 180 AT_BISON_OPTION_POPDEFS
 181
 182 AT_BISON_CHECK([-v -o input.c input.y])
 183
 184 AT_CHECK([grep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore])
 185
 186 AT_CLEANUP
 187
 188
 189 ## ------------------ ##
 190 ## Duplicate string.  ##
 191 ## ------------------ ##
 192
 193
 194 AT_SETUP([Duplicate string])
 195
 196 AT_BISON_OPTION_PUSHDEFS
 197 AT_DATA([input.y],
 198 [[/* 'Bison -v' used to dump core when two tokens are defined with the same
 199    string, as LE and GE below. */
 200
 201 %token NUM
 202 %token LE "<="
 203 %token GE "<="
 204
 205 %%
 206 exp: '(' exp ')' | NUM ;
 207 %%
 208 ]])
 209 AT_BISON_OPTION_POPDEFS
 210
 211 AT_BISON_CHECK([-v -o input.c input.y], 0, [],
 212 [[input.y:6.8-14: warning: symbol "<=" used more than once as a literal string
 213 ]])
 214
 215 AT_CLEANUP
 216
 217
 218 ## ------------------- ##
 219 ## Rule Line Numbers.  ##
 220 ## ------------------- ##
 221
 222 AT_SETUP([Rule Line Numbers])
 223
 224 AT_KEYWORDS([report])
 225
 226 AT_BISON_OPTION_PUSHDEFS
 227 AT_DATA([input.y],
 228 [[%%
 229 expr:
 230 'a'
 231
 232 {
 233
 234 }
 235
 236 'b'
 237
 238 {
 239
 240 }
 241
 242 |
 243
 244
 245 {
 246
 247
 248 }
 249
 250 'c'
 251
 252 {
 253
 254 };
 255 ]])
 256 AT_BISON_OPTION_POPDEFS
 257
 258 AT_BISON_CHECK([-o input.c -v input.y])
 259
 260 # Check the contents of the report.
 261 AT_CHECK([cat input.output], [],
 262 [[Grammar
 263
 264     0 $accept: expr $end
 265
 266     1 $@1: /* empty */
 267
 268     2 expr: 'a' $@1 'b'
 269
 270     3 $@2: /* empty */
 271
 272     4 expr: $@2 'c'
 273
 274
 275 Terminals, with rules where they appear
 276
 277 $end (0) 0
 278 'a' (97) 2
 279 'b' (98) 2
 280 'c' (99) 4
 281 error (256)
 282
 283
 284 Nonterminals, with rules where they appear
 285
 286 $accept (6)
 287     on left: 0
 288 expr (7)
 289     on left: 2 4, on right: 0
 290 $@1 (8)
 291     on left: 1, on right: 2
 292 $@2 (9)
 293     on left: 3, on right: 4
 294
 295
 296 state 0
 297
 298     0 $accept: . expr $end
 299
 300     'a'  shift, and go to state 1
 301
 302     $default  reduce using rule 3 ($@2)
 303
 304     expr  go to state 2
 305     $@2   go to state 3
 306
 307
 308 state 1
 309
 310     2 expr: 'a' . $@1 'b'
 311
 312     $default  reduce using rule 1 ($@1)
 313
 314     $@1  go to state 4
 315
 316
 317 state 2
 318
 319     0 $accept: expr . $end
 320
 321     $end  shift, and go to state 5
 322
 323
 324 state 3
 325
 326     4 expr: $@2 . 'c'
 327
 328     'c'  shift, and go to state 6
 329
 330
 331 state 4
 332
 333     2 expr: 'a' $@1 . 'b'
 334
 335     'b'  shift, and go to state 7
 336
 337
 338 state 5
 339
 340     0 $accept: expr $end .
 341
 342     $default  accept
 343
 344
 345 state 6
 346
 347     4 expr: $@2 'c' .
 348
 349     $default  reduce using rule 4 (expr)
 350
 351
 352 state 7
 353
 354     2 expr: 'a' $@1 'b' .
 355
 356     $default  reduce using rule 2 (expr)
 357 ]])
 358
 359 AT_CLEANUP
 360
 361
 362
 363 ## ---------------------- ##
 364 ## Mixing %token styles.  ##
 365 ## ---------------------- ##
 366
 367
 368 AT_SETUP([Mixing %token styles])
 369
 370 # Taken from the documentation.
 371 AT_DATA([input.y],
 372 [[%token  <operator>  OR      "||"
 373 %token  <operator>  LE 134  "<="
 374 %left  OR  "<="
 375 %%
 376 exp: ;
 377 %%
 378 ]])
 379
 380 AT_BISON_CHECK([-v -o input.c input.y])
 381
 382 AT_CLEANUP
 383
 384
 385
 386 ## ---------------- ##
 387 ## Invalid inputs.  ##
 388 ## ---------------- ##
 389
 390
 391 AT_SETUP([Invalid inputs])
 392
 393 AT_DATA([input.y],
 394 [[%%
 395 ?
 396 default: 'a' }
 397 %&
 398 %a-does-not-exist
 399 %-
 400 %{
 401 ]])
 402
 403 AT_BISON_CHECK([input.y], [1], [],
 404 [[input.y:2.1: invalid character: '?'
 405 input.y:3.14: invalid character: '}'
 406 input.y:4.1: invalid character: '%'
 407 input.y:4.2: invalid character: '&'
 408 input.y:5.1-17: invalid directive: '%a-does-not-exist'
 409 input.y:6.1: invalid character: '%'
 410 input.y:6.2: invalid character: '-'
 411 input.y:7.1-8.0: missing '%}' at end of file
 412 input.y:7.1-8.0: syntax error, unexpected %{...%}
 413 ]])
 414
 415 AT_CLEANUP
 416
 417
 418 AT_SETUP([Invalid inputs with {}])
 419
 420 AT_DATA([input.y],
 421 [[
 422 %destructor
 423 %initial-action
 424 %lex-param
 425 %parse-param
 426 %printer
 427 %union
 428 ]])
 429
 430 AT_BISON_CHECK([input.y], [1], [],
 431 [[input.y:3.1-15: syntax error, unexpected %initial-action, expecting {...}
 432 ]])
 433
 434 AT_CLEANUP
 435
 436
 437
 438 ## ------------------- ##
 439 ## Token definitions.  ##
 440 ## ------------------- ##
 441
 442
 443 AT_SETUP([Token definitions])
 444
 445 AT_BISON_OPTION_PUSHDEFS
 446 # Bison managed, when fed with '%token 'f' "f"' to #define 'f'!
 447 AT_DATA_GRAMMAR([input.y],
 448 [%{
 449 #include <stdlib.h>
 450 #include <stdio.h>
 451 ]AT_YYERROR_DECLARE[
 452 ]AT_YYLEX_DECLARE[
 453 %}
 454 [%error-verbose
 455 %token MYEOF 0 "end of file"
 456 %token 'a' "a"
 457 %token B_TOKEN "b"
 458 %token C_TOKEN 'c'
 459 %token 'd' D_TOKEN
 460 %token SPECIAL "\\\'\?\"\a\b\f\n\r\t\v\001\201\x001\x000081??!"
 461 %token SPECIAL "\\\'\?\"\a\b\f\n\r\t\v\001\201\x001\x000081??!"
 462 %%
 463 exp: "a" "\\\'\?\"\a\b\f\n\r\t\v\001\201\x001\x000081??!";
 464 %%
 465 void
 466 yyerror (char const *s)
 467 {
 468   fprintf (stderr, "%s\n", s);
 469 }
 470
 471 int
 472 yylex (void)
 473 {
 474   static int called;
 475   if (called++)
 476     abort ();
 477   return SPECIAL;
 478 }
 479
 480 int
 481 main (void)
 482 {
 483   return yyparse ();
 484 }
 485 ]])
 486 AT_BISON_OPTION_POPDEFS
 487
 488 # Checking the warning message guarantees that the trigraph "??!" isn't
 489 # unnecessarily escaped here even though it would need to be if encoded in a
 490 # C-string literal.  Also notice that unnecessary escaping, such as "\?", from
 491 # the user specification is eliminated.
 492 AT_BISON_CHECK([-o input.c input.y], [[0]], [[]],
 493 [[input.y:22.8-14: warning: symbol SPECIAL redeclared
 494 input.y:22.8-63: warning: symbol "\\'?\"\a\b\f\n\r\t\v\001\201\001\201??!" used more than once as a literal string
 495 ]])
 496 AT_COMPILE([input])
 497
 498 # Checking the error message here guarantees that yytname, which does contain
 499 # C-string literals, does have the trigraph escaped correctly.  Thus, the
 500 # symbol name reported by the parser is exactly the same as that reported by
 501 # Bison itself.
 502 AT_DATA([experr],
 503 [[syntax error, unexpected "\\'?\"\a\b\f\n\r\t\v\001\201\001\201??!", expecting a
 504 ]])
 505 AT_PARSER_CHECK([./input], 1, [], [experr])
 506 AT_CLEANUP
 507
 508
 509
 510 ## -------------------- ##
 511 ## Characters Escapes.  ##
 512 ## -------------------- ##
 513
 514
 515 AT_SETUP([Characters Escapes])
 516
 517 AT_BISON_OPTION_PUSHDEFS
 518 AT_DATA_GRAMMAR([input.y],
 519 [%{
 520 ]AT_YYERROR_DECLARE_EXTERN[
 521 ]AT_YYLEX_DECLARE_EXTERN[
 522 %}
 523 [%%
 524 exp:
 525   '\'' "\'"
 526 | '\"' "\""
 527 | '"'  "'" /* Pacify font-lock-mode: ". */
 528 ;
 529 ]])
 530
 531 AT_BISON_OPTION_POPDEFS
 532
 533 AT_BISON_CHECK([-o input.c input.y])
 534 AT_COMPILE([input.o], [-c input.c])
 535 AT_CLEANUP
 536
 537
 538
 539 ## -------------- ##
 540 ## Web2c Report.  ##
 541 ## -------------- ##
 542
 543 # The generation of the reduction was once wrong in Bison, and made it
 544 # miss some reductions.  In the following test case, the reduction on
 545 # 'undef_id_tok' in state 1 was missing.  This is stripped down from
 546 # the actual web2c.y.
 547
 548 AT_SETUP([Web2c Report])
 549
 550 AT_KEYWORDS([report])
 551
 552 AT_DATA([input.y],
 553 [[%token        undef_id_tok const_id_tok
 554
 555 %start CONST_DEC_PART
 556 \f
 557 %%
 558 CONST_DEC_PART:
 559          CONST_DEC_LIST
 560         ;
 561
 562 CONST_DEC_LIST:
 563           CONST_DEC
 564         | CONST_DEC_LIST CONST_DEC
 565         ;
 566
 567 CONST_DEC:
 568           { } undef_id_tok '=' const_id_tok ';'
 569         ;
 570 %%
 571 ]])
 572
 573 AT_BISON_CHECK([-v input.y])
 574 AT_CHECK([cat input.output], 0,
 575 [[Grammar
 576
 577     0 $accept: CONST_DEC_PART $end
 578
 579     1 CONST_DEC_PART: CONST_DEC_LIST
 580
 581     2 CONST_DEC_LIST: CONST_DEC
 582     3               | CONST_DEC_LIST CONST_DEC
 583
 584     4 $@1: /* empty */
 585
 586     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok ';'
 587
 588
 589 Terminals, with rules where they appear
 590
 591 $end (0) 0
 592 ';' (59) 5
 593 '=' (61) 5
 594 error (256)
 595 undef_id_tok (258) 5
 596 const_id_tok (259) 5
 597
 598
 599 Nonterminals, with rules where they appear
 600
 601 $accept (7)
 602     on left: 0
 603 CONST_DEC_PART (8)
 604     on left: 1, on right: 0
 605 CONST_DEC_LIST (9)
 606     on left: 2 3, on right: 1 3
 607 CONST_DEC (10)
 608     on left: 5, on right: 2 3
 609 $@1 (11)
 610     on left: 4, on right: 5
 611
 612
 613 state 0
 614
 615     0 $accept: . CONST_DEC_PART $end
 616
 617     $default  reduce using rule 4 ($@1)
 618
 619     CONST_DEC_PART  go to state 1
 620     CONST_DEC_LIST  go to state 2
 621     CONST_DEC       go to state 3
 622     $@1             go to state 4
 623
 624
 625 state 1
 626
 627     0 $accept: CONST_DEC_PART . $end
 628
 629     $end  shift, and go to state 5
 630
 631
 632 state 2
 633
 634     1 CONST_DEC_PART: CONST_DEC_LIST .
 635     3 CONST_DEC_LIST: CONST_DEC_LIST . CONST_DEC
 636
 637     undef_id_tok  reduce using rule 4 ($@1)
 638     $default      reduce using rule 1 (CONST_DEC_PART)
 639
 640     CONST_DEC  go to state 6
 641     $@1        go to state 4
 642
 643
 644 state 3
 645
 646     2 CONST_DEC_LIST: CONST_DEC .
 647
 648     $default  reduce using rule 2 (CONST_DEC_LIST)
 649
 650
 651 state 4
 652
 653     5 CONST_DEC: $@1 . undef_id_tok '=' const_id_tok ';'
 654
 655     undef_id_tok  shift, and go to state 7
 656
 657
 658 state 5
 659
 660     0 $accept: CONST_DEC_PART $end .
 661
 662     $default  accept
 663
 664
 665 state 6
 666
 667     3 CONST_DEC_LIST: CONST_DEC_LIST CONST_DEC .
 668
 669     $default  reduce using rule 3 (CONST_DEC_LIST)
 670
 671
 672 state 7
 673
 674     5 CONST_DEC: $@1 undef_id_tok . '=' const_id_tok ';'
 675
 676     '='  shift, and go to state 8
 677
 678
 679 state 8
 680
 681     5 CONST_DEC: $@1 undef_id_tok '=' . const_id_tok ';'
 682
 683     const_id_tok  shift, and go to state 9
 684
 685
 686 state 9
 687
 688     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok . ';'
 689
 690     ';'  shift, and go to state 10
 691
 692
 693 state 10
 694
 695     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok ';' .
 696
 697     $default  reduce using rule 5 (CONST_DEC)
 698 ]])
 699
 700 AT_CLEANUP
 701
 702
 703 ## --------------- ##
 704 ## Web2c Actions.  ##
 705 ## --------------- ##
 706
 707 # The generation of the mapping 'state -> action' was once wrong in
 708 # extremely specific situations.  web2c.y exhibits this situation.
 709 # Below is a stripped version of the grammar.  It looks like one can
 710 # simplify it further, but just don't: it is tuned to exhibit a bug,
 711 # which disapears when applying sane grammar transformations.
 712 #
 713 # It used to be wrong on yydefact only:
 714 #
 715 # static const yytype_uint8 yydefact[] =
 716 #  {
 717 # -       2,     0,     1,     0,     0,     2,     3,     2,     5,     4,
 718 # +       2,     0,     1,     0,     0,     0,     3,     2,     5,     4,
 719 #         0,     0
 720 #  };
 721 #
 722 # but let's check all the tables.
 723
 724
 725 AT_SETUP([Web2c Actions])
 726
 727 AT_KEYWORDS([report])
 728
 729 AT_DATA([input.y],
 730 [[%%
 731 statement:  struct_stat;
 732 struct_stat:  /* empty. */ | if else;
 733 if: "if" "const" "then" statement;
 734 else: "else" statement;
 735 %%
 736 ]])
 737
 738 AT_BISON_CHECK([-v -o input.c input.y])
 739
 740 # Check only the tables.
 741 [sed -n 's/  *$//;/^static const.*\[\] =/,/^}/p' input.c >tables.c]
 742
 743 AT_CHECK([[cat tables.c]], 0,
 744 [[static const yytype_uint8 yytranslate[] =
 745 {
 746        0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 747        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 748        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 749        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 750        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 751        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 752        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 753        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 754        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 755        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 756        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 757        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 758        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 759        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 760        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 761        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 762        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 763        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 764        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 765        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 766        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 767        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 768        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 769        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 770        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 771        2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
 772        5,     6
 773 };
 774 static const yytype_uint8 yyrline[] =
 775 {
 776        0,     2,     2,     3,     3,     4,     5
 777 };
 778 static const char *const yytname[] =
 779 {
 780   "$end", "error", "$undefined", "\"if\"", "\"const\"", "\"then\"",
 781   "\"else\"", "$accept", "statement", "struct_stat", "if", "else", YY_NULL
 782 };
 783 static const yytype_uint16 yytoknum[] =
 784 {
 785        0,   256,   257,   258,   259,   260,   261
 786 };
 787 static const yytype_int8 yypact[] =
 788 {
 789       -2,    -1,     4,    -8,     0,     2,    -8,    -2,    -8,    -2,
 790       -8,    -8
 791 };
 792 static const yytype_uint8 yydefact[] =
 793 {
 794        3,     0,     0,     2,     0,     0,     1,     3,     4,     3,
 795        6,     5
 796 };
 797 static const yytype_int8 yypgoto[] =
 798 {
 799       -8,    -7,    -8,    -8,    -8
 800 };
 801 static const yytype_int8 yydefgoto[] =
 802 {
 803       -1,     2,     3,     4,     8
 804 };
 805 static const yytype_uint8 yytable[] =
 806 {
 807       10,     1,    11,     5,     6,     0,     7,     9
 808 };
 809 static const yytype_int8 yycheck[] =
 810 {
 811        7,     3,     9,     4,     0,    -1,     6,     5
 812 };
 813 static const yytype_uint8 yystos[] =
 814 {
 815        0,     3,     8,     9,    10,     4,     0,     6,    11,     5,
 816        8,     8
 817 };
 818 static const yytype_uint8 yyr1[] =
 819 {
 820        0,     7,     8,     9,     9,    10,    11
 821 };
 822 static const yytype_uint8 yyr2[] =
 823 {
 824        0,     2,     1,     0,     2,     4,     2
 825 };
 826 ]])
 827
 828 AT_CLEANUP
 829
 830
 831 ## ------------------------- ##
 832 ## yycheck Bound Violation.  ##
 833 ## ------------------------- ##
 834
 835
 836 # _AT_DATA_DANCER_Y(BISON-OPTIONS)
 837 # --------------------------------
 838 # The following grammar, taken from Andrew Suffield's GPL'd implementation
 839 # of DGMTP, the Dancer Generic Message Transport Protocol, used to violate
 840 # yycheck's bounds where issuing a verbose error message.  Keep this test
 841 # so that possible bound checking compilers could check all the skeletons.
 842 m4_define([_AT_DATA_DANCER_Y],
 843 [AT_DATA_GRAMMAR([dancer.y],
 844 [%{
 845 static int yylex (AT_LALR1_CC_IF([int *], [void]));
 846 AT_LALR1_CC_IF([#include <cstdlib>],
 847 [#include <stdlib.h>
 848 #include <stdio.h>
 849 ]AT_YYERROR_DECLARE[])
 850 %}
 851 $1
 852 %token ARROW INVALID NUMBER STRING DATA
 853 %defines
 854 %verbose
 855 %error-verbose
 856 /* Grammar follows */
 857 %%
 858 line: header body
 859    ;
 860
 861 header: '<' from ARROW to '>' type ':'
 862    | '<' ARROW to '>' type ':'
 863    | ARROW to type ':'
 864    | type ':'
 865    | '<' '>'
 866    ;
 867
 868 from: DATA
 869    | STRING
 870    | INVALID
 871    ;
 872
 873 to: DATA
 874    | STRING
 875    | INVALID
 876    ;
 877
 878 type: DATA
 879    | STRING
 880    | INVALID
 881    ;
 882
 883 body: /* empty */
 884    | body member
 885    ;
 886
 887 member: STRING
 888    | DATA
 889    | '+' NUMBER
 890    | '-' NUMBER
 891    | NUMBER
 892    | INVALID
 893    ;
 894 %%
 895 AT_LALR1_CC_IF(
 896 [/* A C++ error reporting function. */
 897 void
 898 yy::parser::error (const std::string& m)
 899 {
 900   std::cerr << m << std::endl;
 901 }
 902
 903 int
 904 yyparse ()
 905 {
 906   yy::parser parser;
 907 #if YYDEBUG
 908   parser.set_debug_level (YYDEBUG);
 909 #endif
 910   return parser.parse ();
 911 }
 912 ],
 913 [static void
 914 yyerror (const char *s)
 915 {
 916   fprintf (stderr, "%s\n", s);
 917 }])
 918
 919 static int
 920 yylex (AT_LALR1_CC_IF([int *lval], [void]))
 921 [{
 922   static int const tokens[] =
 923     {
 924       ':', -1
 925     };
 926   static size_t toknum;
 927   ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC.  */])[
 928   if (! (toknum < sizeof tokens / sizeof *tokens))
 929     abort ();
 930   return tokens[toknum++];
 931 }]
 932
 933 int
 934 main (void)
 935 {
 936   return yyparse ();
 937 }
 938 ])
 939 ])# _AT_DATA_DANCER_Y
 940
 941
 942 # AT_CHECK_DANCER(BISON-OPTIONS)
 943 # ------------------------------
 944 # Generate the grammar, compile it, run it.
 945 m4_define([AT_CHECK_DANCER],
 946 [AT_SETUP([Dancer $1])
 947 AT_BISON_OPTION_PUSHDEFS([$1])
 948 _AT_DATA_DANCER_Y([$1])
 949 AT_BISON_CHECK([-o dancer.c dancer.y])
 950 AT_FULL_COMPILE([dancer])
 951 AT_PARSER_CHECK([./dancer], 1, [],
 952 [syntax error, unexpected ':'
 953 ])
 954 AT_BISON_OPTION_POPDEFS
 955 AT_CLEANUP
 956 ])
 957
 958 AT_CHECK_DANCER()
 959 AT_CHECK_DANCER([%glr-parser])
 960 AT_CHECK_DANCER([%skeleton "lalr1.cc"])
 961
 962
 963 ## ------------------------------------------ ##
 964 ## Diagnostic that expects two alternatives.  ##
 965 ## ------------------------------------------ ##
 966
 967
 968 # _AT_DATA_EXPECT2_Y(BISON-OPTIONS)
 969 # --------------------------------
 970 m4_define([_AT_DATA_EXPECT2_Y],
 971 [AT_DATA_GRAMMAR([expect2.y],
 972 [%{
 973 static int yylex (AT_LALR1_CC_IF([int *], [void]));
 974 AT_LALR1_CC_IF([[#include <cstdlib>]],
 975 [[#include <stdlib.h>
 976 #include <stdio.h>
 977 ]AT_YYERROR_DECLARE])[
 978 %}
 979 $1
 980 %defines
 981 %error-verbose
 982 %token A 1000
 983 %token B
 984
 985 %%
 986 program: /* empty */
 987  | program e ';'
 988  | program error ';';
 989
 990 e: e '+' t | t;
 991 t: A | B;
 992
 993 %%
 994 ]AT_YYERROR_DEFINE[
 995 ]AT_LALR1_CC_IF(
 996 [int
 997 yyparse ()
 998 {
 999   yy::parser parser;
1000   return parser.parse ();
1001 }
1002 ])[
1003
1004 static int
1005 yylex (]AT_LALR1_CC_IF([int *lval], [void])[)
1006 {
1007   static int const tokens[] =
1008     {
1009       1000, '+', '+', -1
1010     };
1011   static size_t toknum;
1012   ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC.  */])[
1013   if (! (toknum < sizeof tokens / sizeof *tokens))
1014     abort ();
1015   return tokens[toknum++];
1016 }
1017
1018 int
1019 main (void)
1020 {
1021   return yyparse ();
1022 }
1023 ]])
1024 ])# _AT_DATA_EXPECT2_Y
1025
1026
1027 # AT_CHECK_EXPECT2(BISON-OPTIONS)
1028 # -------------------------------
1029 # Generate the grammar, compile it, run it.
1030 m4_define([AT_CHECK_EXPECT2],
1031 [AT_SETUP([Expecting two tokens $1])
1032 AT_BISON_OPTION_PUSHDEFS([$1])
1033 _AT_DATA_EXPECT2_Y([$1])
1034 AT_BISON_CHECK([-o expect2.c expect2.y])
1035 AT_FULL_COMPILE([expect2])
1036 AT_PARSER_CHECK([./expect2], 1, [],
1037 [syntax error, unexpected '+', expecting A or B
1038 ])
1039 AT_BISON_OPTION_POPDEFS
1040 AT_CLEANUP
1041 ])
1042
1043 AT_CHECK_EXPECT2()
1044 AT_CHECK_EXPECT2([%glr-parser])
1045 AT_CHECK_EXPECT2([%skeleton "lalr1.cc"])
1046
1047
1048
1049 ## --------------------------------------------- ##
1050 ## Braced code in declaration in rules section.  ##
1051 ## --------------------------------------------- ##
1052
1053 AT_SETUP([Braced code in declaration in rules section])
1054
1055 # Bison once mistook braced code in a declaration in the rules section to be a
1056 # rule action.
1057 AT_BISON_OPTION_PUSHDEFS
1058 AT_DATA_GRAMMAR([input.y],
1059 [[%{
1060 #include <stdio.h>
1061 ]AT_YYERROR_DECLARE[
1062 ]AT_YYLEX_DECLARE[
1063 %}
1064
1065 %error-verbose
1066
1067 %%
1068
1069 start:
1070   {
1071     printf ("Bison would once convert this action to a midrule because of the"
1072             " subsequent braced code.\n");
1073   }
1074   ;
1075
1076 %destructor { fprintf (stderr, "DESTRUCTOR\n"); } 'a';
1077 %printer { fprintf (yyoutput, "PRINTER"); } 'a';
1078
1079 %%
1080
1081 ]AT_YYERROR_DEFINE[
1082 static int
1083 yylex (void)
1084 {
1085   return 'a';
1086 }
1087
1088 int
1089 main (void)
1090 {
1091   yydebug = 1;
1092   return !yyparse ();
1093 }
1094 ]])
1095 AT_BISON_OPTION_POPDEFS
1096
1097 AT_BISON_CHECK([-t -o input.c input.y])
1098 AT_COMPILE([input])
1099 AT_PARSER_CHECK([./input], 0,
1100 [[Bison would once convert this action to a midrule because of the subsequent braced code.
1101 ]],
1102 [[Starting parse
1103 Entering state 0
1104 Reducing stack by rule 1 (line 20):
1105 -> $$ = nterm start ()
1106 Stack now 0
1107 Entering state 1
1108 Reading a token: Next token is token 'a' (PRINTER)
1109 syntax error, unexpected 'a', expecting $end
1110 Error: popping nterm start ()
1111 Stack now 0
1112 Cleanup: discarding lookahead token 'a' (PRINTER)
1113 DESTRUCTOR
1114 Stack now 0
1115 ]])
1116
1117 AT_CLEANUP
1118
1119
1120
1121 ## --------------------------------- ##
1122 ## String alias declared after use.  ##
1123 ## --------------------------------- ##
1124
1125 AT_SETUP([String alias declared after use])
1126
1127 # Bison once incorrectly asserted that the symbol number for either a token or
1128 # its alias was the highest symbol number so far at the point of the alias
1129 # declaration.  That was true unless the declaration appeared after their first
1130 # uses and other tokens appeared in between.
1131
1132 AT_DATA([input.y],
1133 [[%%
1134 start: 'a' "A" 'b';
1135 %token 'a' "A";
1136 ]])
1137
1138 AT_BISON_CHECK([-t -o input.c input.y])
1139
1140 AT_CLEANUP
1141
1142
1143
1144 ## -------------------------------- ##
1145 ## Extra lookahead sets in report.  ##
1146 ## -------------------------------- ##
1147
1148 AT_SETUP([[Extra lookahead sets in report]])
1149
1150 # Bison prints each reduction's lookahead set only next to the associated
1151 # state's one item that (1) is associated with the same rule as the reduction
1152 # and (2) has its dot at the end of its RHS.  Previously, Bison also
1153 # erroneously printed the lookahead set next to all of the state's other items
1154 # associated with the same rule.  This bug affected only the '.output' file and
1155 # not the generated parser source code.
1156
1157 AT_DATA([[input.y]],
1158 [[%%
1159 start: a | 'a' a 'a' ;
1160 a: 'a' ;
1161 ]])
1162
1163 AT_BISON_CHECK([[--report=all input.y]])
1164 AT_CHECK([[sed -n '/^state 1$/,/^state 2$/p' input.output]], [[0]],
1165 [[state 1
1166
1167     2 start: 'a' . a 'a'
1168     3 a: . 'a'
1169     3  | 'a' .  [$end]
1170
1171     'a'  shift, and go to state 4
1172
1173     $default  reduce using rule 3 (a)
1174
1175     a  go to state 5
1176
1177
1178 state 2
1179 ]])
1180
1181 AT_CLEANUP
1182
1183
1184
1185 ## ---------------------------------------- ##
1186 ## Token number in precedence declaration.  ##
1187 ## ---------------------------------------- ##
1188
1189 AT_SETUP([[Token number in precedence declaration]])
1190
1191 # POSIX says token numbers can be declared in %left, %right, and %nonassoc, but
1192 # we lost this in Bison 1.50.
1193 AT_BISON_OPTION_PUSHDEFS
1194 AT_DATA_GRAMMAR([input.y],
1195 [[%{
1196   #include <stdio.h>
1197   ]AT_YYERROR_DECLARE[
1198   ]AT_YYLEX_DECLARE[
1199 %}
1200
1201 %error-verbose
1202 %right END 0
1203 %left TK1 1 TK2 2 "tok alias" 3
1204
1205 %%
1206
1207 start:
1208     TK1 sr_conflict "tok alias"
1209   | start %prec END
1210   ;
1211 sr_conflict:
1212   TK2
1213   | TK2 "tok alias"
1214   ;
1215
1216 %%
1217
1218 ]AT_YYERROR_DEFINE[
1219 int
1220 yylex (void)
1221 {
1222   static int const input[] = { 1, 2, 3, 0 };
1223   static int const *inputp = input;
1224   return *inputp++;
1225 }
1226
1227 int
1228 main (void)
1229 {
1230   return yyparse ();
1231 }
1232 ]])
1233 AT_BISON_OPTION_POPDEFS
1234
1235 AT_BISON_CHECK([[-o input.c input.y]], [[0]],,
1236 [[input.y:23.5-19: warning: rule useless in parser due to conflicts: start: start
1237 input.y:27.5-19: warning: rule useless in parser due to conflicts: sr_conflict: TK2 "tok alias"
1238 ]])
1239 AT_COMPILE([[input]])
1240 AT_PARSER_CHECK([[./input]])
1241
1242 AT_CLEANUP
1243
1244
1245
1246 ## --------------------------- ##
1247 ## parse-gram.y: LALR = IELR.  ##
1248 ## --------------------------- ##
1249
1250 # If parse-gram.y's LALR and IELR parser tables ever begin to differ, we
1251 # need to fix parse-gram.y or start using IELR.
1252
1253 AT_SETUP([[parse-gram.y: LALR = IELR]])
1254
1255 # Avoid tests/bison's dark magic by processing a local copy of the
1256 # grammar.  Avoid differences in synclines by telling bison that the
1257 # output files have the same name.
1258 [cp $abs_top_srcdir/src/parse-gram.y input.y]
1259 AT_BISON_CHECK([[-o input.c -Dlr.type=lalr input.y]])
1260 [mv input.c lalr.c]
1261 AT_CAPTURE_FILE([lalr.c])
1262 AT_BISON_CHECK([[-o input.c -Dlr.type=ielr input.y]])
1263 [mv input.c ielr.c]
1264 AT_CAPTURE_FILE([ielr.c])
1265 AT_CHECK([[diff lalr.c ielr.c]], [[0]])
1266
1267 AT_CLEANUP
1268
1269
1270
1271 ## -------------------------------------------- ##
1272 ## parse.error=verbose and YYSTACK_USE_ALLOCA.  ##
1273 ## -------------------------------------------- ##
1274
1275 AT_SETUP([[parse.error=verbose and YYSTACK_USE_ALLOCA]])
1276
1277 AT_BISON_OPTION_PUSHDEFS
1278 AT_DATA_GRAMMAR([input.y],
1279 [[%code {
1280   #include <stdio.h>
1281   ]AT_YYERROR_DECLARE[
1282   ]AT_YYLEX_DECLARE[
1283   #define YYSTACK_USE_ALLOCA 1
1284 }
1285
1286 %define parse.error verbose
1287
1288 %%
1289
1290 start: check syntax_error syntax_error ;
1291
1292 check:
1293 {
1294   if (128 < sizeof yymsgbuf)
1295     {
1296       fprintf (stderr,
1297                "The initial size of yymsgbuf in yyparse has increased\n"
1298                "since this test group was last updated.  As a result,\n"
1299                "this test group may no longer manage to induce a\n"
1300                "reallocation of the syntax error message buffer.\n"
1301                "This test group must be adjusted to produce a longer\n"
1302                "error message.\n");
1303       YYABORT;
1304     }
1305 }
1306 ;
1307
1308 // Induce a syntax error message whose total length is more than
1309 // sizeof yymsgbuf in yyparse.  Each token here is 64 bytes.
1310 syntax_error:
1311   "123456789112345678921234567893123456789412345678951234567896123A"
1312 | "123456789112345678921234567893123456789412345678951234567896123B"
1313 | error 'a' 'b' 'c'
1314 ;
1315
1316 %%
1317
1318 ]AT_YYERROR_DEFINE[
1319   /* Induce two syntax error messages (which requires full error
1320      recovery by shifting 3 tokens) in order to detect any loss of the
1321      reallocated buffer.  */
1322 ]AT_YYLEX_DEFINE([abc])[
1323 int
1324 main (void)
1325 {
1326   return yyparse ();
1327 }
1328 ]])
1329 AT_BISON_OPTION_POPDEFS
1330
1331 AT_BISON_CHECK([[-o input.c input.y]])
1332 AT_COMPILE([[input]])
1333 AT_PARSER_CHECK([[./input]], [[1]], [],
1334 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1335 syntax error, unexpected $end, expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1336 ]])
1337
1338 AT_CLEANUP
1339
1340
1341
1342 ## ------------------------------ ##
1343 ## parse.error=verbose overflow.  ##
1344 ## ------------------------------ ##
1345
1346 # Imagine the case where YYSTACK_ALLOC_MAXIMUM = YYSIZE_MAXIMUM and an
1347 # invocation of yysyntax_error has caused yymsg_alloc to grow to exactly
1348 # YYSTACK_ALLOC_MAXIMUM (perhaps because the normal doubling of size had
1349 # to be clipped to YYSTACK_ALLOC_MAXIMUM).  In an old version of yacc.c,
1350 # a subsequent invocation of yysyntax_error that overflows during its
1351 # size calculation would return YYSIZE_MAXIMUM to yyparse.  Then,
1352 # yyparse would invoke yyerror using the old contents of yymsg.
1353
1354 AT_SETUP([[parse.error=verbose overflow]])
1355
1356 AT_BISON_OPTION_PUSHDEFS
1357 AT_DATA_GRAMMAR([input.y],
1358 [[%code {
1359   #include <stdio.h>
1360   ]AT_YYERROR_DECLARE[
1361   ]AT_YYLEX_DECLARE[
1362
1363   /* This prevents this test case from having to induce error messages
1364      large enough to overflow size_t.  */
1365   #define YYSIZE_T unsigned char
1366
1367   /* Bring in malloc and set EXIT_SUCCESS so yacc.c doesn't try to
1368      provide a malloc prototype using our YYSIZE_T.  */
1369   #include <stdlib.h>
1370   #ifndef EXIT_SUCCESS
1371   # define EXIT_SUCCESS 0
1372   #endif
1373
1374   /* Max depth is usually much smaller than YYSTACK_ALLOC_MAXIMUM, and
1375      we don't want gcc to warn everywhere this constant would be too big
1376      to make sense for our YYSIZE_T.  */
1377   #define YYMAXDEPTH 100
1378 }
1379
1380 %define parse.error verbose
1381
1382 %%
1383
1384 start: syntax_error1 check syntax_error2 ;
1385
1386 // Induce a syntax error message whose total length causes yymsg in
1387 // yyparse to be reallocated to size YYSTACK_ALLOC_MAXIMUM, which
1388 // should be 255.  Each token here is 64 bytes.
1389 syntax_error1:
1390   "123456789112345678921234567893123456789412345678951234567896123A"
1391 | "123456789112345678921234567893123456789412345678951234567896123B"
1392 | "123456789112345678921234567893123456789412345678951234567896123C"
1393 | error 'a' 'b' 'c'
1394 ;
1395
1396 check:
1397 {
1398   if (yymsg_alloc != YYSTACK_ALLOC_MAXIMUM
1399       || YYSTACK_ALLOC_MAXIMUM != YYSIZE_MAXIMUM
1400       || YYSIZE_MAXIMUM != 255)
1401     {
1402       fprintf (stderr,
1403                "The assumptions of this test group are no longer\n"
1404                "valid, so it may no longer catch the error it was\n"
1405                "designed to catch.  Specifically, the following\n"
1406                "values should all be 255:\n\n");
1407       fprintf (stderr, "  yymsg_alloc = %d\n", yymsg_alloc);
1408       fprintf (stderr, "  YYSTACK_ALLOC_MAXIMUM = %d\n",
1409                YYSTACK_ALLOC_MAXIMUM);
1410       fprintf (stderr, "  YYSIZE_MAXIMUM = %d\n", YYSIZE_MAXIMUM);
1411       YYABORT;
1412     }
1413 }
1414 ;
1415
1416 // Now overflow.
1417 syntax_error2:
1418   "123456789112345678921234567893123456789412345678951234567896123A"
1419 | "123456789112345678921234567893123456789412345678951234567896123B"
1420 | "123456789112345678921234567893123456789412345678951234567896123C"
1421 | "123456789112345678921234567893123456789412345678951234567896123D"
1422 | "123456789112345678921234567893123456789412345678951234567896123E"
1423 ;
1424
1425 %%
1426
1427 ]AT_YYERROR_DEFINE[
1428   /* Induce two syntax error messages (which requires full error
1429      recovery by shifting 3 tokens).  */
1430 ]AT_YYLEX_DEFINE([abc])[
1431 int
1432 main (void)
1433 {
1434   /* Push parsers throw away the message buffer between tokens, so skip
1435      this test under maintainer-push-check.  */
1436   if (YYPUSH)
1437     return 77;
1438   return yyparse ();
1439 }
1440 ]])
1441
1442 AT_BISON_CHECK([[-o input.c input.y]])
1443
1444 # gcc warns about tautologies and fallacies involving comparisons for
1445 # unsigned char.  However, it doesn't produce these same warnings for
1446 # size_t and many other types when the warnings would seem to make just
1447 # as much sense.  We ignore the warnings.
1448 [CFLAGS="$NO_WERROR_CFLAGS"]
1449 AT_COMPILE([[input]])
1450
1451 AT_PARSER_CHECK([[./input]], [[2]], [],
1452 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B or 123456789112345678921234567893123456789412345678951234567896123C
1453 syntax error
1454 memory exhausted
1455 ]])
1456 AT_BISON_OPTION_POPDEFS
1457 AT_CLEANUP
1458
1459
1460
1461 ## ------------------------ ##
1462 ## LAC: Exploratory stack.  ##
1463 ## ------------------------ ##
1464
1465 AT_SETUP([[LAC: Exploratory stack]])
1466
1467 m4_pushdef([AT_LAC_CHECK], [
1468
1469 AT_BISON_OPTION_PUSHDEFS([$1])
1470
1471 AT_DATA_GRAMMAR([input.y],
1472 [[%code {
1473   #include <stdio.h>
1474   ]AT_YYERROR_DECLARE[
1475   int yylex (]AT_PURE_IF([[YYSTYPE *]], [[void]])[);
1476 }
1477
1478 ]$1[
1479 %define parse.error verbose
1480 %token 'c'
1481
1482 %%
1483
1484 // default reductions in inconsistent states
1485 // v   v v   v v v v   v v v v v v v
1486 S: A B A A B A A A A B A A A A A A A B C C A A A A A A A A A A A A B ;
1487 //       ^                     ^                               ^
1488 // LAC reallocs
1489
1490 A: 'a' | /*empty*/ { printf ("inconsistent default reduction\n"); } ;
1491 B: 'b' ;
1492 C: /*empty*/ { printf ("consistent default reduction\n"); } ;
1493
1494 %%
1495 ]AT_YYERROR_DEFINE[
1496 int
1497 yylex (]AT_PURE_IF([[YYSTYPE *v]], [[void]])[)
1498 {
1499   static char const *input = "bbbbc";]AT_PURE_IF([[
1500   *v = 0;]])[
1501   return *input++;
1502 }
1503
1504 int
1505 main (void)
1506 {
1507   yydebug = 1;
1508   return yyparse ();
1509 }
1510 ]])
1511
1512 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1513                  -Dparse.lac.memory-trace=full \
1514                  -t -o input.c input.y]], [[0]], [],
1515 [[input.y: conflicts: 21 shift/reduce
1516 ]])
1517 AT_COMPILE([[input]])
1518 AT_PARSER_CHECK([[./input > stdout.txt 2> stderr.txt]], [[1]])
1519
1520 # Make sure syntax error doesn't forget that 'a' is expected.  It would
1521 # be forgotten without lookahead correction.
1522 AT_CHECK([[grep 'syntax error,' stderr.txt]], [[0]],
1523 [[syntax error, unexpected 'c', expecting 'a' or 'b'
1524 ]])
1525
1526 # Check number of default reductions in inconsistent states to be sure
1527 # syntax error is detected before unnecessary reductions are performed.
1528 AT_CHECK([[perl -0777 -ne 'print s/inconsistent default reduction//g;' \
1529            < stdout.txt || exit 77]], [[0]], [[14]])
1530
1531 # Check number of default reductions in consistent states to be sure
1532 # it is performed before the syntax error is detected.
1533 AT_CHECK([[perl -0777 -ne 'print s/\bconsistent default reduction//g;' \
1534            < stdout.txt || exit 77]], [[0]], [[2]])
1535
1536 # Check number of reallocs to be sure reallocated memory isn't somehow
1537 # lost between LAC invocations.
1538 AT_CHECK([[perl -0777 -ne 'print s/\(realloc//g;' < stderr.txt \
1539            || exit 77]], [[0]], [[3]])
1540
1541 AT_BISON_OPTION_POPDEFS
1542 ])
1543
1544 AT_LAC_CHECK([[%define api.push-pull pull]])
1545 AT_LAC_CHECK([[%define api.push-pull pull %define api.pure]])
1546 AT_LAC_CHECK([[%define api.push-pull both]])
1547 AT_LAC_CHECK([[%define api.push-pull both %define api.pure]])
1548
1549 m4_popdef([AT_LAC_CHECK])
1550
1551 AT_CLEANUP
1552
1553
1554
1555 ## ------------------------ ##
1556 ## LAC: Memory exhaustion.  ##
1557 ## ------------------------ ##
1558
1559 AT_SETUP([[LAC: Memory exhaustion]])
1560
1561 m4_pushdef([AT_LAC_CHECK],
1562 [AT_BISON_OPTION_PUSHDEFS
1563 AT_DATA_GRAMMAR([input.y],
1564 [[%code {
1565   #include <stdio.h>
1566   ]AT_YYERROR_DECLARE[
1567   ]AT_YYLEX_DECLARE[
1568   #define YYMAXDEPTH 8
1569 }
1570
1571 %error-verbose
1572
1573 %%
1574
1575 S: A A A A A A A A A ;
1576 A: /*empty*/ | 'a' ;
1577
1578 %%
1579 ]AT_YYERROR_DEFINE[
1580 ]AT_YYLEX_DEFINE([$1])[
1581 int
1582 main (void)
1583 {
1584   yydebug = 1;
1585   return yyparse ();
1586 }
1587 ]])
1588
1589 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1590                  -t -o input.c input.y]], [[0]], [],
1591 [[input.y: conflicts: 8 shift/reduce
1592 ]])
1593 AT_COMPILE([[input]])
1594 AT_BISON_OPTION_POPDEFS
1595 ])
1596
1597 # Check for memory exhaustion during parsing.
1598 AT_LAC_CHECK([])
1599 AT_PARSER_CHECK([[./input]], [[2]], [],
1600 [[Starting parse
1601 Entering state 0
1602 Reading a token: Now at end of input.
1603 LAC: initial context established for $end
1604 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1605 memory exhausted
1606 Cleanup: discarding lookahead token $end ()
1607 Stack now 0
1608 ]])
1609
1610 # Induce an immediate syntax error with an undefined token, and check
1611 # for memory exhaustion while building syntax error message.
1612 AT_LAC_CHECK([z], [[0]])
1613 AT_PARSER_CHECK([[./input]], [[2]], [],
1614 [[Starting parse
1615 Entering state 0
1616 Reading a token: Next token is token $undefined ()
1617 LAC: initial context established for $undefined
1618 LAC: checking lookahead $undefined: Always Err
1619 Constructing syntax error message
1620 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1621 syntax error
1622 memory exhausted
1623 Cleanup: discarding lookahead token $undefined ()
1624 Stack now 0
1625 ]])
1626
1627 m4_popdef([AT_LAC_CHECK])
1628
1629 AT_CLEANUP