# Bison Regressions. -*- Autotest -*-
-# Copyright 2001 Free Software Foundation, Inc.
+# Copyright 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
AT_BANNER([[Regression tests.]])
-## ------------------ ##
-## Duplicate string. ##
-## ------------------ ##
+## ---------------- ##
+## Braces parsing. ##
+## ---------------- ##
-AT_SETUP([Duplicate string])
-AT_DATA([input.y],
-[[/* `Bison -v' used to dump core when two tokens are defined with the same
- string, as LE and GE below. */
+AT_SETUP([braces parsing])
-%token NUM
-%token LE "<="
-%token GE "<="
+AT_DATA([input.y],
+[[/* Bison used to swallow the character after `}'. */
%%
-exp: '(' exp ')' | NUM ;
+exp: { tests = {{{{{{{{{{}}}}}}}}}}; };
%%
]])
AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
-AT_CLEANUP
-
-
-## ------------------------- ##
-## Unresolved SR Conflicts. ##
-## ------------------------- ##
-
-AT_SETUP([Unresolved SR Conflicts])
-
-AT_DATA([input.y],
-[[%token NUM OP
-%%
-exp: exp OP exp | NUM;
-]])
-
-AT_CHECK([bison input.y -o input.c -v], 0, [],
-[input.y contains 1 shift/reduce conflict.
-])
-
-# Check the contents of the report.
-AT_CHECK([cat input.output], [],
-[[State 5 contains 1 shift/reduce conflict.
-
-
-Grammar
-
- Number, Line, Rule
- 0 3 $axiom -> exp $
- 1 3 exp -> exp OP exp
- 2 3 exp -> NUM
-
-
-Terminals, with rules where they appear
-
-$ (0) 0
-error (256)
-NUM (257) 2
-OP (258) 1
-
-
-Nonterminals, with rules where they appear
-
-$axiom (5)
- on left: 0
-exp (6)
- on left: 1 2, on right: 0 1
-
-
-state 0
-
- NUM shift, and go to state 1
-
- exp go to state 2
-
-
-
-state 1
-
- exp -> NUM . (rule 2)
-
- $default reduce using rule 2 (exp)
-
-
-
-state 2
-
- $axiom -> exp . $ (rule 0)
- exp -> exp . OP exp (rule 1)
-
- $ shift, and go to state 3
- OP shift, and go to state 4
-
-
-
-state 3
-
- $axiom -> exp $ . (rule 0)
-
- $default accept
-
-
-state 4
-
- exp -> exp OP . exp (rule 1)
-
- NUM shift, and go to state 1
-
- exp go to state 5
-
-
-
-state 5
-
- exp -> exp . OP exp (rule 1)
- exp -> exp OP exp . (rule 1)
-
- OP shift, and go to state 4
-
- OP [reduce using rule 1 (exp)]
- $default reduce using rule 1 (exp)
+AT_CHECK([fgrep 'tests = {{{{{{{{{{}}}}}}}}}};' input.c], 0, [ignore])
+AT_CLEANUP
-]])
+## ------------------ ##
+## Duplicate string. ##
+## ------------------ ##
-AT_CLEANUP
+AT_SETUP([Duplicate string])
-## --------------------- ##
-## Solved SR Conflicts. ##
-## --------------------- ##
+AT_DATA([input.y],
+[[/* `Bison -v' used to dump core when two tokens are defined with the same
+ string, as LE and GE below. */
-AT_SETUP([Solved SR Conflicts])
+%token NUM
+%token LE "<="
+%token GE "<="
-AT_DATA([input.y],
-[[%token NUM OP
-%right OP
%%
-exp: exp OP exp | NUM;
+exp: '(' exp ')' | NUM ;
+%%
]])
-AT_CHECK([bison input.y -o input.c -v], 0, [], [])
-
-# Check the contents of the report.
-AT_CHECK([cat input.output], [],
-[[Conflict in state 5 between rule 2 and token OP resolved as shift.
-
-
-Grammar
-
- Number, Line, Rule
- 0 4 $axiom -> exp $
- 1 4 exp -> exp OP exp
- 2 4 exp -> NUM
-
-
-Terminals, with rules where they appear
-
-$ (0) 0
-error (256)
-NUM (257) 2
-OP (258) 1
-
-
-Nonterminals, with rules where they appear
-
-$axiom (5)
- on left: 0
-exp (6)
- on left: 1 2, on right: 0 1
-
-
-state 0
-
- NUM shift, and go to state 1
-
- exp go to state 2
-
-
-
-state 1
-
- exp -> NUM . (rule 2)
-
- $default reduce using rule 2 (exp)
-
-
-
-state 2
-
- $axiom -> exp . $ (rule 0)
- exp -> exp . OP exp (rule 1)
-
- $ shift, and go to state 3
- OP shift, and go to state 4
-
-
-
-state 3
-
- $axiom -> exp $ . (rule 0)
-
- $default accept
-
-
-state 4
-
- exp -> exp OP . exp (rule 1)
-
- NUM shift, and go to state 1
-
- exp go to state 5
-
-
-
-state 5
-
- exp -> exp . OP exp (rule 1)
- exp -> exp OP exp . (rule 1)
-
- OP shift, and go to state 4
-
- $default reduce using rule 1 (exp)
-
-
-
-]])
+AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
AT_CLEANUP
-
-
## ------------------- ##
## Rule Line Numbers. ##
## ------------------- ##
{
-}
+};
]])
AT_CHECK([bison input.y -o input.c -v], 0, [], [])
-## -------------------- ##
-## %expect not enough. ##
-## -------------------- ##
-
-AT_SETUP([%expect not enough])
-
-AT_DATA([input.y],
-[[%token NUM OP
-%expect 0
-%%
-exp: exp OP exp | NUM;
-]])
-
-AT_CHECK([bison input.y -o input.c], 1, [],
-[input.y contains 1 shift/reduce conflict.
-expected 0 shift/reduce conflicts
-])
-AT_CLEANUP
-
-
-## --------------- ##
-## %expect right. ##
-## --------------- ##
-
-AT_SETUP([%expect right])
-
-AT_DATA([input.y],
-[[%token NUM OP
-%expect 1
-%%
-exp: exp OP exp | NUM;
-]])
-
-AT_CHECK([bison input.y -o input.c], 0)
-AT_CLEANUP
-
-
-## ------------------ ##
-## %expect too much. ##
-## ------------------ ##
-
-AT_SETUP([%expect too much])
-
-AT_DATA([input.y],
-[[%token NUM OP
-%expect 2
-%%
-exp: exp OP exp | NUM;
-]])
-
-AT_CHECK([bison input.y -o input.c], 1, [],
-[input.y contains 1 shift/reduce conflict.
-expected 2 shift/reduce conflicts
-])
-AT_CLEANUP
-
-
## ---------------------- ##
## Mixing %token styles. ##
## ---------------------- ##
-## ---------------------- ##
-## %union and --defines. ##
-## ---------------------- ##
+## ---------------- ##
+## Invalid inputs. ##
+## ---------------- ##
-AT_SETUP([%union and --defines])
-
-AT_DATA([input.y],
-[%union
-{
- int integer;
- char *string ;
-}
-%%
-exp: {};
-])
-
-AT_CHECK([bison --defines input.y])
-
-AT_CLEANUP
-
-
-## ----------------- ##
-## Invalid input 1. ##
-## ----------------- ##
-
-
-AT_SETUP([Invalid input: 1])
+AT_SETUP([Invalid inputs])
AT_DATA([input.y],
[[%%
?
-]])
-
-AT_CHECK([bison input.y], [1], [],
-[[input.y:2: invalid input: `?'
-input.y:3: fatal error: no rules in the input grammar
-]])
-
-AT_CLEANUP
-
-
-## ----------------- ##
-## Invalid input 2. ##
-## ----------------- ##
-
-
-AT_SETUP([Invalid input: 2])
-
-AT_DATA([input.y],
-[[%%
default: 'a' }
+%{
+%&
+%a
+%-
]])
AT_CHECK([bison input.y], [1], [],
-[[input.y:2: invalid input: `}'
+[[input.y:2: invalid input: `?'
+input.y:3: invalid input: `}'
+input.y:4: invalid input: `%{'
+input.y:5: invalid input: `%&'
+input.y:6: invalid input: `%a'
+input.y:7: invalid input: `%-'
]])
AT_CLEANUP
-## --------------------- ##
-## Invalid CPP headers. ##
-## --------------------- ##
-
-# AT_TEST_CPP_GUARD_H([INPUT-FILE-BASE)
-# -------------------------------------
-m4_define([AT_TEST_CPP_GUARD_H],
-[AT_SETUP([Invalid CPP guards: $1])
-
-# Possibly create inner directories.
-dirname=`AS_DIRNAME([$1])`
-AS_MKDIR_P([$dirname])
-
-AT_DATA([$1.y],
-[%%
-dummy:
-])
-
-AT_CHECK([bison --defines=$1.h $1.y])
-
-# CPP should be happy with it.
-AT_CHECK([$CC -E $1.h], 0, [ignore])
-
-AT_CLEANUP
-])
-
-AT_TEST_CPP_GUARD_H([input/input])
-AT_TEST_CPP_GUARD_H([9foo])
-
-
-
## -------------- ##
## Web2c Report. ##
## -------------- ##
static const char *const yytname[] =
{
"$", "error", "$undefined.", "\"if\"", "\"const\"", "\"then\"",
- "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", NULL
+ "\"else\"", "$axiom", "statement", "struct_stat", "if", "else", 0
};
static const short yytoknum[] =
{
projects / bison.git / blobdiff