bug-bison
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[GNU Bison 1.50a] testsuite.log: 2 failures


From: Arnold Troeger
Subject: [GNU Bison 1.50a] testsuite.log: 2 failures
Date: Fri, 29 Nov 2002 17:11:15 +0700
User-agent: Mozilla/5.0 (X11; U; IRIX64 IP30; en-US; rv:1.1) Gecko/20021001

Gentlemen,
These are the two failed tests. This was compiled on an SGI indy running IRIX 6.5.16. Compiler is gcc version 3.2.1. Optimization is -O1. The same two tests failed at optimization level -O2 and -O3. These same tests failed using the SGI compiler as well. Please let me know if I can be of further help here.

Thank you and best regards,
Arnold
--
Arnold Troeger                          Unocal Thailand
Phone:  011-66-2-545-5456               5th Floor, Tower 3, SCB Park Plaza
FAX:    011-66-2-545-5374               19 Ratchadapisek Road, Chatuchak
Email:  address@hidden  Bangkok 10900, Thailand
------------------------------------------------------------------------
"Microsoft Windows:  for when your machine is just too fast"
"Microsoft: Writing viruses has never been easier!"
"Microsoft: The company that made email dangerous"
## --------------------------- ##
## GNU Bison 1.50a test suite. ##
## --------------------------- ##

testsuite: command line was:
  $ /u76/gnu/src/bison-1.75/generic/tests/testsuite 

## ----------- ##
## ChangeLogs. ##
## ----------- ##

testsuite: /u76/gnu/src/bison-1.75/generic/po/ChangeLog:
| 2002-08-08  gettextize  <address@hidden>
| 
|       * Rules-quot: New file, from gettext-0.11.5.
|       * boldquot.sed: New file, from gettext-0.11.5.
|       * address@hidden: New file, from gettext-0.11.5.
|       * address@hidden: New file, from gettext-0.11.5.
|       * insert-header.sin: New file, from gettext-0.11.5.
|       * quot.sed: New file, from gettext-0.11.5.
|       * remove-potcdate.sin: New file, from gettext-0.11.5.
| 

testsuite: /u76/gnu/src/bison-1.75/generic/ChangeLog:
| 2002-10-14  Akim Demaille  <address@hidden>
| 
|       Version 1.75.
| 
| 2002-10-14  Akim Demaille  <address@hidden>
| 
|       * tests/Makefile.am (maintainer-check-posix): New.
| 
| 2002-10-14  Akim Demaille  <address@hidden>
| 

## --------- ##
## Platform. ##
## --------- ##

hostname = campy
uname -m = IP22
uname -r = 6.5
uname -s = IRIX
uname -v = 04101930

/usr/bin/uname -p = mips
/bin/uname -X     = unknown

/bin/arch              = unknown
/usr/bin/arch -k       = unknown
/usr/convex/getsysinfo = unknown
hostinfo               = unknown
/bin/machine           = unknown
/usr/bin/oslevel       = unknown
/bin/universe          = unknown

PATH: /u76/gnu/src/bison-1.75/IRIX6_mips/tests
PATH: /u76/gnu/src/bison-1.75/generic/tests
PATH: /u76/gnu/IRIX6_mips/bin
PATH: /app/local/bin
PATH: /u76/local/IRIX6_mips/bin
PATH: /u76/local/bin
PATH: /usr/bin
PATH: /bin
PATH: /usr/sbin
PATH: /sbin
PATH: /usr/local/bin
PATH: /usr/bin/X11
PATH: /u76/xutils/IRIX6_mips/bin

