tests/regression.at

   1 # Bison Regressions.                               -*- Autotest -*-
   2 # Copyright (C) 2001, 2002 Free Software Foundation, Inc.
   3
   4 # This program is free software; you can redistribute it and/or modify
   5 # it under the terms of the GNU General Public License as published by
   6 # the Free Software Foundation; either version 2, or (at your option)
   7 # any later version.
   8
   9 # This program is distributed in the hope that it will be useful,
  10 # but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 # GNU General Public License for more details.
  13
  14 # You should have received a copy of the GNU General Public License
  15 # along with this program; if not, write to the Free Software
  16 # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  17 # 02111-1307, USA.
  18
  19 AT_BANNER([[Regression tests.]])
  20
  21
  22 ## ------------------------- ##
  23 ## Early token definitions.  ##
  24 ## ------------------------- ##
  25
  26
  27 AT_SETUP([Early token definitions])
  28
  29 # Found in GCJ: they expect the tokens to be defined before the user
  30 # prologue, so that they can use the token definitions in it.
  31
  32 AT_DATA([input.y],
  33 [[%{
  34 void yyerror (const char *s);
  35 int yylex (void);
  36 %}
  37
  38 %union
  39 {
  40   int val;
  41 };
  42 %{
  43 #ifndef MY_TOKEN
  44 # error "MY_TOKEN not defined."
  45 #endif
  46 %}
  47 %token MY_TOKEN
  48 %%
  49 exp: MY_TOKEN;
  50 %%
  51 ]])
  52
  53 AT_CHECK([bison input.y -o input.c])
  54 AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -c])
  55
  56 AT_CLEANUP
  57
  58
  59
  60 ## ---------------- ##
  61 ## Braces parsing.  ##
  62 ## ---------------- ##
  63
  64
  65 AT_SETUP([Braces parsing])
  66
  67 AT_DATA([input.y],
  68 [[/* Bison used to swallow the character after `}'. */
  69
  70 %%
  71 exp: { tests = {{{{{{{{{{}}}}}}}}}}; };
  72 %%
  73 ]])
  74
  75 AT_CHECK([bison -v input.y -o input.c])
  76
  77 AT_CHECK([fgrep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore])
  78
  79 AT_CLEANUP
  80
  81
  82 ## ------------------ ##
  83 ## Duplicate string.  ##
  84 ## ------------------ ##
  85
  86
  87 AT_SETUP([Duplicate string])
  88
  89 AT_DATA([input.y],
  90 [[/* `Bison -v' used to dump core when two tokens are defined with the same
  91    string, as LE and GE below. */
  92
  93 %token NUM
  94 %token LE "<="
  95 %token GE "<="
  96
  97 %%
  98 exp: '(' exp ')' | NUM ;
  99 %%
 100 ]])
 101
 102 AT_CHECK([bison -v input.y -o input.c], 0, [],
 103 [[input.y:6: warning: symbol `"<="' used more than once as a literal string
 104 ]])
 105
 106 AT_CLEANUP
 107
 108
 109 ## ------------------- ##
 110 ## Rule Line Numbers.  ##
 111 ## ------------------- ##
 112
 113 AT_SETUP([Rule Line Numbers])
 114
 115 AT_KEYWORDS([report])
 116
 117 AT_DATA([input.y],
 118 [[%%
 119 expr:
 120 'a'
 121
 122 {
 123
 124 }
 125
 126 'b'
 127
 128 {
 129
 130 }
 131
 132 |
 133
 134
 135 {
 136
 137
 138 }
 139
 140 'c'
 141
 142 {
 143
 144 };
 145 ]])
 146
 147 AT_CHECK([bison input.y -o input.c -v])
 148
 149 # Check the contents of the report.
 150 AT_CHECK([cat input.output], [],
 151 [[Grammar
 152
 153     0 $axiom: expr $
 154
 155     1 @1: /* empty */
 156
 157     2 expr: 'a' @1 'b'
 158
 159     3 @2: /* empty */
 160
 161     4 expr: @2 'c'
 162
 163
 164 Terminals, with rules where they appear
 165
 166 $ (0) 0
 167 'a' (97) 2
 168 'b' (98) 2
 169 'c' (99) 4
 170 error (256)
 171
 172
 173 Nonterminals, with rules where they appear
 174
 175 $axiom (6)
 176     on left: 0
 177 expr (7)
 178     on left: 2 4, on right: 0
 179 @1 (8)
 180     on left: 1, on right: 2
 181 @2 (9)
 182     on left: 3, on right: 4
 183
 184
 185 state 0
 186
 187     0 $axiom: . expr $
 188
 189     'a'  shift, and go to state 1
 190
 191     $default  reduce using rule 3 (@2)
 192
 193     expr  go to state 2
 194     @2    go to state 3
 195
 196
 197 state 1
 198
 199     2 expr: 'a' . @1 'b'
 200
 201     $default  reduce using rule 1 (@1)
 202
 203     @1  go to state 4
 204
 205
 206 state 2
 207
 208     0 $axiom: expr . $
 209
 210     $  shift, and go to state 5
 211
 212
 213 state 3
 214
 215     4 expr: @2 . 'c'
 216
 217     'c'  shift, and go to state 6
 218
 219
 220 state 4
 221
 222     2 expr: 'a' @1 . 'b'
 223
 224     'b'  shift, and go to state 7
 225
 226
 227 state 5
 228
 229     0 $axiom: expr $ .
 230
 231     $default    accept
 232
 233
 234 state 6
 235
 236     4 expr: @2 'c' .
 237
 238     $default  reduce using rule 4 (expr)
 239
 240
 241 state 7
 242
 243     2 expr: 'a' @1 'b' .
 244
 245     $default  reduce using rule 2 (expr)
 246 ]])
 247
 248 AT_CLEANUP
 249
 250
 251
 252 ## ---------------------- ##
 253 ## Mixing %token styles.  ##
 254 ## ---------------------- ##
 255
 256
 257 AT_SETUP([Mixing %token styles])
 258
 259 # Taken from the documentation.
 260 AT_DATA([input.y],
 261 [[%token  <operator>  OR      "||"
 262 %token  <operator>  LE 134  "<="
 263 %left  OR  "<="
 264 %%
 265 exp: ;
 266 %%
 267 ]])
 268
 269 AT_CHECK([bison -v input.y -o input.c])
 270
 271 AT_CLEANUP
 272
 273
 274
 275 ## ---------------- ##
 276 ## Invalid inputs.  ##
 277 ## ---------------- ##
 278
 279
 280 AT_SETUP([Invalid inputs])
 281
 282 AT_DATA([input.y],
 283 [[%%
 284 ?
 285 default: 'a' }
 286 %&
 287 %a
 288 %-
 289 %{
 290 ]])
 291
 292 AT_CHECK([bison input.y], [1], [],
 293 [[input.y:2.1: invalid character: `?'
 294 input.y:3.14: invalid character: `}'
 295 input.y:4.1: invalid character: `%'
 296 input.y:4.2: invalid character: `&'
 297 input.y:5.1: invalid character: `%'
 298 input.y:6.1: invalid character: `%'
 299 input.y:6.2: invalid character: `-'
 300 input.y:7.1-8.0: unexpected end of file in a prologue
 301 input.y:7.1-8.0: parse error, unexpected PROLOGUE, expecting ";" or "|"
 302 input.y:5.2: symbol a is used, but is not defined as a token and has no rules
 303 ]])
 304
 305 AT_CLEANUP
 306
 307
 308
 309 ## ------------------- ##
 310 ## Token definitions.  ##
 311 ## ------------------- ##
 312
 313
 314 AT_SETUP([Token definitions])
 315
 316 # Bison managed, when fed with `%token 'f' "f"' to #define 'f'!
 317 AT_DATA([input.y],
 318 [%{
 319 void yyerror (const char *s);
 320 int yylex (void);
 321 %}
 322 [%token YYEOF 0 "end of file"
 323 %token 'a' "a"
 324 %token b "b"
 325 %token c 'c'
 326 %token 'd' d
 327 %%
 328 exp: "a";
 329 ]])
 330
 331 AT_CHECK([bison input.y -o input.c])
 332 AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -c])
 333 AT_CLEANUP
 334
 335
 336
 337 ## -------------- ##
 338 ## Web2c Report.  ##
 339 ## -------------- ##
 340
 341 # The generation of the reduction was once wrong in Bison, and made it
 342 # miss some reductions.  In the following test case, the reduction on
 343 # `undef_id_tok' in state 1 was missing.  This is stripped down from
 344 # the actual web2c.y.
 345
 346 AT_SETUP([Web2c Report])
 347
 348 AT_KEYWORDS([report])
 349
 350 AT_DATA([input.y],
 351 [[%token        undef_id_tok const_id_tok
 352
 353 %start CONST_DEC_PART
 354 \f
 355 %%
 356 CONST_DEC_PART:
 357          CONST_DEC_LIST
 358         ;
 359
 360 CONST_DEC_LIST:
 361           CONST_DEC
 362         | CONST_DEC_LIST CONST_DEC
 363         ;
 364
 365 CONST_DEC:
 366           { } undef_id_tok '=' const_id_tok ';'
 367         ;
 368 %%
 369 ]])
 370
 371 AT_CHECK([bison -v input.y])
 372 AT_CHECK([cat input.output], 0,
 373 [[Grammar
 374
 375     0 $axiom: CONST_DEC_PART $
 376
 377     1 CONST_DEC_PART: CONST_DEC_LIST
 378
 379     2 CONST_DEC_LIST: CONST_DEC
 380     3               | CONST_DEC_LIST CONST_DEC
 381
 382     4 @1: /* empty */
 383
 384     5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';'
 385
 386
 387 Terminals, with rules where they appear
 388
 389 $ (0) 0
 390 ';' (59) 5
 391 '=' (61) 5
 392 error (256)
 393 undef_id_tok (258) 5
 394 const_id_tok (259) 5
 395
 396
 397 Nonterminals, with rules where they appear
 398
 399 $axiom (7)
 400     on left: 0
 401 CONST_DEC_PART (8)
 402     on left: 1, on right: 0
 403 CONST_DEC_LIST (9)
 404     on left: 2 3, on right: 1 3
 405 CONST_DEC (10)
 406     on left: 5, on right: 2 3
 407 @1 (11)
 408     on left: 4, on right: 5
 409
 410
 411 state 0
 412
 413     0 $axiom: . CONST_DEC_PART $
 414
 415     $default  reduce using rule 4 (@1)
 416
 417     CONST_DEC_PART  go to state 1
 418     CONST_DEC_LIST  go to state 2
 419     CONST_DEC       go to state 3
 420     @1              go to state 4
 421
 422
 423 state 1
 424
 425     0 $axiom: CONST_DEC_PART . $
 426
 427     $  shift, and go to state 5
 428
 429
 430 state 2
 431
 432     1 CONST_DEC_PART: CONST_DEC_LIST .
 433     3 CONST_DEC_LIST: CONST_DEC_LIST . CONST_DEC
 434
 435     undef_id_tok  reduce using rule 4 (@1)
 436     $default      reduce using rule 1 (CONST_DEC_PART)
 437
 438     CONST_DEC  go to state 6
 439     @1         go to state 4
 440
 441
 442 state 3
 443
 444     2 CONST_DEC_LIST: CONST_DEC .
 445
 446     $default  reduce using rule 2 (CONST_DEC_LIST)
 447
 448
 449 state 4
 450
 451     5 CONST_DEC: @1 . undef_id_tok '=' const_id_tok ';'
 452
 453     undef_id_tok  shift, and go to state 7
 454
 455
 456 state 5
 457
 458     0 $axiom: CONST_DEC_PART $ .
 459
 460     $default    accept
 461
 462
 463 state 6
 464
 465     3 CONST_DEC_LIST: CONST_DEC_LIST CONST_DEC .
 466
 467     $default  reduce using rule 3 (CONST_DEC_LIST)
 468
 469
 470 state 7
 471
 472     5 CONST_DEC: @1 undef_id_tok . '=' const_id_tok ';'
 473
 474     '='  shift, and go to state 8
 475
 476
 477 state 8
 478
 479     5 CONST_DEC: @1 undef_id_tok '=' . const_id_tok ';'
 480
 481     const_id_tok  shift, and go to state 9
 482
 483
 484 state 9
 485
 486     5 CONST_DEC: @1 undef_id_tok '=' const_id_tok . ';'
 487
 488     ';'  shift, and go to state 10
 489
 490
 491 state 10
 492
 493     5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';' .
 494
 495     $default  reduce using rule 5 (CONST_DEC)
 496 ]])
 497
 498 AT_CLEANUP
 499
 500
 501 ## --------------- ##
 502 ## Web2c Actions.  ##
 503 ## --------------- ##
 504
 505 # The generation of the mapping `state -> action' was once wrong in
 506 # extremely specific situations.  web2c.y exhibits this situation.
 507 # Below is a stripped version of the grammar.  It looks like one can
 508 # simplify it further, but just don't: it is tuned to exhibit a bug,
 509 # which disapears when applying sane grammar transformations.
 510 #
 511 # It used to be wrong on yydefact only:
 512 #
 513 # static const short yydefact[] =
 514 #  {
 515 # -       2,     0,     1,     0,     0,     2,     3,     2,     5,     4,
 516 # +       2,     0,     1,     0,     0,     0,     3,     2,     5,     4,
 517 #         0,     0
 518 #  };
 519 #
 520 # but let's check all the tables.
 521
 522
 523 AT_SETUP([Web2c Actions])
 524
 525 AT_KEYWORDS([report])
 526
 527 AT_DATA([input.y],
 528 [[%%
 529 statement:  struct_stat;
 530 struct_stat:  /* empty. */ | if else;
 531 if: "if" "const" "then" statement;
 532 else: "else" statement;
 533 %%
 534 ]])
 535
 536 AT_CHECK([bison -v input.y -o input.c])
 537
 538 # Check only the tables.  We don't use --no-parser, because it is
 539 # still to be implemented in the experimental branch of Bison.
 540 [sed -n 's/  *$//;/^static const.*\[\] =/,/^}/p' input.c >tables.c]
 541
 542 AT_CHECK([[cat tables.c]], 0,
 543 [[static const unsigned char yytranslate[] =
 544 {
 545        0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 546        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 547        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 548        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 549        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 550        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 551        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 552        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 553        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 554        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 555        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 556        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 557        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 558        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 559        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 560        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 561        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 562        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 563        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 564        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 565        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 566        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 567        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 568        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 569        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 570        2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
 571        5,     6
 572 };
 573 static const unsigned char yyprhs[] =
 574 {
 575        0,     0,     3,     5,     6,     9,    14
 576 };
 577 static const signed char yyrhs[] =
 578 {
 579        8,     0,    -1,     9,    -1,    -1,    10,    11,    -1,     3,
 580        4,     5,     8,    -1,     6,     8,    -1
 581 };
 582 static const unsigned char yyrline[] =
 583 {
 584        0,     2,     2,     3,     3,     4,     5
 585 };
 586 static const char *const yytname[] =
 587 {
 588   "$", "error", "$undefined.", "\"if\"", "\"const\"", "\"then\"",
 589   "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", 0
 590 };
 591 static const short yytoknum[] =
 592 {
 593        0,   256,   257,   258,   259,   260,   261,    -1
 594 };
 595 static const unsigned char yyr1[] =
 596 {
 597        0,     7,     8,     9,     9,    10,    11
 598 };
 599 static const unsigned char yyr2[] =
 600 {
 601        0,     2,     1,     0,     2,     4,     2
 602 };
 603 static const short yydefact[] =
 604 {
 605        3,     0,     0,     2,     0,     0,     0,     3,     4,     3,
 606        6,     5
 607 };
 608 static const short yydefgoto[] =
 609 {
 610       -1,     2,     3,     4,     8
 611 };
 612 static const short yypact[] =
 613 {
 614       -2,    -1,     4,-32768,     0,     2,-32768,    -2,-32768,    -2,
 615   -32768,-32768
 616 };
 617 static const short yypgoto[] =
 618 {
 619   -32768,    -7,-32768,-32768,-32768
 620 };
 621 static const short yytable[] =
 622 {
 623       10,     1,    11,     5,     6,     0,     7,     9
 624 };
 625 static const short yycheck[] =
 626 {
 627        7,     3,     9,     4,     0,    -1,     6,     5
 628 };
 629 static const unsigned char yystos[] =
 630 {
 631        0,     3,     8,     9,    10,     4,     0,     6,    11,     5,
 632        8,     8
 633 };
 634 ]])
 635
 636 AT_CLEANUP