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