testsuite: atconfig:
| # Configurable variable values for building test suites.
| # Generated by ./config.status.
| # Copyright 2000, 2001 Free Software Foundation, Inc.
| 
| # The test suite will define top_srcdir=/../.. etc.
| at_testdir='tests'
| abs_builddir='/u76/gnu/src/bison-1.75/IRIX6_mips/tests'
| at_srcdir='/u76/gnu/src/bison-1.75/generic/tests'
| abs_srcdir='/u76/gnu/src/bison-1.75/generic/tests'
| at_top_srcdir='/u76/gnu/src/bison-1.75/generic'
| abs_top_srcdir='/u76/gnu/src/bison-1.75/generic'
| at_top_builddir='../'
| abs_top_builddir='/u76/gnu/src/bison-1.75/IRIX6_mips'
| 
| AUTOTEST_PATH='tests'
| 
| SHELL=${CONFIG_SHELL-'/bin/sh'}

testsuite: atlocal:
| # tests/atlocal.  Generated from atlocal.in by configure.                     
                -*- shell-script -*-
| # Configurable variable values for Bison test suite.
| # Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc.
| 
| # We need a C compiler.
| CC='gcc'
| 
| # We want no optimization.
| CFLAGS='-O1  '
| 
| # We need `config.h'.
| CPPFLAGS="-I$abs_top_builddir "
| 
| # Is the compiler GCC?
| GCC='yes'

## ---------------- ##
## Tested programs. ##
## ---------------- ##

testsuite.at:39: /u76/gnu/src/bison-1.75/IRIX6_mips/tests/bison --version
bison (GNU Bison) 1.75
Written by Robert Corbett and Richard Stallman.

Copyright (C) 2002 Free Software Foundation, Inc.
This is free software; see the source for copying conditions.  There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

