X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/c73a41af8e332ef9736dc29be99f0b6c251e6c01..87675353bfb6d024d99d0b0298e65c9897600706:/tests/regression.at diff --git a/tests/regression.at b/tests/regression.at index 2a60d27c..48c111c0 100644 --- a/tests/regression.at +++ b/tests/regression.at @@ -1,5 +1,5 @@ # Bison Regressions. -*- Autotest -*- -# Copyright 2001 Free Software Foundation, Inc. +# Copyright (C) 2001, 2002 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by @@ -18,6 +18,67 @@ AT_BANNER([[Regression tests.]]) + +## ------------------------- ## +## Early token definitions. ## +## ------------------------- ## + + +AT_SETUP([Early token definitions]) + +# Found in GCJ: they expect the tokens to be defined before the user +# prologue, so that they can use the token definitions in it. + +AT_DATA([input.y], +[[%{ +void yyerror (const char *s); +int yylex (void); +%} + +%union +{ + int val; +}; +%{ +#ifndef MY_TOKEN +# error "MY_TOKEN not defined." +#endif +%} +%token MY_TOKEN +%% +exp: MY_TOKEN; +%% +]]) + +AT_CHECK([bison input.y -o input.c]) +AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -c]) + +AT_CLEANUP + + + +## ---------------- ## +## Braces parsing. ## +## ---------------- ## + + +AT_SETUP([Braces parsing]) + +AT_DATA([input.y], +[[/* Bison used to swallow the character after `}'. */ + +%% +exp: { tests = {{{{{{{{{{}}}}}}}}}}; }; +%% +]]) + +AT_CHECK([bison -v input.y -o input.c]) + +AT_CHECK([fgrep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore]) + +AT_CLEANUP + + ## ------------------ ## ## Duplicate string. ## ## ------------------ ## @@ -25,7 +86,7 @@ AT_BANNER([[Regression tests.]]) AT_SETUP([Duplicate string]) -AT_DATA([duplicate.y], +AT_DATA([input.y], [[/* `Bison -v' used to dump core when two tokens are defined with the same string, as LE and GE below. */ @@ -38,108 +99,154 @@ exp: '(' exp ')' | NUM ; %% ]]) -AT_CHECK([bison -v duplicate.y -o duplicate.c], 0, ignore, ignore) +AT_CHECK([bison -v input.y -o input.c], 0, [], +[[input.y:6: warning: symbol `"<="' used more than once as a literal string +]]) + +AT_CLEANUP -AT_CLEANUP([duplicate.*]) +## ------------------- ## +## Rule Line Numbers. ## +## ------------------- ## -## ----------- ## -## Conflicts. ## -## ----------- ## +AT_SETUP([Rule Line Numbers]) -AT_SETUP([Conflicts]) +AT_KEYWORDS([report]) AT_DATA([input.y], -[[%token NUM OP -%% -exp: exp OP exp | NUM; +[[%% +expr: +'a' + +{ + +} + +'b' + +{ + +} + +| + + +{ + + +} + +'c' + +{ + +}; ]]) -AT_CHECK([bison input.y -o input.c -v], 0, [], -[input.y contains 1 shift/reduce conflict. -]) +AT_CHECK([bison input.y -o input.c -v]) # Check the contents of the report. AT_CHECK([cat input.output], [], -[[State 4 contains 1 shift/reduce conflict. +[[Grammar + + 0 $axiom: expr $ + + 1 @1: /* empty */ + + 2 expr: 'a' @1 'b' -Grammar + 3 @2: /* empty */ + + 4 expr: @2 'c' -rule 1 exp -> exp OP exp -rule 2 exp -> NUM Terminals, with rules where they appear -$ (-1) +$ (0) 0 +'a' (97) 2 +'b' (98) 2 +'c' (99) 4 error (256) -NUM (257) 2 -OP (258) 1 + Nonterminals, with rules where they appear -exp (5) - on left: 1 2, on right: 1 +$axiom (6) + on left: 0 +expr (7) + on left: 2 4, on right: 0 +@1 (8) + on left: 1, on right: 2 +@2 (9) + on left: 3, on right: 4 state 0 - NUM shift, and go to state 1 + 0 $axiom: . expr $ + + 'a' shift, and go to state 1 - exp go to state 2 + $default reduce using rule 3 (@2) + expr go to state 2 + @2 go to state 3 state 1 - exp -> NUM . (rule 2) + 2 expr: 'a' . @1 'b' - $default reduce using rule 2 (exp) + $default reduce using rule 1 (@1) + @1 go to state 4 state 2 - exp -> exp . OP exp (rule 1) - - $ go to state 5 - OP shift, and go to state 3 + 0 $axiom: expr . $ + $ shift, and go to state 5 state 3 - exp -> exp OP . exp (rule 1) + 4 expr: @2 . 'c' - NUM shift, and go to state 1 + 'c' shift, and go to state 6 - exp go to state 4 +state 4 + 2 expr: 'a' @1 . 'b' -state 4 + 'b' shift, and go to state 7 - exp -> exp . OP exp (rule 1) - exp -> exp OP exp . (rule 1) - OP shift, and go to state 3 +state 5 - OP [reduce using rule 1 (exp)] - $default reduce using rule 1 (exp) + 0 $axiom: expr $ . + $default accept -state 5 +state 6 - $ go to state 6 + 4 expr: @2 'c' . + $default reduce using rule 4 (expr) -state 6 +state 7 - $default accept + 2 expr: 'a' @1 'b' . + + $default reduce using rule 2 (expr) ]]) -AT_CLEANUP(input.c input.output) +AT_CLEANUP + ## ---------------------- ## @@ -159,124 +266,371 @@ exp: ; %% ]]) -AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore) +AT_CHECK([bison -v input.y -o input.c]) -AT_CLEANUP([input.*]) +AT_CLEANUP -## ---------------------- ## -## %union and --defines. ## -## ---------------------- ## +## ---------------- ## +## Invalid inputs. ## +## ---------------- ## -AT_SETUP([%union and --defines]) +AT_SETUP([Invalid inputs]) -AT_DATA([union.y], -[%union -{ - int integer; - char *string ; -} -%% -exp: {}; -]) +AT_DATA([input.y], +[[%% +? +default: 'a' } +%& +%a +%- +%{ +]]) -AT_CHECK([bison --defines union.y]) +AT_CHECK([bison input.y], [1], [], +[[input.y:2.1: invalid character: `?' +input.y:3.14: invalid character: `}' +input.y:4.1: invalid character: `%' +input.y:4.2: invalid character: `&' +input.y:5.1: invalid character: `%' +input.y:6.1: invalid character: `%' +input.y:6.2: invalid character: `-' +input.y:7.1-8.0: unexpected end of file in a prologue +input.y:7.1-8.0: parse error, unexpected PROLOGUE, expecting ";" or "|" +input.y:5.2: symbol a is used, but is not defined as a token and has no rules +]]) -AT_CLEANUP([union.*]) +AT_CLEANUP -## --------------------------------------- ## -## Duplicate '/' in C comments in %union ## -## --------------------------------------- ## +## ------------------- ## +## Token definitions. ## +## ------------------- ## -AT_SETUP([%union and C comments]) -AT_DATA([union-comment.y], -[%union -{ - /* The int. */ int integer; - /* The string. */ char *string ; -} +AT_SETUP([Token definitions]) + +# Bison managed, when fed with `%token 'f' "f"' to #define 'f'! +AT_DATA([input.y], +[%{ +void yyerror (const char *s); +int yylex (void); +%} +[%token YYEOF 0 "end of file" +%token 'a' "a" +%token b "b" +%token c 'c' +%token 'd' d %% -exp: {}; -]) +exp: "a"; +]]) + +AT_CHECK([bison input.y -o input.c]) +AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -c]) +AT_CLEANUP -AT_CHECK([bison union-comment.y]) -AT_CHECK([fgrep '//*' union-comment.tab.c], [1], []) -AT_CLEANUP([union-comment.*]) +## -------------- ## +## Web2c Report. ## +## -------------- ## -## ----------------- ## -## Invalid input 1. ## -## ----------------- ## +# The generation of the reduction was once wrong in Bison, and made it +# miss some reductions. In the following test case, the reduction on +# `undef_id_tok' in state 1 was missing. This is stripped down from +# the actual web2c.y. +AT_SETUP([Web2c Report]) -AT_SETUP([Invalid input: 1]) +AT_KEYWORDS([report]) AT_DATA([input.y], -[[%% -? +[[%token undef_id_tok const_id_tok + +%start CONST_DEC_PART + +%% +CONST_DEC_PART: + CONST_DEC_LIST + ; + +CONST_DEC_LIST: + CONST_DEC + | CONST_DEC_LIST CONST_DEC + ; + +CONST_DEC: + { } undef_id_tok '=' const_id_tok ';' + ; +%% ]]) -AT_CHECK([bison input.y], [1], [], -[input.y:2: invalid input: `?' -input.y:3: fatal error: no rules in the input grammar -]) +AT_CHECK([bison -v input.y]) +AT_CHECK([cat input.output], 0, +[[Grammar -AT_CLEANUP + 0 $axiom: CONST_DEC_PART $ + 1 CONST_DEC_PART: CONST_DEC_LIST -## ----------------- ## -## Invalid input 2. ## -## ----------------- ## + 2 CONST_DEC_LIST: CONST_DEC + 3 | CONST_DEC_LIST CONST_DEC + 4 @1: /* empty */ -AT_SETUP([Invalid input: 2]) + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';' -AT_DATA([input.y], -[[%% -default: 'a' } -]]) -AT_CHECK([bison input.y], [1], [], -[input.y:2: invalid input: `}' -]) +Terminals, with rules where they appear + +$ (0) 0 +';' (59) 5 +'=' (61) 5 +error (256) +undef_id_tok (258) 5 +const_id_tok (259) 5 + + +Nonterminals, with rules where they appear + +$axiom (7) + on left: 0 +CONST_DEC_PART (8) + on left: 1, on right: 0 +CONST_DEC_LIST (9) + on left: 2 3, on right: 1 3 +CONST_DEC (10) + on left: 5, on right: 2 3 +@1 (11) + on left: 4, on right: 5 + + +state 0 + + 0 $axiom: . CONST_DEC_PART $ + + $default reduce using rule 4 (@1) + + CONST_DEC_PART go to state 1 + CONST_DEC_LIST go to state 2 + CONST_DEC go to state 3 + @1 go to state 4 + + +state 1 + + 0 $axiom: CONST_DEC_PART . $ + + $ shift, and go to state 5 + + +state 2 + + 1 CONST_DEC_PART: CONST_DEC_LIST . + 3 CONST_DEC_LIST: CONST_DEC_LIST . CONST_DEC + + undef_id_tok reduce using rule 4 (@1) + $default reduce using rule 1 (CONST_DEC_PART) + + CONST_DEC go to state 6 + @1 go to state 4 + + +state 3 + + 2 CONST_DEC_LIST: CONST_DEC . + + $default reduce using rule 2 (CONST_DEC_LIST) + + +state 4 + + 5 CONST_DEC: @1 . undef_id_tok '=' const_id_tok ';' + + undef_id_tok shift, and go to state 7 + + +state 5 + + 0 $axiom: CONST_DEC_PART $ . + + $default accept + + +state 6 + + 3 CONST_DEC_LIST: CONST_DEC_LIST CONST_DEC . + + $default reduce using rule 3 (CONST_DEC_LIST) + + +state 7 + + 5 CONST_DEC: @1 undef_id_tok . '=' const_id_tok ';' + + '=' shift, and go to state 8 + + +state 8 + + 5 CONST_DEC: @1 undef_id_tok '=' . const_id_tok ';' + + const_id_tok shift, and go to state 9 + + +state 9 + + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok . ';' + + ';' shift, and go to state 10 + + +state 10 + + 5 CONST_DEC: @1 undef_id_tok '=' const_id_tok ';' . + + $default reduce using rule 5 (CONST_DEC) +]]) AT_CLEANUP +## --------------- ## +## Web2c Actions. ## +## --------------- ## + +# The generation of the mapping `state -> action' was once wrong in +# extremely specific situations. web2c.y exhibits this situation. +# Below is a stripped version of the grammar. It looks like one can +# simplify it further, but just don't: it is tuned to exhibit a bug, +# which disapears when applying sane grammar transformations. +# +# It used to be wrong on yydefact only: +# +# static const short yydefact[] = +# { +# - 2, 0, 1, 0, 0, 2, 3, 2, 5, 4, +# + 2, 0, 1, 0, 0, 0, 3, 2, 5, 4, +# 0, 0 +# }; +# +# but let's check all the tables. -## --------------------- ## -## Invalid CPP headers. ## -## --------------------- ## -# AT_TEST_CPP_GUARD_H([INPUT-FILE-BASE) -# ------------------------------------- -m4_define([AT_TEST_CPP_GUARD_H], -[AT_SETUP([Invalid CPP guards: $1]) +AT_SETUP([Web2c Actions]) -# possibly create and nuke inner directories. -m4_bmatch([$1], [[/]], -[dirname=`AS_DIRNAME([$1])` -AS_MKDIR_P([$dirname]) -AT_CLEANUP_FILES([$dirname])]) +AT_KEYWORDS([report]) -AT_DATA([$1.y], -[%% -dummy: -]) +AT_DATA([input.y], +[[%% +statement: struct_stat; +struct_stat: /* empty. */ | if else; +if: "if" "const" "then" statement; +else: "else" statement; +%% +]]) -AT_CHECK([bison --defines=$1.h $1.y]) +AT_CHECK([bison -v input.y -o input.c]) -# CPP should be happy with it. -AT_CHECK([$CC -E $1.h], 0, [ignore]) +# Check only the tables. We don't use --no-parser, because it is +# still to be implemented in the experimental branch of Bison. +[sed -n 's/ *$//;/^static const.*\[\] =/,/^}/p' input.c >tables.c] -AT_CLEANUP($1.*) -]) +AT_CHECK([[cat tables.c]], 0, +[[static const unsigned char yytranslate[] = +{ + 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, + 5, 6 +}; +static const unsigned char yyprhs[] = +{ + 0, 0, 3, 5, 6, 9, 14 +}; +static const signed char yyrhs[] = +{ + 8, 0, -1, 9, -1, -1, 10, 11, -1, 3, + 4, 5, 8, -1, 6, 8, -1 +}; +static const unsigned char yyrline[] = +{ + 0, 2, 2, 3, 3, 4, 5 +}; +static const char *const yytname[] = +{ + "$", "error", "$undefined.", "\"if\"", "\"const\"", "\"then\"", + "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", 0 +}; +static const short yytoknum[] = +{ + 0, 256, 257, 258, 259, 260, 261, -1 +}; +static const unsigned char yyr1[] = +{ + 0, 7, 8, 9, 9, 10, 11 +}; +static const unsigned char yyr2[] = +{ + 0, 2, 1, 0, 2, 4, 2 +}; +static const short yydefact[] = +{ + 3, 0, 0, 2, 0, 0, 0, 3, 4, 3, + 6, 5 +}; +static const short yydefgoto[] = +{ + -1, 2, 3, 4, 8 +}; +static const short yypact[] = +{ + -2, -1, 4,-32768, 0, 2,-32768, -2,-32768, -2, + -32768,-32768 +}; +static const short yypgoto[] = +{ + -32768, -7,-32768,-32768,-32768 +}; +static const short yytable[] = +{ + 10, 1, 11, 5, 6, 0, 7, 9 +}; +static const short yycheck[] = +{ + 7, 3, 9, 4, 0, -1, 6, 5 +}; +static const unsigned char yystos[] = +{ + 0, 3, 8, 9, 10, 4, 0, 6, 11, 5, + 8, 8 +}; +]]) -AT_TEST_CPP_GUARD_H([input/input]) -AT_TEST_CPP_GUARD_H([9foo]) +AT_CLEANUP