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 [-Wother]
 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: error: invalid character: '?'
 405 input.y:3.14: error: invalid character: '}'
 406 input.y:4.1: error: invalid character: '%'
 407 input.y:4.2: error: invalid character: '&'
 408 input.y:5.1-17: error: invalid directive: '%a-does-not-exist'
 409 input.y:6.1: error: invalid character: '%'
 410 input.y:6.2: error: invalid character: '-'
 411 input.y:7.1-8.0: error: missing '%}' at end of file
 412 input.y:7.1-8.0: error: 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: error: 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 ]AT_YYLEX_DEFINE([{ SPECIAL }])[
 467
 468 int
 469 main (void)
 470 {
 471   return yyparse ();
 472 }
 473 ]])
 474 AT_BISON_OPTION_POPDEFS
 475
 476 # Checking the warning message guarantees that the trigraph "??!" isn't
 477 # unnecessarily escaped here even though it would need to be if encoded in a
 478 # C-string literal.  Also notice that unnecessary escaping, such as "\?", from
 479 # the user specification is eliminated.
 480 AT_BISON_CHECK([-o input.c input.y], [[0]], [[]],
 481 [[input.y:22.8-14: warning: symbol SPECIAL redeclared [-Wother]
 482 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 [-Wother]
 483 ]])
 484 AT_BISON_CHECK([-fcaret -o input.c input.y], [[0]], [[]],
 485 [[input.y:22.8-14: warning: symbol SPECIAL redeclared [-Wother]
 486  %token SPECIAL "\\\'\?\"\a\b\f\n\r\t\v\001\201\x001\x000081??!"
 487         ^^^^^^^
 488 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 [-Wother]
 489  %token SPECIAL "\\\'\?\"\a\b\f\n\r\t\v\001\201\x001\x000081??!"
 490         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 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 yyrline[] =
 771 {
 772        0,     2,     2,     3,     3,     4,     5
 773 };
 774 static const char *const yytname[] =
 775 {
 776   "$end", "error", "$undefined", "\"if\"", "\"const\"", "\"then\"",
 777   "\"else\"", "$accept", "statement", "struct_stat", "if", "else", YY_NULL
 778 };
 779 static const yytype_uint16 yytoknum[] =
 780 {
 781        0,   256,   257,   258,   259,   260,   261
 782 };
 783 static const yytype_int8 yypact[] =
 784 {
 785       -2,    -1,     4,    -8,     0,     2,    -8,    -2,    -8,    -2,
 786       -8,    -8
 787 };
 788 static const yytype_uint8 yydefact[] =
 789 {
 790        3,     0,     0,     2,     0,     0,     1,     3,     4,     3,
 791        6,     5
 792 };
 793 static const yytype_int8 yypgoto[] =
 794 {
 795       -8,    -7,    -8,    -8,    -8
 796 };
 797 static const yytype_int8 yydefgoto[] =
 798 {
 799       -1,     2,     3,     4,     8
 800 };
 801 static const yytype_uint8 yytable[] =
 802 {
 803       10,     1,    11,     5,     6,     0,     7,     9
 804 };
 805 static const yytype_int8 yycheck[] =
 806 {
 807        7,     3,     9,     4,     0,    -1,     6,     5
 808 };
 809 static const yytype_uint8 yystos[] =
 810 {
 811        0,     3,     8,     9,    10,     4,     0,     6,    11,     5,
 812        8,     8
 813 };
 814 static const yytype_uint8 yyr1[] =
 815 {
 816        0,     7,     8,     9,     9,    10,    11
 817 };
 818 static const yytype_uint8 yyr2[] =
 819 {
 820        0,     2,     1,     0,     2,     4,     2
 821 };
 822 ]])
 823
 824 AT_CLEANUP
 825
 826
 827 ## ------------------------- ##
 828 ## yycheck Bound Violation.  ##
 829 ## ------------------------- ##
 830
 831
 832 # _AT_DATA_DANCER_Y(BISON-OPTIONS)
 833 # --------------------------------
 834 # The following grammar, taken from Andrew Suffield's GPL'd implementation
 835 # of DGMTP, the Dancer Generic Message Transport Protocol, used to violate
 836 # yycheck's bounds where issuing a verbose error message.  Keep this test
 837 # so that possible bound checking compilers could check all the skeletons.
 838 m4_define([_AT_DATA_DANCER_Y],
 839 [AT_DATA_GRAMMAR([dancer.y],
 840 [[%code provides
 841 {
 842   ]AT_YYERROR_DECLARE[
 843   ]AT_YYLEX_DECLARE[
 844 }
 845 $1
 846 %token ARROW INVALID NUMBER STRING DATA
 847 %defines
 848 %verbose
 849 %error-verbose
 850 /* Grammar follows */
 851 %%
 852 line: header body
 853    ;
 854
 855 header: '<' from ARROW to '>' type ':'
 856    | '<' ARROW to '>' type ':'
 857    | ARROW to type ':'
 858    | type ':'
 859    | '<' '>'
 860    ;
 861
 862 from: DATA
 863    | STRING
 864    | INVALID
 865    ;
 866
 867 to: DATA
 868    | STRING
 869    | INVALID
 870    ;
 871
 872 type: DATA
 873    | STRING
 874    | INVALID
 875    ;
 876
 877 body: /* empty */
 878    | body member
 879    ;
 880
 881 member: STRING
 882    | DATA
 883    | '+' NUMBER
 884    | '-' NUMBER
 885    | NUMBER
 886    | INVALID
 887    ;
 888 %%
 889 ]AT_YYERROR_DEFINE[
 890 ]AT_YYLEX_DEFINE([":"])[
 891 ]AT_LALR1_CC_IF(
 892 [int
 893 yyparse ()
 894 {
 895   yy::parser parser;
 896 #if YYDEBUG
 897   parser.set_debug_level (YYDEBUG);
 898 #endif
 899   return parser.parse ();
 900 }
 901 ])[
 902
 903 int
 904 main (void)
 905 {
 906   return yyparse ();
 907 }
 908 ]])
 909 ])# _AT_DATA_DANCER_Y
 910
 911
 912 # AT_CHECK_DANCER(BISON-OPTIONS)
 913 # ------------------------------
 914 # Generate the grammar, compile it, run it.
 915 m4_define([AT_CHECK_DANCER],
 916 [AT_SETUP([Dancer $1])
 917 AT_BISON_OPTION_PUSHDEFS([$1])
 918 _AT_DATA_DANCER_Y([$1])
 919 AT_FULL_COMPILE([dancer])
 920 AT_PARSER_CHECK([./dancer], 1, [],
 921 [syntax error, unexpected ':'
 922 ])
 923 AT_BISON_OPTION_POPDEFS
 924 AT_CLEANUP
 925 ])
 926
 927 AT_CHECK_DANCER()
 928 AT_CHECK_DANCER([%glr-parser])
 929 AT_CHECK_DANCER([%skeleton "lalr1.cc"])
 930
 931
 932 ## ------------------------------------------ ##
 933 ## Diagnostic that expects two alternatives.  ##
 934 ## ------------------------------------------ ##
 935
 936
 937 # _AT_DATA_EXPECT2_Y(BISON-OPTIONS)
 938 # --------------------------------
 939 m4_define([_AT_DATA_EXPECT2_Y],
 940 [AT_DATA_GRAMMAR([expect2.y],
 941 [%{
 942 static int yylex (AT_LALR1_CC_IF([int *], [void]));
 943 AT_LALR1_CC_IF([[#include <cstdlib>]],
 944 [[#include <stdlib.h>
 945 #include <stdio.h>
 946 ]AT_YYERROR_DECLARE])[
 947 %}
 948 $1
 949 %defines
 950 %error-verbose
 951 %token A 1000
 952 %token B
 953
 954 %%
 955 program: /* empty */
 956  | program e ';'
 957  | program error ';';
 958
 959 e: e '+' t | t;
 960 t: A | B;
 961
 962 %%
 963 ]AT_YYERROR_DEFINE[
 964 ]AT_LALR1_CC_IF(
 965 [int
 966 yyparse ()
 967 {
 968   yy::parser parser;
 969   return parser.parse ();
 970 }
 971 ])[
 972
 973 #include <assert.h>
 974 static int
 975 yylex (]AT_LALR1_CC_IF([int *lval], [void])[)
 976 {
 977   static int const tokens[] =
 978     {
 979       1000, '+', '+', -1
 980     };
 981   static size_t toknum;
 982   ]AT_LALR1_CC_IF([*lval = 0; /* Pacify GCC.  */])[
 983   assert (toknum < sizeof tokens / sizeof *tokens);
 984   return tokens[toknum++];
 985 }
 986
 987 int
 988 main (void)
 989 {
 990   return yyparse ();
 991 }
 992 ]])
 993 ])# _AT_DATA_EXPECT2_Y
 994
 995
 996 # AT_CHECK_EXPECT2(BISON-OPTIONS)
 997 # -------------------------------
 998 # Generate the grammar, compile it, run it.
 999 m4_define([AT_CHECK_EXPECT2],
1000 [AT_SETUP([Expecting two tokens $1])
1001 AT_BISON_OPTION_PUSHDEFS([$1])
1002 _AT_DATA_EXPECT2_Y([$1])
1003 AT_FULL_COMPILE([expect2])
1004 AT_PARSER_CHECK([./expect2], 1, [],
1005 [syntax error, unexpected '+', expecting A or B
1006 ])
1007 AT_BISON_OPTION_POPDEFS
1008 AT_CLEANUP
1009 ])
1010
1011 AT_CHECK_EXPECT2()
1012 AT_CHECK_EXPECT2([%glr-parser])
1013 AT_CHECK_EXPECT2([%skeleton "lalr1.cc"])
1014
1015
1016
1017 ## --------------------------------------------- ##
1018 ## Braced code in declaration in rules section.  ##
1019 ## --------------------------------------------- ##
1020
1021 AT_SETUP([Braced code in declaration in rules section])
1022
1023 # Bison once mistook braced code in a declaration in the rules section to be a
1024 # rule action.
1025 AT_BISON_OPTION_PUSHDEFS
1026 AT_DATA_GRAMMAR([input.y],
1027 [[%{
1028 #include <stdio.h>
1029 ]AT_YYERROR_DECLARE[
1030 ]AT_YYLEX_DECLARE[
1031 %}
1032
1033 %error-verbose
1034
1035 %%
1036
1037 start:
1038   {
1039     printf ("Bison would once convert this action to a midrule because of the"
1040             " subsequent braced code.\n");
1041   }
1042   ;
1043
1044 %destructor { fprintf (stderr, "DESTRUCTOR\n"); } 'a';
1045 %printer { fprintf (yyoutput, "PRINTER"); } 'a';
1046
1047 %%
1048 ]AT_YYERROR_DEFINE[
1049 ]AT_YYLEX_DEFINE(["a"])[
1050
1051 int
1052 main (void)
1053 {
1054   yydebug = 1;
1055   return !yyparse ();
1056 }
1057 ]])
1058 AT_BISON_OPTION_POPDEFS
1059
1060 AT_BISON_CHECK([-t -o input.c input.y])
1061 AT_COMPILE([input])
1062 AT_PARSER_CHECK([./input], 0,
1063 [[Bison would once convert this action to a midrule because of the subsequent braced code.
1064 ]],
1065 [[Starting parse
1066 Entering state 0
1067 Reducing stack by rule 1 (line 20):
1068 -> $$ = nterm start ()
1069 Stack now 0
1070 Entering state 1
1071 Reading a token: Next token is token 'a' (PRINTER)
1072 syntax error, unexpected 'a', expecting $end
1073 Error: popping nterm start ()
1074 Stack now 0
1075 Cleanup: discarding lookahead token 'a' (PRINTER)
1076 DESTRUCTOR
1077 Stack now 0
1078 ]])
1079
1080 AT_CLEANUP
1081
1082
1083
1084 ## --------------------------------- ##
1085 ## String alias declared after use.  ##
1086 ## --------------------------------- ##
1087
1088 AT_SETUP([String alias declared after use])
1089
1090 # Bison once incorrectly asserted that the symbol number for either a token or
1091 # its alias was the highest symbol number so far at the point of the alias
1092 # declaration.  That was true unless the declaration appeared after their first
1093 # uses and other tokens appeared in between.
1094
1095 AT_DATA([input.y],
1096 [[%%
1097 start: 'a' "A" 'b';
1098 %token 'a' "A";
1099 ]])
1100
1101 AT_BISON_CHECK([-t -o input.c input.y])
1102
1103 AT_CLEANUP
1104
1105
1106
1107 ## -------------------------------- ##
1108 ## Extra lookahead sets in report.  ##
1109 ## -------------------------------- ##
1110
1111 AT_SETUP([[Extra lookahead sets in report]])
1112
1113 # Bison prints each reduction's lookahead set only next to the associated
1114 # state's one item that (1) is associated with the same rule as the reduction
1115 # and (2) has its dot at the end of its RHS.  Previously, Bison also
1116 # erroneously printed the lookahead set next to all of the state's other items
1117 # associated with the same rule.  This bug affected only the '.output' file and
1118 # not the generated parser source code.
1119
1120 AT_DATA([[input.y]],
1121 [[%%
1122 start: a | 'a' a 'a' ;
1123 a: 'a' ;
1124 ]])
1125
1126 AT_BISON_CHECK([[--report=all input.y]])
1127 AT_CHECK([[sed -n '/^State 1$/,/^State 2$/p' input.output]], [[0]],
1128 [[State 1
1129
1130     2 start: 'a' . a 'a'
1131     3 a: . 'a'
1132     3  | 'a' .  [$end]
1133
1134     'a'  shift, and go to state 4
1135
1136     $default  reduce using rule 3 (a)
1137
1138     a  go to state 5
1139
1140
1141 State 2
1142 ]])
1143
1144 AT_CLEANUP
1145
1146
1147
1148 ## ---------------------------------------- ##
1149 ## Token number in precedence declaration.  ##
1150 ## ---------------------------------------- ##
1151
1152 AT_SETUP([[Token number in precedence declaration]])
1153
1154 # POSIX says token numbers can be declared in %left, %right, and %nonassoc, but
1155 # we lost this in Bison 1.50.
1156 AT_BISON_OPTION_PUSHDEFS
1157 AT_DATA_GRAMMAR([input.y],
1158 [[%{
1159   #include <stdio.h>
1160   ]AT_YYERROR_DECLARE[
1161   ]AT_YYLEX_DECLARE[
1162 %}
1163
1164 %error-verbose
1165 %right END 0
1166 %left TK1 1 TK2 2 "tok alias" 3
1167
1168 %%
1169
1170 start:
1171     TK1 sr_conflict "tok alias"
1172   | start %prec END
1173   ;
1174 sr_conflict:
1175   TK2
1176   | TK2 "tok alias"
1177   ;
1178
1179 %%
1180
1181 ]AT_YYERROR_DEFINE[
1182 ]AT_YYLEX_DEFINE([{ 1, 2, 3, 0 }])[
1183
1184 int
1185 main (void)
1186 {
1187   return yyparse ();
1188 }
1189 ]])
1190 AT_BISON_OPTION_POPDEFS
1191
1192 AT_BISON_CHECK([[-o input.c input.y]], [[0]],,
1193 [[input.y:23.5-19: warning: rule useless in parser due to conflicts: start: start [-Wother]
1194 input.y:27.5-19: warning: rule useless in parser due to conflicts: sr_conflict: TK2 "tok alias" [-Wother]
1195 ]])
1196 AT_COMPILE([[input]])
1197 AT_PARSER_CHECK([[./input]])
1198
1199 AT_CLEANUP
1200
1201
1202
1203 ## --------------------------- ##
1204 ## parse-gram.y: LALR = IELR.  ##
1205 ## --------------------------- ##
1206
1207 # If parse-gram.y's LALR and IELR parser tables ever begin to differ, we
1208 # need to fix parse-gram.y or start using IELR.
1209
1210 AT_SETUP([[parse-gram.y: LALR = IELR]])
1211
1212 # Avoid tests/bison's dark magic by processing a local copy of the
1213 # grammar.  Avoid differences in synclines by telling bison that the
1214 # output files have the same name.
1215 [cp $abs_top_srcdir/src/parse-gram.y input.y]
1216 AT_BISON_CHECK([[-o input.c -Dlr.type=lalr input.y]])
1217 [mv input.c lalr.c]
1218 AT_CAPTURE_FILE([lalr.c])
1219 AT_BISON_CHECK([[-o input.c -Dlr.type=ielr input.y]])
1220 [mv input.c ielr.c]
1221 AT_CAPTURE_FILE([ielr.c])
1222 AT_CHECK([[diff lalr.c ielr.c]], [[0]])
1223
1224 AT_CLEANUP
1225
1226
1227
1228 ## -------------------------------------------- ##
1229 ## parse.error=verbose and YYSTACK_USE_ALLOCA.  ##
1230 ## -------------------------------------------- ##
1231
1232 AT_SETUP([[parse.error=verbose and YYSTACK_USE_ALLOCA]])
1233
1234 AT_BISON_OPTION_PUSHDEFS
1235 AT_DATA_GRAMMAR([input.y],
1236 [[%code {
1237   #include <stdio.h>
1238   ]AT_YYERROR_DECLARE[
1239   ]AT_YYLEX_DECLARE[
1240   #define YYSTACK_USE_ALLOCA 1
1241 }
1242
1243 %define parse.error verbose
1244
1245 %%
1246
1247 start: check syntax_error syntax_error ;
1248
1249 check:
1250 {
1251   if (128 < sizeof yymsgbuf)
1252     {
1253       fprintf (stderr,
1254                "The initial size of yymsgbuf in yyparse has increased\n"
1255                "since this test group was last updated.  As a result,\n"
1256                "this test group may no longer manage to induce a\n"
1257                "reallocation of the syntax error message buffer.\n"
1258                "This test group must be adjusted to produce a longer\n"
1259                "error message.\n");
1260       YYABORT;
1261     }
1262 }
1263 ;
1264
1265 // Induce a syntax error message whose total length is more than
1266 // sizeof yymsgbuf in yyparse.  Each token here is 64 bytes.
1267 syntax_error:
1268   "123456789112345678921234567893123456789412345678951234567896123A"
1269 | "123456789112345678921234567893123456789412345678951234567896123B"
1270 | error 'a' 'b' 'c'
1271 ;
1272
1273 %%
1274
1275 ]AT_YYERROR_DEFINE[
1276   /* Induce two syntax error messages (which requires full error
1277      recovery by shifting 3 tokens) in order to detect any loss of the
1278      reallocated buffer.  */
1279 ]AT_YYLEX_DEFINE(["abc"])[
1280 int
1281 main (void)
1282 {
1283   return yyparse ();
1284 }
1285 ]])
1286 AT_BISON_OPTION_POPDEFS
1287
1288 AT_BISON_CHECK([[-o input.c input.y]])
1289 AT_COMPILE([[input]])
1290 AT_PARSER_CHECK([[./input]], [[1]], [],
1291 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1292 syntax error, unexpected $end, expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B
1293 ]])
1294
1295 AT_CLEANUP
1296
1297
1298
1299 ## ------------------------------ ##
1300 ## parse.error=verbose overflow.  ##
1301 ## ------------------------------ ##
1302
1303 # Imagine the case where YYSTACK_ALLOC_MAXIMUM = YYSIZE_MAXIMUM and an
1304 # invocation of yysyntax_error has caused yymsg_alloc to grow to exactly
1305 # YYSTACK_ALLOC_MAXIMUM (perhaps because the normal doubling of size had
1306 # to be clipped to YYSTACK_ALLOC_MAXIMUM).  In an old version of yacc.c,
1307 # a subsequent invocation of yysyntax_error that overflows during its
1308 # size calculation would return YYSIZE_MAXIMUM to yyparse.  Then,
1309 # yyparse would invoke yyerror using the old contents of yymsg.
1310
1311 AT_SETUP([[parse.error=verbose overflow]])
1312
1313 AT_BISON_OPTION_PUSHDEFS
1314 AT_DATA_GRAMMAR([input.y],
1315 [[%code {
1316   #include <stdio.h>
1317   ]AT_YYERROR_DECLARE[
1318   ]AT_YYLEX_DECLARE[
1319
1320   /* This prevents this test case from having to induce error messages
1321      large enough to overflow size_t.  */
1322   #define YYSIZE_T unsigned char
1323
1324   /* Bring in malloc and set EXIT_SUCCESS so yacc.c doesn't try to
1325      provide a malloc prototype using our YYSIZE_T.  */
1326   #include <stdlib.h>
1327   #ifndef EXIT_SUCCESS
1328   # define EXIT_SUCCESS 0
1329   #endif
1330
1331   /* Max depth is usually much smaller than YYSTACK_ALLOC_MAXIMUM, and
1332      we don't want gcc to warn everywhere this constant would be too big
1333      to make sense for our YYSIZE_T.  */
1334   #define YYMAXDEPTH 100
1335 }
1336
1337 %define parse.error verbose
1338
1339 %%
1340
1341 start: syntax_error1 check syntax_error2 ;
1342
1343 // Induce a syntax error message whose total length causes yymsg in
1344 // yyparse to be reallocated to size YYSTACK_ALLOC_MAXIMUM, which
1345 // should be 255.  Each token here is 64 bytes.
1346 syntax_error1:
1347   "123456789112345678921234567893123456789412345678951234567896123A"
1348 | "123456789112345678921234567893123456789412345678951234567896123B"
1349 | "123456789112345678921234567893123456789412345678951234567896123C"
1350 | error 'a' 'b' 'c'
1351 ;
1352
1353 check:
1354 {
1355   if (yymsg_alloc != YYSTACK_ALLOC_MAXIMUM
1356       || YYSTACK_ALLOC_MAXIMUM != YYSIZE_MAXIMUM
1357       || YYSIZE_MAXIMUM != 255)
1358     {
1359       fprintf (stderr,
1360                "The assumptions of this test group are no longer\n"
1361                "valid, so it may no longer catch the error it was\n"
1362                "designed to catch.  Specifically, the following\n"
1363                "values should all be 255:\n\n");
1364       fprintf (stderr, "  yymsg_alloc = %d\n", yymsg_alloc);
1365       fprintf (stderr, "  YYSTACK_ALLOC_MAXIMUM = %d\n",
1366                YYSTACK_ALLOC_MAXIMUM);
1367       fprintf (stderr, "  YYSIZE_MAXIMUM = %d\n", YYSIZE_MAXIMUM);
1368       YYABORT;
1369     }
1370 }
1371 ;
1372
1373 // Now overflow.
1374 syntax_error2:
1375   "123456789112345678921234567893123456789412345678951234567896123A"
1376 | "123456789112345678921234567893123456789412345678951234567896123B"
1377 | "123456789112345678921234567893123456789412345678951234567896123C"
1378 | "123456789112345678921234567893123456789412345678951234567896123D"
1379 | "123456789112345678921234567893123456789412345678951234567896123E"
1380 ;
1381
1382 %%
1383
1384 ]AT_YYERROR_DEFINE[
1385   /* Induce two syntax error messages (which requires full error
1386      recovery by shifting 3 tokens).  */
1387 ]AT_YYLEX_DEFINE(["abc"])[
1388 int
1389 main (void)
1390 {
1391   /* Push parsers throw away the message buffer between tokens, so skip
1392      this test under maintainer-push-check.  */
1393   if (YYPUSH)
1394     return 77;
1395   return yyparse ();
1396 }
1397 ]])
1398
1399 AT_BISON_CHECK([[-o input.c input.y]])
1400
1401 # gcc warns about tautologies and fallacies involving comparisons for
1402 # unsigned char.  However, it doesn't produce these same warnings for
1403 # size_t and many other types when the warnings would seem to make just
1404 # as much sense.  We ignore the warnings.
1405 [CFLAGS="$NO_WERROR_CFLAGS"]
1406 AT_COMPILE([[input]])
1407
1408 AT_PARSER_CHECK([[./input]], [[2]], [],
1409 [[syntax error, unexpected 'a', expecting 123456789112345678921234567893123456789412345678951234567896123A or 123456789112345678921234567893123456789412345678951234567896123B or 123456789112345678921234567893123456789412345678951234567896123C
1410 syntax error
1411 memory exhausted
1412 ]])
1413 AT_BISON_OPTION_POPDEFS
1414 AT_CLEANUP
1415
1416
1417
1418 ## ------------------------ ##
1419 ## LAC: Exploratory stack.  ##
1420 ## ------------------------ ##
1421
1422 AT_SETUP([[LAC: Exploratory stack]])
1423
1424 m4_pushdef([AT_LAC_CHECK], [
1425
1426 AT_BISON_OPTION_PUSHDEFS([$1])
1427
1428 AT_DATA_GRAMMAR([input.y],
1429 [[%code {
1430   #include <stdio.h>
1431   ]AT_YYERROR_DECLARE[
1432   int yylex (]AT_PURE_IF([[YYSTYPE *]], [[void]])[);
1433 }
1434
1435 ]$1[
1436 %define parse.error verbose
1437 %token 'c'
1438
1439 %%
1440
1441 // default reductions in inconsistent states
1442 // v   v v   v v v v   v v v v v v v
1443 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 ;
1444 //       ^                     ^                               ^
1445 // LAC reallocs
1446
1447 A: 'a' | /*empty*/ { printf ("inconsistent default reduction\n"); } ;
1448 B: 'b' ;
1449 C: /*empty*/ { printf ("consistent default reduction\n"); } ;
1450
1451 %%
1452 ]AT_YYERROR_DEFINE[
1453 int
1454 yylex (]AT_PURE_IF([[YYSTYPE *v]], [[void]])[)
1455 {
1456   static char const *input = "bbbbc";]AT_PURE_IF([[
1457   *v = 0;]])[
1458   return *input++;
1459 }
1460
1461 int
1462 main (void)
1463 {
1464   yydebug = 1;
1465   return yyparse ();
1466 }
1467 ]])
1468
1469 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1470                  -Dparse.lac.memory-trace=full \
1471                  -t -o input.c input.y]], [[0]], [],
1472 [[input.y: warning: 21 shift/reduce conflicts [-Wconflicts-sr]
1473 ]])
1474 AT_COMPILE([[input]])
1475 AT_PARSER_CHECK([[./input > stdout.txt 2> stderr.txt]], [[1]])
1476
1477 # Make sure syntax error doesn't forget that 'a' is expected.  It would
1478 # be forgotten without lookahead correction.
1479 AT_CHECK([[grep 'syntax error,' stderr.txt]], [[0]],
1480 [[syntax error, unexpected 'c', expecting 'a' or 'b'
1481 ]])
1482
1483 # Check number of default reductions in inconsistent states to be sure
1484 # syntax error is detected before unnecessary reductions are performed.
1485 AT_CHECK([[$PERL -0777 -ne 'print s/inconsistent default reduction//g;' \
1486            < stdout.txt || exit 77]], [[0]], [[14]])
1487
1488 # Check number of default reductions in consistent states to be sure
1489 # it is performed before the syntax error is detected.
1490 AT_CHECK([[$PERL -0777 -ne 'print s/\bconsistent default reduction//g;' \
1491            < stdout.txt || exit 77]], [[0]], [[2]])
1492
1493 # Check number of reallocs to be sure reallocated memory isn't somehow
1494 # lost between LAC invocations.
1495 AT_CHECK([[$PERL -0777 -ne 'print s/\(realloc//g;' < stderr.txt \
1496            || exit 77]], [[0]], [[3]])
1497
1498 AT_BISON_OPTION_POPDEFS
1499 ])
1500
1501 AT_LAC_CHECK([[%define api.push-pull pull]])
1502 AT_LAC_CHECK([[%define api.push-pull pull %define api.pure]])
1503 AT_LAC_CHECK([[%define api.push-pull both]])
1504 AT_LAC_CHECK([[%define api.push-pull both %define api.pure]])
1505
1506 m4_popdef([AT_LAC_CHECK])
1507
1508 AT_CLEANUP
1509
1510
1511
1512 ## ------------------------ ##
1513 ## LAC: Memory exhaustion.  ##
1514 ## ------------------------ ##
1515
1516 AT_SETUP([[LAC: Memory exhaustion]])
1517
1518 m4_pushdef([AT_LAC_CHECK],
1519 [AT_BISON_OPTION_PUSHDEFS
1520 AT_DATA_GRAMMAR([input.y],
1521 [[%code {
1522   #include <stdio.h>
1523   ]AT_YYERROR_DECLARE[
1524   ]AT_YYLEX_DECLARE[
1525   #define YYMAXDEPTH 8
1526 }
1527
1528 %error-verbose
1529
1530 %%
1531
1532 S: A A A A A A A A A ;
1533 A: /*empty*/ | 'a' ;
1534
1535 %%
1536 ]AT_YYERROR_DEFINE[
1537 ]AT_YYLEX_DEFINE(["$1"])[
1538 int
1539 main (void)
1540 {
1541   yydebug = 1;
1542   return yyparse ();
1543 }
1544 ]])
1545
1546 AT_BISON_CHECK([[-Dparse.lac=full -Dparse.lac.es-capacity-initial=1 \
1547                  -t -o input.c input.y]], [[0]], [],
1548 [[input.y: warning: 8 shift/reduce conflicts [-Wconflicts-sr]
1549 ]])
1550 AT_COMPILE([[input]])
1551 AT_BISON_OPTION_POPDEFS
1552 ])
1553
1554 # Check for memory exhaustion during parsing.
1555 AT_LAC_CHECK([])
1556 AT_PARSER_CHECK([[./input]], [[2]], [],
1557 [[Starting parse
1558 Entering state 0
1559 Reading a token: Now at end of input.
1560 LAC: initial context established for $end
1561 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1562 memory exhausted
1563 Cleanup: discarding lookahead token $end ()
1564 Stack now 0
1565 ]])
1566
1567 # Induce an immediate syntax error with an undefined token, and check
1568 # for memory exhaustion while building syntax error message.
1569 AT_LAC_CHECK([z], [[0]])
1570 AT_PARSER_CHECK([[./input]], [[2]], [],
1571 [[Starting parse
1572 Entering state 0
1573 Reading a token: Next token is token $undefined ()
1574 LAC: initial context established for $undefined
1575 LAC: checking lookahead $undefined: Always Err
1576 Constructing syntax error message
1577 LAC: checking lookahead $end: R2 G3 R2 G5 R2 G6 R2 G7 R2 G8 R2 G9 R2 G10 R2 G11 R2 (max size exceeded)
1578 syntax error
1579 memory exhausted
1580 Cleanup: discarding lookahead token $undefined ()
1581 Stack now 0
1582 ]])
1583
1584 m4_popdef([AT_LAC_CHECK])
1585
1586 AT_CLEANUP
1587
1588
1589 ## ---------------------- ##
1590 ## Lex and parse params.  ##
1591 ## ---------------------- ##
1592
1593 # AT_TEST(SKELETON)
1594 # -----------------
1595 # Check that the identifier of the params is properly fetched
1596 # even when there are trailing blanks.
1597
1598 m4_pushdef([AT_TEST],
1599 [AT_SETUP([[Lex and parse params: $1]])
1600
1601 AT_BISON_OPTION_PUSHDEFS([%locations %skeleton "$1" %parse-param { int x } %parse-param { int y }])
1602
1603 ## FIXME: Improve parsing of parse-param and use the generated
1604 ## yyerror.
1605 AT_DATA_GRAMMAR([input.y],
1606 [[%defines
1607 %locations
1608 %skeleton "$1"
1609 %union { int ival; }
1610 %parse-param { int x }
1611 // Spaces, tabs, and new lines.
1612 %parse-param { @&t@
1613          int y   @&t@
1614          @&t@
1615  @&t@
1616 }
1617
1618 %{
1619 #include <stdio.h>
1620 #include <stdlib.h>
1621
1622   ]AT_YYERROR_DECLARE[
1623   ]AT_YYLEX_DECLARE[
1624 %}
1625
1626 %%
1627 exp: 'a' { fprintf (stdout, "x: %d, y: %d\n", x, y); };
1628 %%
1629 ]AT_YYERROR_DEFINE[
1630 ]AT_YYLEX_DEFINE(["a"])[
1631
1632 ]AT_SKEL_CC_IF(
1633 [int
1634 yyparse (int x, int y)
1635 {
1636   yy::parser parser(x, y);
1637   return parser.parse ();
1638 }
1639 ])[
1640
1641 int
1642 main (void)
1643 {
1644   return !!yyparse(1, 2);
1645 }
1646 ]])
1647
1648 AT_FULL_COMPILE([input])
1649 AT_PARSER_CHECK([./input], 0, [[x: 1, y: 2
1650 ]])
1651 AT_BISON_OPTION_POPDEFS
1652
1653 AT_CLEANUP
1654 ])
1655
1656 ## FIXME: test Java, and iterate over skeletons.
1657 AT_TEST([yacc.c])
1658 AT_TEST([glr.c])
1659 AT_TEST([lalr1.cc])
1660 AT_TEST([glr.cc])
1661
1662 m4_popdef([AT_TEST])