## --------------------------- ##
## Silently running the tests. ##
## --------------------------- ##
testsuite: starting at: Fri Nov 29 03:20:51 CST 2002
1. input.at:28: ok      (0m0.10s 0m0.31s)
2. input.at:46: ok      (0m0.10s 0m0.30s)
3. input.at:64: ok      (0m0.10s 0m0.31s)
4. input.at:93: ok      (0m2.89s 0m2.14s)
5. output.at:38: ok     (0m0.24s 0m0.58s)
6. output.at:40: ok     (0m0.24s 0m0.57s)
7. output.at:42: ok     (0m0.24s 0m0.60s)
8. output.at:44: ok     (0m0.24s 0m0.58s)
9. output.at:46: ok     (0m0.24s 0m0.58s)
10. output.at:48: ok    (0m0.24s 0m0.59s)
11. output.at:52: ok    (0m0.24s 0m0.58s)
12. output.at:54: ok    (0m0.24s 0m0.57s)
13. output.at:57: ok    (0m0.24s 0m0.57s)
14. output.at:61: ok    (0m0.24s 0m0.58s)
15. output.at:63: ok    (0m0.24s 0m0.59s)
16. output.at:67: ok    (0m0.24s 0m0.58s)
17. output.at:72: ok    (0m0.24s 0m0.58s)
18. output.at:75: ok    (0m0.24s 0m0.58s)
19. output.at:79: ok    (0m0.23s 0m0.57s)
20. output.at:83: ok    (0m0.23s 0m0.58s)
21. sets.at:66: ok      (0m0.56s 0m1.18s)
22. sets.at:151: ok     (0m1.18s 0m0.76s)
23. sets.at:193: ok     (0m0.96s 0m1.38s)
24. reduce.at:26: ok    (0m0.25s 0m0.59s)
25. reduce.at:70: ok    (0m0.26s 0m0.61s)
26. reduce.at:125: ok   (0m0.27s 0m0.62s)
27. reduce.at:212: ok   (0m0.75s 0m1.26s)
28. reduce.at:301: ok   (0m0.25s 0m0.60s)
29. reduce.at:342: ok   (0m0.10s 0m0.29s)
30. synclines.at:91: ok (0m2.51s 0m2.26s)
31. synclines.at:110: ok        (0m2.36s 0m2.23s)
32. synclines.at:133: ok        (0m2.52s 0m2.27s)
33. synclines.at:152: ok        (0m2.44s 0m2.23s)
34. synclines.at:170: ok        (0m2.49s 0m2.22s)
35. headers.at:27: ok   (0m0.15s 0m0.36s)
36. headers.at:71: ok   (0m0.28s 0m0.72s)
37. headers.at:72: ok   (0m0.28s 0m0.72s)
38. headers.at:81: ok   (0m3.16s 0m2.10s)
39. actions.at:25: ok   (0m6.20s 0m1.91s)
40. actions.at:89: ok   (0m4.45s 0m1.82s)
41. actions.at:160: ok  (0m6.24s 0m1.96s)
42. conflicts.at:31: ok (0m0.15s 0m0.35s)
43. conflicts.at:51: ok (0m3.82s 0m2.57s)
44. conflicts.at:134: ok        (0m0.24s 0m0.57s)
45. conflicts.at:241: ok        (0m0.23s 0m0.56s)
46. conflicts.at:363: ok        (0m0.24s 0m0.57s)
47. conflicts.at:482: ok        (0m0.11s 0m0.32s)
48. conflicts.at:502: ok        (0m0.15s 0m0.34s)
49. conflicts.at:519: ok        (0m0.11s 0m0.32s)
50. calc.at:449: ok     (0m6.84s 0m8.49s)
51. calc.at:451: ok     (0m6.94s 0m8.61s)
52. calc.at:452: ok     (0m7.07s 0m7.76s)
53. calc.at:453: ok     (0m6.90s 0m8.52s)
54. calc.at:454: ok     (0m6.84s 0m8.48s)
55. calc.at:455: ok     (0m6.84s 0m8.46s)
56. calc.at:456: ok     (0m6.96s 0m7.34s)
57. calc.at:458: ok     (0m7.22s 0m6.62s)
58. calc.at:460: ok     (0m7.22s 0m6.63s)
59. calc.at:462: FAILED near `calc.at:462'      (0m7.22s 0m6.63s)
60. calc.at:463: FAILED near `calc.at:463'      (0m7.22s 0m6.63s)
61. calc.at:480: ok     (0m17.02s 0m9.01s)
62. calc.at:482: ok     (0m17.00s 0m9.01s)
63. calc.at:483: ok     (0m16.98s 0m8.28s)
64. calc.at:484: ok     (0m17.09s 0m9.02s)
65. calc.at:485: ok     (0m17.06s 0m9.03s)
66. calc.at:486: ok     (0m16.96s 0m9.01s)
67. calc.at:487: ok     (0m17.05s 0m7.89s)
68. calc.at:489: ok     (0m16.92s 0m7.13s)
69. calc.at:491: ok     (0m16.89s 0m7.14s)
70. calc.at:493: ok     (0m19.99s 0m9.66s)
71. calc.at:494: ok     (0m19.80s 0m7.77s)
72. torture.at:140: ok  (0m54.79s 0m5.82s)
73. torture.at:231: ok  (0m29.06s 0m4.20s)
74. torture.at:367: ok  (3m33.79s 0m7.46s)
75. torture.at:441: ok  (0m24.29s 1m11.80s)
76. torture.at:462: ok  (0m25.17s 1m13.80s)
77. existing.at:24: ok  (0m0.73s 0m0.43s)
78. existing.at:364: ok (0m1.04s 0m0.67s)
79. regression.at:27: ok        (0m1.98s 0m1.07s)
80. regression.at:65: ok        (0m0.24s 0m0.56s)
81. regression.at:87: ok        (0m0.16s 0m0.35s)
82. regression.at:113: ok       (0m0.23s 0m0.56s)
83. regression.at:257: ok       (0m0.15s 0m0.34s)
84. regression.at:280: ok       (0m0.10s 0m0.29s)
85. regression.at:313: ok       (0m1.98s 0m1.02s)
86. regression.at:341: ok       (0m2.00s 0m1.02s)
87. regression.at:371: ok       (0m0.24s 0m0.56s)
88. regression.at:548: ok       (0m5.69s 0m0.69s)
89. cxx-type.at:226: ok (0m13.70s 0m2.34s)
90. cxx-type.at:232: ok (0m13.67s 0m2.30s)
91. cxx-type.at:238: ok (0m13.75s 0m2.31s)
92. cxx-type.at:244: ok (0m13.72s 0m2.29s)
93. cxx-type.at:252: ok (0m13.81s 0m2.31s)
94. cxx-type.at:259: ok (0m13.80s 0m2.32s)
95. cxx-type.at:266: ok (0m13.86s 0m2.30s)
96. cxx-type.at:272: ok (0m13.86s 0m2.29s)
97. cxx-type.at:280: ok (0m14.50s 0m2.33s)
testsuite: ending at: Fri Nov 29 04:04:17 CST 2002
testsuite: test suite duration: 0h 43m 27s


