# Exercising Bison on conflicts. -*- Autotest -*-
-# Copyright (C) 2002 Free Software Foundation, Inc.
+
+# Copyright (C) 2002, 2003 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
e: 'e' | /* Nothing. */;
]])
-AT_CHECK([bison input.y -o input.c])
+AT_CHECK([bison -o input.c input.y], 0, [],
+[[input.y:4.9: warning: rule never reduced because of conflicts: e: /* empty */
+]])
AT_CLEANUP
AT_SETUP([%nonassoc and eof])
-AT_DATA([input.y],
+AT_DATA_GRAMMAR([input.y],
[[
%{
-#include <config.h>
-/* We don't need a perfect malloc for these tests. */
-#undef malloc
#include <stdio.h>
#if STDC_HEADERS
]])
# Specify the output files to avoid problems on different file systems.
-AT_CHECK([bison input.y -o input.c])
+AT_CHECK([bison -o input.c input.y])
AT_COMPILE([input])
AT_PARSER_CHECK([./input '0<0'])
# no one has ever spotted it! The messages are *wrong*: there should
# be nothing there, it should be expected eof.
AT_PARSER_CHECK([./input '0<0<0'], [1], [],
- [parse error, unexpected '<', expecting '<' or '>'
+ [syntax error, unexpected '<', expecting '<' or '>'
])
AT_PARSER_CHECK([./input '0>0'])
AT_PARSER_CHECK([./input '0>0>0'], [1], [],
- [parse error, unexpected '>', expecting '<' or '>'
+ [syntax error, unexpected '>', expecting '<' or '>'
])
AT_PARSER_CHECK([./input '0<0>0'], [1], [],
- [parse error, unexpected '>', expecting '<' or '>'
+ [syntax error, unexpected '>', expecting '<' or '>'
])
AT_CLEANUP
exp: exp OP exp | NUM;
]])
-AT_CHECK([bison input.y -o input.c --report=all], 0, [],
-[input.y contains 1 shift/reduce conflict.
+AT_CHECK([bison -o input.c --report=all input.y], 0, [],
+[input.y: conflicts: 1 shift/reduce
])
# Check the contents of the report.
AT_CHECK([cat input.output], [],
-[[State 5 contains 1 shift/reduce conflict.
+[[State 5 conflicts: 1 shift/reduce
Grammar
- 0 $axiom: exp $
+ 0 $accept: exp $end
1 exp: exp OP exp
2 | NUM
Terminals, with rules where they appear
-$ (0) 0
+$end (0) 0
error (256)
NUM (258) 2
OP (259) 1
Nonterminals, with rules where they appear
-$axiom (5)
+$accept (5)
on left: 0
exp (6)
on left: 1 2, on right: 0 1
state 0
- 0 $axiom: . exp $
+ 0 $accept: . exp $end
1 exp: . exp OP exp
2 | . NUM
state 2
- 0 $axiom: exp . $
+ 0 $accept: exp . $end
1 exp: exp . OP exp
- $ shift, and go to state 3
- OP shift, and go to state 4
+ $end shift, and go to state 3
+ OP shift, and go to state 4
state 3
- 0 $axiom: exp $ .
+ 0 $accept: exp $end .
- $default accept
+ $default accept
state 4
state 5
- 1 exp: exp . OP exp [$, OP]
- 1 | exp OP exp . [$, OP]
+ 1 exp: exp . OP exp [$end, OP]
+ 1 | exp OP exp . [$end, OP]
OP shift, and go to state 4
exp: exp OP exp | NUM;
]])
-AT_CHECK([bison input.y -o input.c --report=all])
+AT_CHECK([bison -o input.c --report=all input.y])
# Check the contents of the report.
AT_CHECK([cat input.output], [],
[[Grammar
- 0 $axiom: exp $
+ 0 $accept: exp $end
1 exp: exp OP exp
2 | NUM
Terminals, with rules where they appear
-$ (0) 0
+$end (0) 0
error (256)
NUM (258) 2
OP (259) 1
Nonterminals, with rules where they appear
-$axiom (5)
+$accept (5)
on left: 0
exp (6)
on left: 1 2, on right: 0 1
state 0
- 0 $axiom: . exp $
+ 0 $accept: . exp $end
1 exp: . exp OP exp
2 | . NUM
state 2
- 0 $axiom: exp . $
+ 0 $accept: exp . $end
1 exp: exp . OP exp
- $ shift, and go to state 3
- OP shift, and go to state 4
+ $end shift, and go to state 3
+ OP shift, and go to state 4
state 3
- 0 $axiom: exp $ .
+ 0 $accept: exp $end .
- $default accept
+ $default accept
state 4
state 5
- 1 exp: exp . OP exp [$, OP]
- 1 | exp OP exp . [$, OP]
+ 1 exp: exp . OP exp [$end, OP]
+ 1 | exp OP exp . [$end, OP]
$default reduce using rule 1 (exp)
- Conflict between rule 2 and token OP resolved as shift (%left OP).
+
+ Conflict between rule 1 and token OP resolved as reduce (%left OP).
]])
AT_CLEANUP
# When there are RR conflicts, some rules are disabled. Usually it is
# simply displayed as:
#
-# $ reduce using rule 3 (num)
-# $ [reduce using rule 4 (id)]
+# $end reduce using rule 3 (num)
+# $end [reduce using rule 4 (id)]
#
# But when `reduce 3' is the default action, we'd produce:
#
-# $ [reduce using rule 4 (id)]
+# $end [reduce using rule 4 (id)]
# $default reduce using rule 3 (num)
#
# In this precise case (a reduction is masked by the default
# reduction), we make the `reduce 3' explicit:
#
-# $ reduce using rule 3 (num)
-# $ [reduce using rule 4 (id)]
+# $end reduce using rule 3 (num)
+# $end [reduce using rule 4 (id)]
# $default reduce using rule 3 (num)
#
# Maybe that's not the best display, but then, please propose something
%%
]])
-AT_CHECK([bison input.y -o input.c --report=all], 1, [],
-[input.y contains 1 reduce/reduce conflict.
-])
+AT_CHECK([bison -o input.c --report=all input.y], 0, [],
+[[input.y: conflicts: 1 reduce/reduce
+input.y:4.6-8: warning: rule never reduced because of conflicts: id: '0'
+]])
# Check the contents of the report.
AT_CHECK([cat input.output], [],
-[[State 1 contains 1 reduce/reduce conflict.
+[[Rules never reduced
+
+ 4 id: '0'
+
+
+State 1 conflicts: 1 reduce/reduce
Grammar
- 0 $axiom: exp $
+ 0 $accept: exp $end
1 exp: num
2 | id
Terminals, with rules where they appear
-$ (0) 0
+$end (0) 0
'0' (48) 3 4
error (256)
Nonterminals, with rules where they appear
-$axiom (4)
+$accept (4)
on left: 0
exp (5)
on left: 1 2, on right: 0
state 0
- 0 $axiom: . exp $
+ 0 $accept: . exp $end
1 exp: . num
2 | . id
3 num: . '0'
state 1
- 3 num: '0' . [$]
- 4 id: '0' . [$]
+ 3 num: '0' . [$end]
+ 4 id: '0' . [$end]
- $ reduce using rule 3 (num)
- $ [reduce using rule 4 (id)]
+ $end reduce using rule 3 (num)
+ $end [reduce using rule 4 (id)]
$default reduce using rule 3 (num)
state 2
- 0 $axiom: exp . $
+ 0 $accept: exp . $end
- $ shift, and go to state 5
+ $end shift, and go to state 5
state 3
state 5
- 0 $axiom: exp $ .
+ 0 $accept: exp $end .
- $default accept
+ $default accept
]])
AT_CLEANUP
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_CHECK([bison -o input.c input.y], 0, [],
+[input.y: conflicts: 1 shift/reduce
+input.y: warning: expected 0 shift/reduce conflicts
])
AT_CLEANUP
exp: exp OP exp | NUM;
]])
-AT_CHECK([bison input.y -o input.c])
+AT_CHECK([bison -o input.c input.y])
AT_CLEANUP
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_CHECK([bison -o input.c input.y], 0, [],
+[input.y: conflicts: 1 shift/reduce
+input.y: warning: expected 2 shift/reduce conflicts
+])
+AT_CLEANUP
+
+
+## ------------------------------ ##
+## %expect with reduce conflicts ##
+## ------------------------------ ##
+
+AT_SETUP([%expect with reduce conflicts])
+
+AT_DATA([input.y],
+[[%expect 0
+%%
+program: a 'a' | a a;
+a: 'a';
+]])
+
+AT_CHECK([bison -o input.c input.y], 0, [],
+[input.y: conflicts: 1 reduce/reduce
+input.y: warning: expected 0 reduce/reduce conflicts
])
AT_CLEANUP
projects / bison.git / blobdiff