tests/regression.at

   1 # Bison Regressions.                               -*- Autotest -*-
   2 # Copyright 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 ## Braces parsing.  ##
  24 ## ---------------- ##
  25
  26
  27 AT_SETUP([braces parsing])
  28
  29 AT_DATA([input.y],
  30 [[/* Bison used to swallow the character after `}'. */
  31
  32 %%
  33 exp: { tests = {{{{{{{{{{}}}}}}}}}}; };
  34 %%
  35 ]])
  36
  37 AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
  38
  39 AT_CHECK([fgrep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore])
  40
  41 AT_CLEANUP
  42
  43
  44 ## ------------------ ##
  45 ## Duplicate string.  ##
  46 ## ------------------ ##
  47
  48
  49 AT_SETUP([Duplicate string])
  50
  51 AT_DATA([input.y],
  52 [[/* `Bison -v' used to dump core when two tokens are defined with the same
  53    string, as LE and GE below. */
  54
  55 %token NUM
  56 %token LE "<="
  57 %token GE "<="
  58
  59 %%
  60 exp: '(' exp ')' | NUM ;
  61 %%
  62 ]])
  63
  64 AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
  65
  66 AT_CLEANUP
  67
  68
  69 ## ------------------- ##
  70 ## Rule Line Numbers.  ##
  71 ## ------------------- ##
  72
  73 AT_SETUP([Rule Line Numbers])
  74
  75 AT_DATA([input.y],
  76 [[%%
  77 expr:
  78 'a'
  79
  80 {
  81
  82 }
  83
  84 'b'
  85
  86 {
  87
  88 }
  89
  90 |
  91
  92
  93 {
  94
  95
  96 }
  97
  98 'c'
  99
 100 {
 101
 102 };
 103 ]])
 104
 105 AT_CHECK([bison input.y -o input.c -v], 0, [], [])
 106
 107 # Check the contents of the report.
 108 AT_CHECK([cat input.output], [],
 109 [[Grammar
 110
 111   Number, Line, Rule
 112     0   2 $axiom -> expr $
 113     1   2 @1 -> /* empty */
 114     2   2 expr -> 'a' @1 'b'
 115     3  15 @2 -> /* empty */
 116     4  15 expr -> @2 'c'
 117
 118
 119 Terminals, with rules where they appear
 120
 121 $ (0) 0
 122 'a' (97) 2
 123 'b' (98) 2
 124 'c' (99) 4
 125 error (256)
 126
 127
 128 Nonterminals, with rules where they appear
 129
 130 $axiom (6)
 131     on left: 0
 132 expr (7)
 133     on left: 2 4, on right: 0
 134 @1 (8)
 135     on left: 1, on right: 2
 136 @2 (9)
 137     on left: 3, on right: 4
 138
 139
 140 state 0
 141
 142     $axiom  ->  . expr $   (rule 0)
 143
 144     'a'         shift, and go to state 1
 145
 146     $default    reduce using rule 3 (@2)
 147
 148     expr        go to state 2
 149     @2          go to state 3
 150
 151
 152
 153 state 1
 154
 155     expr  ->  'a' . @1 'b'   (rule 2)
 156
 157     $default    reduce using rule 1 (@1)
 158
 159     @1          go to state 4
 160
 161
 162
 163 state 2
 164
 165     $axiom  ->  expr . $   (rule 0)
 166
 167     $           shift, and go to state 5
 168
 169
 170
 171 state 3
 172
 173     expr  ->  @2 . 'c'   (rule 4)
 174
 175     'c'         shift, and go to state 6
 176
 177
 178
 179 state 4
 180
 181     expr  ->  'a' @1 . 'b'   (rule 2)
 182
 183     'b'         shift, and go to state 7
 184
 185
 186
 187 state 5
 188
 189     $axiom  ->  expr $ .   (rule 0)
 190
 191     $default    accept
 192
 193
 194 state 6
 195
 196     expr  ->  @2 'c' .   (rule 4)
 197
 198     $default    reduce using rule 4 (expr)
 199
 200
 201
 202 state 7
 203
 204     expr  ->  'a' @1 'b' .   (rule 2)
 205
 206     $default    reduce using rule 2 (expr)
 207
 208
 209
 210 ]])
 211
 212 AT_CLEANUP
 213
 214
 215
 216 ## ---------------------- ##
 217 ## Mixing %token styles.  ##
 218 ## ---------------------- ##
 219
 220
 221 AT_SETUP([Mixing %token styles])
 222
 223 # Taken from the documentation.
 224 AT_DATA([input.y],
 225 [[%token  <operator>  OR      "||"
 226 %token  <operator>  LE 134  "<="
 227 %left  OR  "<="
 228 %%
 229 exp: ;
 230 %%
 231 ]])
 232
 233 AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
 234
 235 AT_CLEANUP
 236
 237
 238
 239 ## ---------------- ##
 240 ## Invalid inputs.  ##
 241 ## ---------------- ##
 242
 243
 244 AT_SETUP([Invalid inputs])
 245
 246 AT_DATA([input.y],
 247 [[%%
 248 ?
 249 default: 'a' }
 250 %{
 251 %&
 252 %a
 253 %-
 254 ]])
 255
 256 AT_CHECK([bison input.y], [1], [],
 257 [[input.y:2: invalid input: `?'
 258 input.y:3: invalid input: `}'
 259 input.y:4: invalid input: `%{'
 260 input.y:5: invalid input: `%&'
 261 input.y:6: invalid input: `%a'
 262 input.y:7: invalid input: `%-'
 263 ]])
 264
 265 AT_CLEANUP
 266
 267
 268
 269 ## -------------------- ##
 270 ## Invalid %directive.  ##
 271 ## -------------------- ##
 272
 273
 274 AT_SETUP([Invalid %directive])
 275
 276 AT_DATA([input.y],
 277 [[%invalid
 278 ]])
 279
 280 AT_CHECK([bison input.y], [1], [],
 281 [[input.y:1: unrecognized: %invalid
 282 input.y:1:    Skipping to next %
 283 input.y:2: fatal error: no input grammar
 284 ]])
 285
 286 AT_CLEANUP
 287
 288
 289
 290 ## ------------------- ##
 291 ## Token definitions.  ##
 292 ## ------------------- ##
 293
 294
 295 AT_SETUP([Token definitions])
 296
 297 # Bison managed, when fed with `%token 'f' "f"' to #define 'f'!
 298 AT_DATA([input.y],
 299 [%{
 300 void yyerror (const char *s);
 301 int yylex (void);
 302 %}
 303 [%token "end of file"
 304 %token 'a' "a"
 305 %token "b" 'b'
 306 %token "c" c
 307 %token d "d"
 308 %token e 'e'
 309 %token 'f' e
 310 %%
 311 exp: "a";
 312 ]])
 313
 314 AT_CHECK([bison input.y -o input.c])
 315 AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -c])
 316 AT_CLEANUP
 317
 318
 319
 320 ## -------------- ##
 321 ## Web2c Report.  ##
 322 ## -------------- ##
 323
 324 # The generation of the reduction was once wrong in Bison, and made it
 325 # miss some reductions.  In the following test case, the reduction on
 326 # `undef_id_tok' in state 1 was missing.  This is stripped down from
 327 # the actual web2c.y.
 328
 329 AT_SETUP([Web2c Report])
 330
 331 AT_DATA([input.y],
 332 [[%token        undef_id_tok const_id_tok
 333
 334 %start CONST_DEC_PART
 335 \f
 336 %%
 337 CONST_DEC_PART:
 338          CONST_DEC_LIST
 339         ;
 340
 341 CONST_DEC_LIST:
 342           CONST_DEC
 343         | CONST_DEC_LIST CONST_DEC
 344         ;
 345
 346 CONST_DEC:
 347           { } undef_id_tok '=' const_id_tok ';'
 348         ;
 349 %%
 350
 351 ]])
 352
 353 AT_CHECK([bison -v input.y])
 354
 355 AT_CHECK([sed -n 's/  *$//;/^$/!p' input.output], 0,
 356 [[Grammar
 357   Number, Line, Rule
 358     0   6 $axiom -> CONST_DEC_PART $
 359     1   6 CONST_DEC_PART -> CONST_DEC_LIST
 360     2  10 CONST_DEC_LIST -> CONST_DEC
 361     3  12 CONST_DEC_LIST -> CONST_DEC_LIST CONST_DEC
 362     4  15 @1 -> /* empty */
 363     5  15 CONST_DEC -> @1 undef_id_tok '=' const_id_tok ';'
 364 Terminals, with rules where they appear
 365 $ (0) 0
 366 ';' (59) 5
 367 '=' (61) 5
 368 error (256)
 369 undef_id_tok (258) 5
 370 const_id_tok (259) 5
 371 Nonterminals, with rules where they appear
 372 $axiom (7)
 373     on left: 0
 374 CONST_DEC_PART (8)
 375     on left: 1, on right: 0
 376 CONST_DEC_LIST (9)
 377     on left: 2 3, on right: 1 3
 378 CONST_DEC (10)
 379     on left: 5, on right: 2 3
 380 @1 (11)
 381     on left: 4, on right: 5
 382 state 0
 383     $axiom  ->  . CONST_DEC_PART $   (rule 0)
 384     $default    reduce using rule 4 (@1)
 385     CONST_DEC_PART      go to state 1
 386     CONST_DEC_LIST      go to state 2
 387     CONST_DEC   go to state 3
 388     @1          go to state 4
 389 state 1
 390     $axiom  ->  CONST_DEC_PART . $   (rule 0)
 391     $           shift, and go to state 5
 392 state 2
 393     CONST_DEC_PART  ->  CONST_DEC_LIST .   (rule 1)
 394     CONST_DEC_LIST  ->  CONST_DEC_LIST . CONST_DEC   (rule 3)
 395     undef_id_tok        reduce using rule 4 (@1)
 396     $default    reduce using rule 1 (CONST_DEC_PART)
 397     CONST_DEC   go to state 6
 398     @1          go to state 4
 399 state 3
 400     CONST_DEC_LIST  ->  CONST_DEC .   (rule 2)
 401     $default    reduce using rule 2 (CONST_DEC_LIST)
 402 state 4
 403     CONST_DEC  ->  @1 . undef_id_tok '=' const_id_tok ';'   (rule 5)
 404     undef_id_tok        shift, and go to state 7
 405 state 5
 406     $axiom  ->  CONST_DEC_PART $ .   (rule 0)
 407     $default    accept
 408 state 6
 409     CONST_DEC_LIST  ->  CONST_DEC_LIST CONST_DEC .   (rule 3)
 410     $default    reduce using rule 3 (CONST_DEC_LIST)
 411 state 7
 412     CONST_DEC  ->  @1 undef_id_tok . '=' const_id_tok ';'   (rule 5)
 413     '='         shift, and go to state 8
 414 state 8
 415     CONST_DEC  ->  @1 undef_id_tok '=' . const_id_tok ';'   (rule 5)
 416     const_id_tok        shift, and go to state 9
 417 state 9
 418     CONST_DEC  ->  @1 undef_id_tok '=' const_id_tok . ';'   (rule 5)
 419     ';'         shift, and go to state 10
 420 state 10
 421     CONST_DEC  ->  @1 undef_id_tok '=' const_id_tok ';' .   (rule 5)
 422     $default    reduce using rule 5 (CONST_DEC)
 423 ]])
 424
 425 AT_CLEANUP
 426
 427
 428 ## --------------- ##
 429 ## Web2c Actions.  ##
 430 ## --------------- ##
 431
 432 # The generation of the mapping `state -> action' was once wrong in
 433 # extremely specific situations.  web2c.y exhibits this situation.
 434 # Below is a stripped version of the grammar.  It looks like one can
 435 # simplify it further, but just don't: it is tuned to exhibit a bug,
 436 # which disapears when applying sane grammar transformations.
 437 #
 438 # It used to be wrong on yydefact only:
 439 #
 440 # static const short yydefact[] =
 441 #  {
 442 # -       2,     0,     1,     0,     0,     2,     3,     2,     5,     4,
 443 # +       2,     0,     1,     0,     0,     0,     3,     2,     5,     4,
 444 #         0,     0
 445 #  };
 446 #
 447 # but let's check all the tables.
 448
 449
 450 AT_SETUP([Web2c Actions])
 451
 452 AT_DATA([input.y],
 453 [[%%
 454 statement:  struct_stat;
 455 struct_stat:  /* empty. */ | if else;
 456 if: "if" "const" "then" statement;
 457 else: "else" statement;
 458 %%
 459 ]])
 460
 461 AT_CHECK([bison -v input.y -o input.c])
 462
 463 # Check only the tables.  We don't use --no-parser, because it is
 464 # still to be implemented in the experimental branch of Bison.
 465 AT_CHECK([[sed -n 's/  *$//;/^static const.*\[\] =/,/^}/p' input.c]], 0,
 466 [[static const unsigned char yytranslate[] =
 467 {
 468        0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 469        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 470        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 471        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 472        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 473        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 474        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 475        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 476        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 477        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 478        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 479        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 480        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 481        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 482        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 483        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 484        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 485        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 486        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 487        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 488        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 489        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 490        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 491        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 492        2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
 493        2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
 494        5,     6
 495 };
 496 static const unsigned char yyprhs[] =
 497 {
 498        0,     0,     3,     5,     6,     9,    14
 499 };
 500 static const signed char yyrhs[] =
 501 {
 502        8,     0,    -1,     9,    -1,    -1,    10,    11,    -1,     3,
 503        4,     5,     8,    -1,     6,     8,    -1
 504 };
 505 static const unsigned char yyrline[] =
 506 {
 507        0,     2,     2,     3,     3,     4,     5
 508 };
 509 static const char *const yytname[] =
 510 {
 511   "$", "error", "$undefined.", "\"if\"", "\"const\"", "\"then\"",
 512   "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", 0
 513 };
 514 static const short yytoknum[] =
 515 {
 516        0,   256,   257,   258,   259,   260,   261,    -1
 517 };
 518 static const unsigned char yyr1[] =
 519 {
 520        0,     7,     8,     9,     9,    10,    11
 521 };
 522 static const unsigned char yyr2[] =
 523 {
 524        0,     2,     1,     0,     2,     4,     2
 525 };
 526 static const short yydefact[] =
 527 {
 528        3,     0,     0,     2,     0,     0,     0,     3,     4,     3,
 529        6,     5
 530 };
 531 static const short yydefgoto[] =
 532 {
 533       -1,     2,     3,     4,     8
 534 };
 535 static const short yypact[] =
 536 {
 537       -2,    -1,     4,-32768,     0,     2,-32768,    -2,-32768,    -2,
 538   -32768,-32768
 539 };
 540 static const short yypgoto[] =
 541 {
 542   -32768,    -7,-32768,-32768,-32768
 543 };
 544 static const short yytable[] =
 545 {
 546       10,     1,    11,     5,     6,     0,     7,     9
 547 };
 548 static const short yycheck[] =
 549 {
 550        7,     3,     9,     4,     0,    -1,     6,     5
 551 };
 552 ]])
 553
 554 AT_CLEANUP