## ------------------------ ##
## Summary of the failures. ##
## ------------------------ ##
Failed tests:
GNU Bison 1.50a test suite test groups:

 NUM: FILENAME:LINE      TEST-GROUP-NAME
      KEYWORDS

  59: calc.at:462        Calculator %debug
  60: calc.at:463        Calculator %error-verbose %debug --defines --locations 
--name-prefix=calc --verbose --yacc


## --------------------------------------- ##
## Verbosely re-running the failing tests. ##
## --------------------------------------- ##

## --------------------------- ##
## GNU Bison 1.50a test suite. ##
## --------------------------- ##
59. calc.at:462: testing Calculator %debug...
calc.at:462: bison -o calc.c  calc.y
calc.at:462: $CC $CFLAGS $CPPFLAGS calc.c -o calc
stderr:
calc.at:462: $PREPARSER ./calc input
stderr:
Starting parse
Entering state 0
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0
Entering state 7
Reading a token: Next token is token '+' ()
Shifting token 43 ('+'), Entering state 15
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 15
Entering state 24
Reading a token: Next token is token '*' ()
Shifting token 42 ('*'), Entering state 16
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 15 24 16
Entering state 25
Reading a token: Next token is token '=' ()
Reducing via rule 9 (line 71), exp '*' exp  -> exp
state stack now 0 7 15
Entering state 24
Next token is token '=' ()
Reducing via rule 7 (line 69), exp '+' exp  -> exp
state stack now 0
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0
Entering state 6
Reducing via rule 1 (line 51), line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '+' ()
Shifting token 43 ('+'), Entering state 15
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 15
Entering state 24
Reading a token: Next token is token '*' ()
Shifting token 42 ('*'), Entering state 16
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 15 24 16 2
Entering state 8
Reading a token: Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 15 24 16
Entering state 25
Next token is token '=' ()
Reducing via rule 9 (line 71), exp '*' exp  -> exp
state stack now 0 5 7 15
Entering state 24
Next token is token '=' ()
Reducing via rule 7 (line 69), exp '+' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2
Entering state 8
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2 8 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4 2
Entering state 8
Reading a token: Next token is token ')' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2 2 2
Entering state 8
Reading a token: Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 2 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '-' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '=' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14 4
Entering state 10
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14 4 10 14
Entering state 23
Reading a token: Next token is token ')' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5 7 14 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '=' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18 27 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 7 18
Entering state 27
Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4
Entering state 10
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4 10 18
Entering state 27
Reading a token: Next token is token ')' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Now at end of input.
calc.at:462: wc -l <stderr | sed 's/[^0-9]//g'
--- -   Fri Nov 29 04:04:46 2002
+++ /u76/gnu/src/bison-1.75/IRIX6_mips/tests/testsuite.dir/at-stdout    Fri Nov 
29 04:04:46 2002
@@ -1,2 +1,2 @@
-486
+369
 
