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])
  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])
  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])
 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])
 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 ]AT_YYERROR_DEFINE[
 466
 467 int
 468 yylex (void)
 469 {
 470   static int called;
 471   if (called++)
 472     abort ();
 473   return SPECIAL;
 474 }
 475
 476 int
 477 main (void)
 478 {
 479   return yyparse ();
 480 }
 481 ]])
 482 AT_BISON_OPTION_POPDEFS
 483
 484 # Checking the warning message guarantees that the trigraph "??!" isn't
 485 # unnecessarily escaped here even though it would need to be if encoded in a
 486 # C-string literal.  Also notice that unnecessary escaping, such as "\?", from
 487 # the user specification is eliminated.
 488 AT_BISON_CHECK([-o input.c input.y], [[0]], [[]],
 489 [[input.y:22.8-14: warning: symbol SPECIAL redeclared
 490 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
 491 ]])
 492 AT_COMPILE([input])
 493
 494 # Checking the error message here guarantees that yytname, which does contain
 495 # C-string literals, does have the trigraph escaped correctly.  Thus, the
 496 # symbol name reported by the parser is exactly the same as that reported by
 497 # Bison itself.
 498 AT_DATA([experr],
 499 [[syntax error, unexpected "\\'?\"\a\b\f\n\r\t\v\001\201\001\201??!", expecting a
 500 ]])
 501 AT_PARSER_CHECK([./input], 1, [], [experr])
 502 AT_CLEANUP
 503
 504
 505
 506 ## -------------------- ##
 507 ## Characters Escapes.  ##
 508 ## -------------------- ##
 509
 510
 511 AT_SETUP([Characters Escapes])
 512
 513 AT_BISON_OPTION_PUSHDEFS
 514 AT_DATA_GRAMMAR([input.y],
 515 [%{
 516 ]AT_YYERROR_DECLARE_EXTERN[
 517 ]AT_YYLEX_DECLARE_EXTERN[
 518 %}
 519 [%%
 520 exp:
 521   '\'' "\'"
 522 | '\"' "\""
 523 | '"'  "'" /* Pacify font-lock-mode: ". */
 524 ;
 525 ]])
 526
 527 AT_BISON_OPTION_POPDEFS
 528
 529 AT_BISON_CHECK([-o input.c input.y])
 530 AT_COMPILE([input.o])
 531 AT_CLEANUP
 532
 533
 534
 535 ## -------------- ##
 536 ## Web2c Report.  ##
 537 ## -------------- ##
 538
 539 # The generation of the reduction was once wrong in Bison, and made it
 540 # miss some reductions.  In the following test case, the reduction on
 541 # 'undef_id_tok' in state 1 was missing.  This is stripped down from
 542 # the actual web2c.y.
 543
 544 AT_SETUP([Web2c Report])
 545
 546 AT_KEYWORDS([report])
 547
 548 AT_DATA([input.y],
 549 [[%token        undef_id_tok const_id_tok
 550
 551 %start CONST_DEC_PART
 552 \f
 553 %%
 554 CONST_DEC_PART:
 555          CONST_DEC_LIST
 556         ;
 557
 558 CONST_DEC_LIST:
 559           CONST_DEC
 560         | CONST_DEC_LIST CONST_DEC
 561         ;
 562
 563 CONST_DEC:
 564           { } undef_id_tok '=' const_id_tok ';'
 565         ;
 566 %%
 567 ]])
 568
 569 AT_BISON_CHECK([-v input.y])
 570 AT_CHECK([cat input.output], 0,
 571 [[Grammar
 572
 573     0 $accept: CONST_DEC_PART $end
 574
 575     1 CONST_DEC_PART: CONST_DEC_LIST
 576
 577     2 CONST_DEC_LIST: CONST_DEC
 578     3               | CONST_DEC_LIST CONST_DEC
 579
 580     4 $@1: /* empty */
 581
 582     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok ';'
 583
 584
 585 Terminals, with rules where they appear
 586
 587 $end (0) 0
 588 ';' (59) 5
 589 '=' (61) 5
 590 error (256)
 591 undef_id_tok (258) 5
 592 const_id_tok (259) 5
 593
 594
 595 Nonterminals, with rules where they appear
 596
 597 $accept (7)
 598     on left: 0
 599 CONST_DEC_PART (8)
 600     on left: 1, on right: 0
 601 CONST_DEC_LIST (9)
 602     on left: 2 3, on right: 1 3
 603 CONST_DEC (10)
 604     on left: 5, on right: 2 3
 605 $@1 (11)
 606     on left: 4, on right: 5
 607
 608
 609 state 0
 610
 611     0 $accept: . CONST_DEC_PART $end
 612
 613     $default  reduce using rule 4 ($@1)
 614
 615     CONST_DEC_PART  go to state 1
 616     CONST_DEC_LIST  go to state 2
 617     CONST_DEC       go to state 3
 618     $@1             go to state 4
 619
 620
 621 state 1
 622
 623     0 $accept: CONST_DEC_PART . $end
 624
 625     $end  shift, and go to state 5
 626
 627
 628 state 2
 629
 630     1 CONST_DEC_PART: CONST_DEC_LIST .
 631     3 CONST_DEC_LIST: CONST_DEC_LIST . CONST_DEC
 632
 633     undef_id_tok  reduce using rule 4 ($@1)
 634     $default      reduce using rule 1 (CONST_DEC_PART)
 635
 636     CONST_DEC  go to state 6
 637     $@1        go to state 4
 638
 639
 640 state 3
 641
 642     2 CONST_DEC_LIST: CONST_DEC .
 643
 644     $default  reduce using rule 2 (CONST_DEC_LIST)
 645
 646
 647 state 4
 648
 649     5 CONST_DEC: $@1 . undef_id_tok '=' const_id_tok ';'
 650
 651     undef_id_tok  shift, and go to state 7
 652
 653
 654 state 5
 655
 656     0 $accept: CONST_DEC_PART $end .
 657
 658     $default  accept
 659
 660
 661 state 6
 662
 663     3 CONST_DEC_LIST: CONST_DEC_LIST CONST_DEC .
 664
 665     $default  reduce using rule 3 (CONST_DEC_LIST)
 666
 667
 668 state 7
 669
 670     5 CONST_DEC: $@1 undef_id_tok . '=' const_id_tok ';'
 671
 672     '='  shift, and go to state 8
 673
 674
 675 state 8
 676
 677     5 CONST_DEC: $@1 undef_id_tok '=' . const_id_tok ';'
 678
 679     const_id_tok  shift, and go to state 9
 680
 681
 682 state 9
 683
 684     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok . ';'
 685
 686     ';'  shift, and go to state 10
 687
 688
 689 state 10
 690
 691     5 CONST_DEC: $@1 undef_id_tok '=' const_id_tok ';' .
 692
 693     $default  reduce using rule 5 (CONST_DEC)
 694 ]])
 695
 696 AT_CLEANUP
 697
 698
 699 ## --------------- ##
 700 ## Web2c Actions.  ##
 701 ## --------------- ##
 702
 703 # The generation of the mapping 'state -> action' was once wrong in
 704 # extremely specific situations.  web2c.y exhibits this situation.
 705 # Below is a stripped version of the grammar.  It looks like one can
 706 # simplify it further, but just don't: it is tuned to exhibit a bug,
 707 # which disapears when applying sane grammar transformations.
 708 #
 709 # It used to be wrong on yydefact only:
 710 #
 711 # static const yytype_uint8 yydefact[] =
 712 #  {
 713 # -       2,     0,     1,     0,     0,     2,     3,     2,     5,     4,
 714 # +       2,     0,     1,     0,     0,     0,     3,     2,     5,     4,
 715 #         0,     0
 716 #  };
 717 #
 718 # but let's check all the tables.
 719
 720
 721 AT_SETUP([Web2c Actions])
 722
 723 AT_KEYWORDS([report])
 724
 725 AT_DATA([input.y],
 726 [[%%
 727 statement:  struct_stat;
 728 struct_stat:  /* empty. */ | if else;
 729 if: "if" "const" "then" statement;
 730 else: "else" statement;
 731 %%
 732 ]])
 733
 734 AT_BISON_CHECK([-v -o input.c input.y])
 735
 736 # Check only the tables.
 737 [sed -n 's/  *$//;/^static const.*\[\] =/,/^}/p' input.c >tables.c]
 738
 739 AT_CHECK([[cat tables.c]], 0,
 740 [[static const yytype_uint8 yytranslate[] =
 741 {
 742        0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 743        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 744        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 745        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 746        2,     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,     1,     2,     3,     4,
 768        5,     6
 769 };
 770 static const yytype_uint8 yyprhs[] =
 771 {
 772        0,     0,     3,     5,     6,     9,    14
 773 };
 774 static const yytype_int8 yyrhs[] =
 775 {
 776        8,     0,    -1,     9,    -1,    -1,    10,    11,    -1,     3,
 777        4,     5,     8,    -1,     6,     8,    -1
 778 };
 779 static const yytype_uint8 yyrline[] =
 780 {
 781        0,     2,     2,     3,     3,     4,     5
 782 };
 783 static const char *const yytname[] =
 784 {
 785   "$end", "error", "$undefined", "\"if\"", "\"const\"", "\"then\"",
 786   "\"else\"", "$accept", "statement", "struct_stat", "if", "else", YY_NULL
 787 };
 788 static const yytype_uint16 yytoknum[] =
 789 {
 790        0,   256,   257,   258,   259,   260,   261
 791 };
 792 static const yytype_uint8 yyr1[] =
 793 {
 794        0,     7,     8,     9,     9,    10,    11
 795 };
 796 static const yytype_uint8 yyr2[] =
 797 {
 798        0,     2,     1,     0,     2,     4,     2
 799 };
 800 static const yytype_uint8 yydefact[] =
 801 {
 802        3,     0,     0,     2,     0,     0,     1,     3,     4,     3,
 803        6,     5
 804 };
 805 static const yytype_int8 yydefgoto[] =
 806 {
 807       -1,     2,     3,     4,     8
 808 };
 809 static const yytype_int8 yypact[] =
 810 {
 811       -2,    -1,     4,    -8,     0,     2,    -8,    -2,    -8,    -2,
 812       -8,    -8
 813 };
 814 static const yytype_int8 yypgoto[] =
 815 {
 816       -8,    -7,    -8,    -8,    -8
 817 };
 818 static const yytype_uint8 yytable[] =
 819 {
 820       10,     1,    11,     5,     6,     0,     7,     9
 821 };
 822 static const yytype_int8 yycheck[] =
 823 {
 824        7,     3,     9,     4,     0,    -1,     6,     5
 825 };
 826 static const yytype_uint8 yystos[] =
 827 {
 828        0,     3,     8,     9,    10,     4,     0,     6,    11,     5,
 829        8,     8
 830 };
 831 ]])
 832
 833 AT_CLEANUP
 834
 835
 836 ## ------------------------- ##
 837 ## yycheck Bound Violation.  ##
 838 ## ------------------------- ##
 839
 840
 841 # _AT_DATA_DANCER_Y(BISON-OPTIONS)
 842 # --------------------------------
 843 # The following grammar, taken from Andrew Suffield's GPL'd implementation
 844 # of DGMTP, the Dancer Generic Message Transport Protocol, used to violate
 845 # yycheck's bounds where issuing a verbose error message.  Keep this test
 846 # so that possible bound checking compilers could check all the skeletons.
 847 m4_define([_AT_DATA_DANCER_Y],
 848 [AT_DATA_GRAMMAR([dancer.y],
 849 [%{
 850 static int yylex (AT_LALR1_CC_IF([int *], [void]));
 851 AT_LALR1_CC_IF([],
 852 [#include <stdlib.h>
 853 #include <stdio.h>
 854 ]AT_YYERROR_DECLARE[])
 855 %}
 856 $1
 857 %token ARROW INVALID NUMBER STRING DATA
 858 %defines
 859 %verbose
 860 %error-verbose
 861 /* Grammar follows */
 862 %%
 863 line: header body
 864    ;
 865
 866 header: '<' from ARROW to '>' type ':'
 867    | '<' ARROW to '>' type ':'
 868    | ARROW to type ':'
 869    | type ':'
 870    | '<' '>'
 871    ;
 872
 873 from: DATA
 874    | STRING
 875    | INVALID
 876    ;
 877
 878 to: DATA
 879    | STRING
 880    | INVALID
 881    ;
 882
 883 type: DATA
 884    | STRING
 885    | INVALID
 886    ;
 887
 888 body: /* empty */
 889    | body member
 890    ;
 891
 892 member: STRING
 893    | DATA
 894    | '+' NUMBER
 895    | '-' NUMBER
 896    | NUMBER
 897    | INVALID
 898    ;
 899 %%
 900 AT_YYERROR_DEFINE[
 901 ]AT_LALR1_CC_IF(
 902 [int
 903 yyparse ()
 904 {
 905   yy::parser parser;
 906 #if YYDEBUG
 907   parser.set_debug_level (YYDEBUG);
 908 #endif
 909   return parser.parse ();
 910 }
 911 ])
 912
 913 #include <assert.h>
 914 static int
 915 yylex (AT_LALR1_CC_IF([int *lval], [void]))
 916 [{
 917   static int const tokens[] =
 918     {
 919       ':', -1
 920     };
 921   static size_t toknum;
 922   ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC.  */])[
 923   assert (toknum < sizeof tokens / sizeof *tokens);
 924   return tokens[toknum++];
 925 }]
 926
 927 int
 928 main (void)
 929 {
 930   return yyparse ();
 931 }
 932 ])
 933 ])# _AT_DATA_DANCER_Y
 934
 935
 936 # AT_CHECK_DANCER(BISON-OPTIONS)
 937 # ------------------------------
 938 # Generate the grammar, compile it, run it.
 939 m4_define([AT_CHECK_DANCER],
 940 [AT_SETUP([Dancer $1])
 941 AT_BISON_OPTION_PUSHDEFS([$1])
 942 _AT_DATA_DANCER_Y([$1])
 943 AT_BISON_CHECK([-o dancer.c dancer.y])
 944 AT_FULL_COMPILE([dancer])
 945 AT_PARSER_CHECK([./dancer], 1, [],
 946 [syntax error, unexpected ':'
 947 ])
 948 AT_BISON_OPTION_POPDEFS
 949 AT_CLEANUP
 950 ])
 951
 952 AT_CHECK_DANCER()
 953 AT_CHECK_DANCER([%glr-parser])
 954 AT_CHECK_DANCER([%skeleton "lalr1.cc"])
 955
 956
 957 ## ------------------------------------------ ##
 958 ## Diagnostic that expects two alternatives.  ##
 959 ## ------------------------------------------ ##
 960
 961
 962 # _AT_DATA_EXPECT2_Y(BISON-OPTIONS)
 963 # --------------------------------
 964 m4_define([_AT_DATA_EXPECT2_Y],
 965 [AT_DATA_GRAMMAR([expect2.y],
 966 [[%{
 967 static int yylex (]AT_LALR1_CC_IF([int *], [void]));
 968 AT_LALR1_CC_IF([],
 969 [[#include <stdio.h>
 970 #include <stdlib.h>
 971 ]AT_YYERROR_DECLARE])[
 972 %}
 973 $1
 974 %defines
 975 %error-verbose
 976 %token A 1000
 977 %token B
 978
 979 %%
 980 program: /* empty */
 981  | program e ';'
 982  | program error ';';
 983
 984 e: e '+' t | t;
 985 t: A | B;
 986
 987 %%
 988 ]AT_YYERROR_DEFINE[
 989 ]AT_LALR1_CC_IF(
 990 [int
 991 yyparse ()
 992 {
 993   yy::parser parser;
 994   return parser.parse ();
 995 }
 996 ])[
 997
 998 #include <assert.h>
 999 static int
1000 yylex (]AT_LALR1_CC_IF([int *lval], [void])[)
1001 {
1002   static int const tokens[] =
1003     {
1004       1000, '+', '+', -1
1005     };
1006   static size_t toknum;
1007   ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC.  */])[
1008   assert (toknum < sizeof tokens / sizeof *tokens);
1009   return tokens[toknum++];
1010 }
1011
1012 int
1013 main (void)
1014 {
1015   return yyparse ();
1016 }
1017 ]])
1018 ])# _AT_DATA_EXPECT2_Y
1019
1020
1021 # AT_CHECK_EXPECT2(BISON-OPTIONS)
1022 # -------------------------------
1023 # Generate the grammar, compile it, run it.
1024 m4_define([AT_CHECK_EXPECT2],
1025 [AT_SETUP([Expecting two tokens $1])
1026 AT_BISON_OPTION_PUSHDEFS([$1])
1027 _AT_DATA_EXPECT2_Y([$1])
1028 AT_BISON_CHECK([-o expect2.c expect2.y])
1029 AT_FULL_COMPILE([expect2])
1030 AT_PARSER_CHECK([./expect2], 1, [],
1031 [syntax error, unexpected '+', expecting A or B
1032 ])
1033 AT_BISON_OPTION_POPDEFS
1034 AT_CLEANUP
1035 ])
1036
1037 AT_CHECK_EXPECT2()
1038 AT_CHECK_EXPECT2([%glr-parser])
1039 AT_CHECK_EXPECT2([%skeleton "lalr1.cc"])
1040
1041
1042
1043 ## --------------------------------------------- ##
1044 ## Braced code in declaration in rules section.  ##
1045 ## --------------------------------------------- ##
1046
1047 AT_SETUP([Braced code in declaration in rules section])
1048
1049 # Bison once mistook braced code in a declaration in the rules section to be a
1050 # rule action.
1051 AT_BISON_OPTION_PUSHDEFS
1052 AT_DATA_GRAMMAR([input.y],
1053 [[%{
1054 #include <stdio.h>
1055 ]AT_YYERROR_DECLARE[
1056 ]AT_YYLEX_DECLARE[
1057 %}
1058
1059 %error-verbose
1060
1061 %%
1062
1063 start:
1064   {
1065     printf ("Bison would once convert this action to a midrule because of the"
1066             " subsequent braced code.\n");
1067   }
1068   ;
1069
1070 %destructor { fprintf (stderr, "DESTRUCTOR\n"); } 'a';
1071 %printer { fprintf (yyoutput, "PRINTER"); } 'a';
1072
1073 %%
1074
1075 ]AT_YYERROR_DEFINE[
1076 static int
1077 yylex (void)
1078 {
1079   return 'a';
1080 }
1081
1082 int
1083 main (void)
1084 {
1085   yydebug = 1;
1086   return !yyparse ();
1087 }
1088 ]])
1089 AT_BISON_OPTION_POPDEFS
1090
1091 AT_BISON_CHECK([-t -o input.c input.y])
1092 AT_COMPILE([input])
1093 AT_PARSER_CHECK([./input], 0,
1094 [[Bison would once convert this action to a midrule because of the subsequent braced code.
1095 ]],
1096 [[Starting parse
1097 Entering state 0
1098 Reducing stack by rule 1 (line 20):
1099 -> $$ = nterm start ()
1100 Stack now 0
1101 Entering state 1
1102 Reading a token: Next token is token 'a' (PRINTER)
1103 syntax error, unexpected 'a', expecting $end
1104 Error: popping nterm start ()
1105 Stack now 0
1106 Cleanup: discarding lookahead token 'a' (PRINTER)
1107 DESTRUCTOR
1108 Stack now 0
1109 ]])
1110
1111 AT_CLEANUP
1112
1113
1114
1115 ## --------------------------------- ##
1116 ## String alias declared after use.  ##
1117 ## --------------------------------- ##
1118
1119 AT_SETUP([String alias declared after use])
1120
1121 # Bison once incorrectly asserted that the symbol number for either a token or
1122 # its alias was the highest symbol number so far at the point of the alias
1123 # declaration.  That was true unless the declaration appeared after their first
1124 # uses and other tokens appeared in between.
1125
1126 AT_DATA([input.y],
1127 [[%%
1128 start: 'a' "A" 'b';
1129 %token 'a' "A";
1130 ]])
1131
1132 AT_BISON_CHECK([-t -o input.c input.y])
1133
1134 AT_CLEANUP
1135
1136
1137
1138 ## -------------------------------- ##
1139 ## Extra lookahead sets in report.  ##
1140 ## -------------------------------- ##
1141
1142 AT_SETUP([[Extra lookahead sets in report]])
1143
1144 # Bison prints each reduction's lookahead set only next to the associated
1145 # state's one item that (1) is associated with the same rule as the reduction
1146 # and (2) has its dot at the end of its RHS.  Previously, Bison also
1147 # erroneously printed the lookahead set next to all of the state's other items
1148 # associated with the same rule.  This bug affected only the '.output' file and
1149 # not the generated parser source code.
1150
1151 AT_DATA([[input.y]],
1152 [[%%
1153 start: a | 'a' a 'a' ;
1154 a: 'a' ;
1155 ]])
1156
1157 AT_BISON_CHECK([[--report=all input.y]])
1158 AT_CHECK([[sed -n '/^state 1$/,/^state 2$/p' input.output]], [[0]],
1159 [[state 1
1160
1161     2 start: 'a' . a 'a'
1162     3 a: . 'a'
1163     3  | 'a' .  [$end]
1164
1165     'a'  shift, and go to state 4
1166
1167     $default  reduce using rule 3 (a)
1168
1169     a  go to state 5
1170
1171
1172 state 2
1173 ]])
1174
1175 AT_CLEANUP
1176
1177
1178
1179 ## ---------------------------------------- ##
1180 ## Token number in precedence declaration.  ##
1181 ## ---------------------------------------- ##
1182
1183 AT_SETUP([[Token number in precedence declaration]])
1184
1185 # POSIX says token numbers can be declared in %left, %right, and %nonassoc, but
1186 # we lost this in Bison 1.50.
1187 AT_BISON_OPTION_PUSHDEFS
1188 AT_DATA_GRAMMAR([input.y],
1189 [[%{
1190   #include <stdio.h>
1191   ]AT_YYERROR_DECLARE[
1192   ]AT_YYLEX_DECLARE[
1193 %}
1194
1195 %error-verbose
1196 %right END 0
1197 %left TK1 1 TK2 2 "tok alias" 3
1198
1199 %%
1200
1201 start:
1202     TK1 sr_conflict "tok alias"
1203   | start %prec END
1204   ;
1205 sr_conflict:
1206   TK2
1207   | TK2 "tok alias"
1208   ;
1209
1210 %%
1211
1212 ]AT_YYERROR_DEFINE[
1213 int
1214 yylex (void)
1215 {
1216   static int const input[] = { 1, 2, 3, 0 };
1217   static int const *inputp = input;
1218   return *inputp++;
1219 }
1220
1221 int
1222 main (void)
1223 {
1224   return yyparse ();
1225 }
1226 ]])
1227 AT_BISON_OPTION_POPDEFS
1228
1229 AT_BISON_CHECK([[-o input.c input.y]], [[0]],,
1230 [[input.y:23.5-19: warning: rule useless in parser due to conflicts: start: start
1231 input.y:27.5-19: warning: rule useless in parser due to conflicts: sr_conflict: TK2 "tok alias"
1232 ]])
1233 AT_COMPILE([[input]])
1234 AT_PARSER_CHECK([[./input]])
1235
1236 AT_CLEANUP
1237
1238
1239
1240 ## --------------------------- ##
1241 ## parse-gram.y: LALR = IELR.  ##
1242 ## --------------------------- ##
1243
1244 # If parse-gram.y's LALR and IELR parser tables ever begin to differ, we
1245 # need to fix parse-gram.y or start using IELR.
1246
1247 AT_SETUP([[parse-gram.y: LALR = IELR]])
1248
1249 # Avoid differences in synclines by telling bison that the output files
1250 # have the same name.
1251 [cp $abs_top_srcdir/src/parse-gram.y input.y]
1252 AT_BISON_CHECK([[-o input.c -Dlr.type=lalr input.y]])
1253 [mv input.c lalr.c]
1254 AT_CAPTURE_FILE([lalr.c])
1255 AT_BISON_CHECK([[-o input.c -Dlr.type=ielr input.y]])
1256 [mv input.c ielr.c]
1257 AT_CAPTURE_FILE([ielr.c])
1258 AT_CHECK([[diff lalr.c ielr.c]], [[0]])
1259
1260 AT_CLEANUP
1261
1262
1263
1264 ## --------------------------------------- ##
1265 ## %error-verbose and YYSTACK_USE_ALLOCA.  ##
1266 ## --------------------------------------- ##
1267
1268 AT_SETUP([[%error-verbose and YYSTACK_USE_ALLOCA]])
1269
1270 AT_BISON_OPTION_PUSHDEFS
1271 AT_DATA_GRAMMAR([input.y],
1272 [[%code {
1273   #include <stdio.h>
1274   ]AT_YYERROR_DECLARE[
1275   ]AT_YYLEX_DECLARE[
1276   #define YYSTACK_USE_ALLOCA 1
1277 }
1278
1279 %error-verbose
1280
1281 %%
1282
1283 start: check syntax_error syntax_error ;
1284
1285 check:
1286 {
1287   if (128 < sizeof yymsgbuf)
1288     {
1289       fprintf (stderr,
1290                "The initial size of yymsgbuf in yyparse has increased\n"
1291                "since this test group was last updated.  As a result,\n"
1292                "this test group may no longer manage to induce a\n"
1293                "reallocation of the syntax error message buffer.\n"
1294                "This test group must be adjusted to produce a longer\n"
1295                "error message.\n");
1296       YYABORT;
1297     }
1298 }
1299 ;
1300
1301 // Induce a syntax error message whose total length is more than
1302 // sizeof yymsgbuf in yyparse.  Each token here is 64 bytes.
1303 syntax_error:
1304   "123456789112345678921234567893123456789412345678951234567896123A"
1305 | "123456789112345678921234567893123456789412345678951234567896123B"
1306 | error 'a' 'b' 'c'
1307 ;
1308
1309 %%
1310
1311 ]AT_YYERROR_DEFINE[
1312 /* Induce two syntax error messages (which requires full error
1313    recovery by shifting 3 tokens) in order to detect any loss of the
1314    reallocated buffer.  */
1315 ]AT_YYLEX_DEFINE([abc])[
1316 int
1317 main (void)
1318 {
1319   return yyparse ();
1320 }
1321 ]])
1322 AT_BISON_OPTION_POPDEFS
1323
1324 AT_BISON_CHECK([[-o input.c input.y]])
1325 AT_COMPILE([[input]])
1326 AT_PARSER_CHECK([[./input]], [[1]], [],
1327 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1328 syntax error, unexpected $end, expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1329 ]])
1330
1331 AT_CLEANUP
1332
1333
1334
1335 ## ------------------------- ##
1336 ## %error-verbose overflow.  ##
1337 ## ------------------------- ##
1338
1339 # Imagine the case where YYSTACK_ALLOC_MAXIMUM = YYSIZE_MAXIMUM and an
1340 # invocation of yysyntax_error has caused yymsg_alloc to grow to exactly
1341 # YYSTACK_ALLOC_MAXIMUM (perhaps because the normal doubling of size had
1342 # to be clipped to YYSTACK_ALLOC_MAXIMUM).  In an old version of yacc.c,
1343 # a subsequent invocation of yysyntax_error that overflows during its
1344 # size calculation would return YYSIZE_MAXIMUM to yyparse.  Then,
1345 # yyparse would invoke yyerror using the old contents of yymsg.
1346
1347 AT_SETUP([[%error-verbose overflow]])
1348 AT_BISON_OPTION_PUSHDEFS
1349 AT_DATA_GRAMMAR([input.y],
1350 [[%code {
1351   #include <stdio.h>
1352   ]AT_YYERROR_DECLARE[
1353   ]AT_YYLEX_DECLARE[
1354
1355   /* This prevents this test case from having to induce error messages
1356      large enough to overflow size_t.  */
1357   #define YYSIZE_T unsigned char
1358
1359   /* Bring in malloc and set EXIT_SUCCESS so yacc.c doesn't try to
1360      provide a malloc prototype using our YYSIZE_T.  */
1361   #include <stdlib.h>
1362   #ifndef EXIT_SUCCESS
1363   # define EXIT_SUCCESS 0
1364   #endif
1365
1366   /* Max depth is usually much smaller than YYSTACK_ALLOC_MAXIMUM, and
1367      we don't want gcc to warn everywhere this constant would be too big
1368      to make sense for our YYSIZE_T.  */
1369   #define YYMAXDEPTH 100
1370 }
1371
1372 %error-verbose
1373
1374 %%
1375
1376 start: syntax_error1 check syntax_error2 ;
1377
1378 // Induce a syntax error message whose total length causes yymsg in
1379 // yyparse to be reallocated to size YYSTACK_ALLOC_MAXIMUM, which
1380 // should be 255.  Each token here is 64 bytes.
1381 syntax_error1:
1382   "123456789112345678921234567893123456789412345678951234567896123A"
1383 | "123456789112345678921234567893123456789412345678951234567896123B"
1384 | "123456789112345678921234567893123456789412345678951234567896123C"
1385 | error 'a' 'b' 'c'
1386 ;
1387
1388 check:
1389 {
1390   if (yymsg_alloc != YYSTACK_ALLOC_MAXIMUM
1391       || YYSTACK_ALLOC_MAXIMUM != YYSIZE_MAXIMUM
1392       || YYSIZE_MAXIMUM != 255)
1393     {
1394       fprintf (stderr,
1395                "The assumptions of this test group are no longer\n"
1396                "valid, so it may no longer catch the error it was\n"
1397                "designed to catch.  Specifically, the following\n"
1398                "values should all be 255:\n\n");
1399       fprintf (stderr, "  yymsg_alloc = %d\n", yymsg_alloc);
1400       fprintf (stderr, "  YYSTACK_ALLOC_MAXIMUM = %d\n",
1401                YYSTACK_ALLOC_MAXIMUM);
1402       fprintf (stderr, "  YYSIZE_MAXIMUM = %d\n", YYSIZE_MAXIMUM);
1403       YYABORT;
1404     }
1405 }
1406 ;
1407
1408 // Now overflow.
1409 syntax_error2:
1410   "123456789112345678921234567893123456789412345678951234567896123A"
1411 | "123456789112345678921234567893123456789412345678951234567896123B"
1412 | "123456789112345678921234567893123456789412345678951234567896123C"
1413 | "123456789112345678921234567893123456789412345678951234567896123D"
1414 | "123456789112345678921234567893123456789412345678951234567896123E"
1415 ;
1416
1417 %%
1418
1419 ]AT_YYERROR_DEFINE[
1420 /* Induce two syntax error messages (which requires full error
1421    recovery by shifting 3 tokens).  */
1422 ]AT_YYLEX_DEFINE([abc])[
1423 int
1424 main (void)
1425 {
1426   /* Push parsers throw away the message buffer between tokens, so skip
1427      this test under maintainer-push-check.  */
1428   if (YYPUSH)
1429     return 77;
1430   return yyparse ();
1431 }
1432 ]])
1433
1434 AT_BISON_CHECK([[-o input.c input.y]])
1435
1436 # gcc warns about tautologies and fallacies involving comparisons for
1437 # unsigned char.  However, it doesn't produce these same warnings for
1438 # size_t and many other types when the warnings would seem to make just
1439 # as much sense.  We ignore the warnings.
1440 [CFLAGS="$NO_WERROR_CFLAGS"]
1441 AT_COMPILE([[input]])
1442
1443 AT_PARSER_CHECK([[./input]], [[2]], [],
1444 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B or 123456789112345678921234567893123456789412345678951234567896123C
1445 syntax error
1446 memory exhausted
1447 ]])
1448 AT_BISON_OPTION_POPDEFS
1449 AT_CLEANUP
1450
1451
1452
1453 ## ------------------------ ##
1454 ## LAC: Exploratory stack.  ##
1455 ## ------------------------ ##
1456
1457 AT_SETUP([[LAC: Exploratory stack]])
1458
1459 m4_pushdef([AT_LAC_CHECK], [
1460
1461 AT_BISON_OPTION_PUSHDEFS([$1])
1462
1463 AT_DATA_GRAMMAR([input.y],
1464 [[%code {
1465   #include <stdio.h>
1466   ]AT_YYERROR_DECLARE[
1467   int yylex (]AT_PURE_IF([[YYSTYPE *]], [[void]])[);
1468 }
1469
1470 ]$1[
1471 %error-verbose
1472 %token 'c'
1473
1474 %%
1475
1476 // default reductions in inconsistent states
1477 // v   v v   v v v v   v v v v v v v
1478 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 ;
1479 //       ^                     ^                               ^
1480 // LAC reallocs
1481
1482 A: 'a' | /*empty*/ { printf ("inconsistent default reduction\n"); } ;
1483 B: 'b' ;
1484 C: /*empty*/ { printf ("consistent default reduction\n"); } ;
1485
1486 %%
1487 ]AT_YYERROR_DEFINE[
1488 int
1489 yylex (]AT_PURE_IF([[YYSTYPE *v]], [[void]])[)
1490 {
1491   static char const *input = "bbbbc";]AT_PURE_IF([[
1492   *v = 0;]])[
1493   return *input++;
1494 }
1495
1496 int
1497 main (void)
1498 {
1499   yydebug = 1;
1500   return yyparse ();
1501 }
1502 ]])
1503
1504 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1505                  -Dparse.lac.memory-trace=full \
1506                  -t -o input.c input.y]], [[0]], [],
1507 [[input.y: conflicts: 21 shift/reduce
1508 ]])
1509 AT_COMPILE([[input]])
1510 AT_PARSER_CHECK([[./input > stdout.txt 2> stderr.txt]], [[1]])
1511
1512 # Make sure syntax error doesn't forget that 'a' is expected.  It would
1513 # be forgotten without lookahead correction.
1514 AT_CHECK([[grep 'syntax error,' stderr.txt]], [[0]],
1515 [[syntax error, unexpected 'c', expecting 'a' or 'b'
1516 ]])
1517
1518 # Check number of default reductions in inconsistent states to be sure
1519 # syntax error is detected before unnecessary reductions are performed.
1520 AT_CHECK([[perl -0777 -ne 'print s/inconsistent default reduction//g;' \
1521            < stdout.txt || exit 77]], [[0]], [[14]])
1522
1523 # Check number of default reductions in consistent states to be sure
1524 # it is performed before the syntax error is detected.
1525 AT_CHECK([[perl -0777 -ne 'print s/\bconsistent default reduction//g;' \
1526            < stdout.txt || exit 77]], [[0]], [[2]])
1527
1528 # Check number of reallocs to be sure reallocated memory isn't somehow
1529 # lost between LAC invocations.
1530 AT_CHECK([[perl -0777 -ne 'print s/\(realloc//g;' < stderr.txt \
1531            || exit 77]], [[0]], [[3]])
1532
1533 AT_BISON_OPTION_POPDEFS
1534 ])
1535
1536 AT_LAC_CHECK([[%define api.push-pull pull]])
1537 AT_LAC_CHECK([[%define api.push-pull pull %define api.pure]])
1538 AT_LAC_CHECK([[%define api.push-pull both]])
1539 AT_LAC_CHECK([[%define api.push-pull both %define api.pure]])
1540
1541 m4_popdef([AT_LAC_CHECK])
1542
1543 AT_CLEANUP
1544
1545
1546
1547 ## ------------------------ ##
1548 ## LAC: Memory exhaustion.  ##
1549 ## ------------------------ ##
1550
1551 AT_SETUP([[LAC: Memory exhaustion]])
1552
1553 m4_pushdef([AT_LAC_CHECK],
1554 [AT_BISON_OPTION_PUSHDEFS
1555 AT_DATA_GRAMMAR([input.y],
1556 [[%code {
1557   #include <stdio.h>
1558   ]AT_YYERROR_DECLARE[
1559   ]AT_YYLEX_DECLARE[
1560   #define YYMAXDEPTH 8
1561 }
1562
1563 %error-verbose
1564
1565 %%
1566
1567 S: A A A A A A A A A ;
1568 A: /*empty*/ | 'a' ;
1569
1570 %%
1571 ]AT_YYERROR_DEFINE[
1572 ]AT_YYLEX_DEFINE([$1])[
1573 int
1574 main (void)
1575 {
1576   yydebug = 1;
1577   return yyparse ();
1578 }
1579 ]])
1580
1581 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1582                  -t -o input.c input.y]], [[0]], [],
1583 [[input.y: conflicts: 8 shift/reduce
1584 ]])
1585 AT_COMPILE([[input]])
1586 AT_BISON_OPTION_POPDEFS
1587 ])
1588
1589 # Check for memory exhaustion during parsing.
1590 AT_LAC_CHECK([])
1591 AT_PARSER_CHECK([[./input]], [[2]], [],
1592 [[Starting parse
1593 Entering state 0
1594 Reading a token: Now at end of input.
1595 LAC: initial context established for $end
1596 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1597 memory exhausted
1598 Cleanup: discarding lookahead token $end ()
1599 Stack now 0
1600 ]])
1601
1602 # Induce an immediate syntax error with an undefined token, and check
1603 # for memory exhaustion while building syntax error message.
1604 AT_LAC_CHECK([z], [[0]])
1605 AT_PARSER_CHECK([[./input]], [[2]], [],
1606 [[Starting parse
1607 Entering state 0
1608 Reading a token: Next token is token $undefined ()
1609 LAC: initial context established for $undefined
1610 LAC: checking lookahead $undefined: Always Err
1611 Constructing syntax error message
1612 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1613 syntax error
1614 memory exhausted
1615 Cleanup: discarding lookahead token $undefined ()
1616 Stack now 0
1617 ]])
1618
1619 m4_popdef([AT_LAC_CHECK])
1620
1621 AT_CLEANUP