59. calc.at:462: FAILED near `calc.at:462'

60. calc.at:463: testing Calculator %error-verbose %debug --defines --locations 
--name-prefix=calc --verbose --yacc...
calc.at:463: bison -o calc.c   --defines --locations --name-prefix=calc 
--verbose --yacc calc.y
calc.at:463: $CC $CFLAGS $CPPFLAGS calc.c -o calc
stderr:
calc.at:463: $PREPARSER ./calc input
stderr:
Starting parse
Entering state 0
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0
Entering state 7
Reading a token: Next token is token '+' ()
Shifting token 43 ('+'), Entering state 15
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 15
Entering state 24
Reading a token: Next token is token '*' ()
Shifting token 42 ('*'), Entering state 16
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 15 24 16
Entering state 25
Reading a token: Next token is token '=' ()
Reducing via rule 9 (line 71), exp '*' exp  -> exp
state stack now 0 7 15
Entering state 24
Next token is token '=' ()
Reducing via rule 7 (line 69), exp '+' exp  -> exp
state stack now 0
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0
Entering state 6
Reducing via rule 1 (line 51), line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '+' ()
Shifting token 43 ('+'), Entering state 15
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 15
Entering state 24
Reading a token: Next token is token '*' ()
Shifting token 42 ('*'), Entering state 16
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 15 24 16 2
Entering state 8
Reading a token: Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 15 24 16
Entering state 25
Next token is token '=' ()
Reducing via rule 9 (line 71), exp '*' exp  -> exp
state stack now 0 5 7 15
Entering state 24
Next token is token '=' ()
Reducing via rule 7 (line 69), exp '+' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2
Entering state 8
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2 8 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4 2
Entering state 8
Reading a token: Next token is token ')' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 2 2 2
Entering state 8
Reading a token: Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 2 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 2
Entering state 8
Next token is token '=' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '-' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '=' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 2
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13 2
Entering state 8
Reading a token: Next token is token '\n' ()
Reducing via rule 11 (line 73), '-' exp  -> exp
state stack now 0 5 7 13
Entering state 22
Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14 4
Entering state 10
Reading a token: Next token is token '-' ()
Shifting token 45 ('-'), Entering state 14
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 14 4 10 14
Entering state 23
Reading a token: Next token is token ')' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5 7 14 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5 7 14
Entering state 23
Reading a token: Next token is token '=' ()
Reducing via rule 8 (line 70), exp '-' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 3
Reducing via rule 3 (line 56), '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18 27 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 7 18
Entering state 27
Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Next token is token '(' ()
Shifting token 40 ('('), Entering state 4
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4
Entering state 10
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 4 10 18
Entering state 27
Reading a token: Next token is token ')' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5 4
Entering state 10
Next token is token ')' ()
Shifting token 41 (')'), Entering state 21
Reducing via rule 13 (line 75), '(' exp ')'  -> exp
state stack now 0 5
Entering state 7
Reading a token: Next token is token '^' ()
Shifting token 94 ('^'), Entering state 18
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 18
Entering state 27
Reading a token: Next token is token '=' ()
Reducing via rule 12 (line 74), exp '^' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '=' ()
Shifting token 61 ('='), Entering state 13
Reading a token: Next token is token "number" ()
Shifting token 258 ("number"), Entering state 1
Reducing via rule 5 (line 61), "number"  -> exp
state stack now 0 5 7 13
Entering state 22
Reading a token: Next token is token '\n' ()
Reducing via rule 6 (line 63), exp '=' exp  -> exp
state stack now 0 5
Entering state 7
Next token is token '\n' ()
Shifting token 10 ('\n'), Entering state 19
Reducing via rule 4 (line 58), exp '\n'  -> line
state stack now 0 5
Entering state 12
Reducing via rule 2 (line 53), input line  -> input
state stack now 0
Entering state 5
Reading a token: Now at end of input.
calc.at:463: wc -l <stderr | sed 's/[^0-9]//g'
--- -   Fri Nov 29 04:05:01 2002
+++ /u76/gnu/src/bison-1.75/IRIX6_mips/tests/testsuite.dir/at-stdout    Fri Nov 
29 04:05:01 2002
@@ -1,2 +1,2 @@
-486
+369
 
60. calc.at:463: FAILED near `calc.at:463'

## ------------------- ##
## Configuration logs. ##
## ------------------- ##


reply via email to

[Prev in Thread] Current Thread [Next in Thread]