[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Bison 1.50 test failure on 64-bit SPARC
From: |
Paul Eggert |
Subject: |
Bison 1.50 test failure on 64-bit SPARC |
Date: |
Sun, 6 Oct 2002 00:43:29 -0700 (PDT) |
On Solaris 8 (64-bit SPARC, compiled with Sun WorkShop 6 update 2 C
5.3 Patch 111679-08 2002/05/09), Bison 1.50 "make check" fails on
these two tests:
66: existing.at:24 FAILED near `existing.at:355'
67: existing.at:364 FAILED near `existing.at:1195'
I took a quick look at test 66 and was a bit mystified.
If I take that test's input.y and run the command:
bison --trace=all --report=all input.y
then I get behavior that is identical to that of 32-bit bison,
except for trivial differences in the execution-time reports.
But if I run the command without the --trace=all option, i.e.:
bison --report=all input.y
then 64-bit Bison outputs incorrect information: it claims 227
shift/reduce conflicts instead of the correct 64. However, the
generated input.tab.c files are identical, if I comment-out the
"%expect 65" line in input.y.
Any suggestions for debugging this? Not having --trace is a pain....
If it helps, here is a diff -prubw listing comparing the input.output
files generated by the (correct) 32-bit Bison 1.50 and the (incorrect)
64-bit Bison 1.50.
diff -prubw 32/input.output 64/input.output
--- 32/input.output 2002-10-06 00:33:36.432108223 -0700
+++ 64/input.output 2002-10-06 00:32:56.432256795 -0700
@@ -7,39 +7,52 @@ State 0 contains 1 shift/reduce conflict
State 3 contains 1 shift/reduce conflict.
State 4 contains 20 shift/reduce conflicts.
State 15 contains 2 shift/reduce conflicts.
+State 19 contains 1 shift/reduce conflict.
State 34 contains 2 shift/reduce conflicts.
State 36 contains 2 shift/reduce conflicts.
State 43 contains 1 shift/reduce conflict.
State 44 contains 1 shift/reduce conflict.
State 48 contains 1 shift/reduce conflict.
+State 56 contains 1 shift/reduce conflict.
State 57 contains 2 shift/reduce conflicts.
+State 58 contains 1 shift/reduce conflict.
+State 61 contains 1 shift/reduce conflict.
State 66 contains 1 shift/reduce conflict.
+State 86 contains 2 shift/reduce conflicts.
State 110 contains 1 shift/reduce conflict.
-State 146 contains 1 shift/reduce conflict.
-State 147 contains 1 shift/reduce conflict.
-State 149 contains 1 shift/reduce conflict.
-State 150 contains 1 shift/reduce conflict.
-State 153 contains 1 shift/reduce conflict.
-State 154 contains 1 shift/reduce conflict.
+State 146 contains 7 shift/reduce conflicts.
+State 147 contains 11 shift/reduce conflicts.
+State 149 contains 14 shift/reduce conflicts.
+State 150 contains 15 shift/reduce conflicts.
+State 153 contains 7 shift/reduce conflicts.
+State 154 contains 7 shift/reduce conflicts.
State 155 contains 2 shift/reduce conflicts.
State 156 contains 2 shift/reduce conflicts.
+State 157 contains 4 shift/reduce conflicts.
+State 158 contains 4 shift/reduce conflicts.
+State 159 contains 1 shift/reduce conflict.
+State 160 contains 1 shift/reduce conflict.
+State 161 contains 1 shift/reduce conflict.
+State 162 contains 1 shift/reduce conflict.
State 181 contains 2 shift/reduce conflicts.
State 188 contains 2 shift/reduce conflicts.
State 189 contains 2 shift/reduce conflicts.
State 193 contains 1 shift/reduce conflict.
+State 199 contains 2 shift/reduce conflicts.
State 209 contains 1 shift/reduce conflict.
-State 213 contains 1 shift/reduce conflict.
+State 213 contains 17 shift/reduce conflicts.
State 220 contains 1 shift/reduce conflict.
State 223 contains 1 shift/reduce conflict.
+State 240 contains 2 shift/reduce conflicts.
State 249 contains 1 shift/reduce conflict.
-State 251 contains 1 shift/reduce conflict.
-State 270 contains 1 shift/reduce conflict.
-State 271 contains 1 shift/reduce conflict.
-State 273 contains 1 shift/reduce conflict.
-State 274 contains 1 shift/reduce conflict.
-State 289 contains 1 shift/reduce conflict.
+State 251 contains 17 shift/reduce conflicts.
+State 270 contains 7 shift/reduce conflicts.
+State 271 contains 7 shift/reduce conflicts.
+State 273 contains 10 shift/reduce conflicts.
+State 274 contains 11 shift/reduce conflicts.
+State 289 contains 13 shift/reduce conflicts.
State 293 contains 1 shift/reduce conflict.
-State 301 contains 1 shift/reduce conflict.
+State 301 contains 13 shift/reduce conflicts.
Grammar
@@ -758,10 +771,11 @@ state 18
state 19
142 non_post_simp_exp: LEX_LENGTH . '(' opt_expression_list r_paren
- 143 | LEX_LENGTH . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', ')', ']', '{', ';']
+ 143 | LEX_LENGTH . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
'(' shift, and go to state 53
+ '(' [reduce using rule 143 (non_post_simp_exp)]
$default reduce using rule 143 (non_post_simp_exp)
Conflict between rule 143 and token '(' resolved as shift (LEX_LENGTH <
'(').
@@ -2045,10 +2059,11 @@ state 56
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
136 | simp_exp . '-' simp_exp
- 151 non_post_simp_exp: '+' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 151 non_post_simp_exp: '+' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
'^' shift, and go to state 92
+ '^' [reduce using rule 151 (non_post_simp_exp)]
$default reduce using rule 151 (non_post_simp_exp)
Conflict between rule 151 and token '+' resolved as reduce ('+' < UNARY).
Conflict between rule 151 and token '-' resolved as reduce ('-' < UNARY).
@@ -2080,10 +2095,11 @@ state 58
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
136 | simp_exp . '-' simp_exp
- 150 non_post_simp_exp: '-' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 150 non_post_simp_exp: '-' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
'^' shift, and go to state 92
+ '^' [reduce using rule 150 (non_post_simp_exp)]
$default reduce using rule 150 (non_post_simp_exp)
Conflict between rule 150 and token '+' resolved as reduce ('+' < UNARY).
Conflict between rule 150 and token '-' resolved as reduce ('-' < UNARY).
@@ -2115,10 +2131,11 @@ state 61
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
136 | simp_exp . '-' simp_exp
- 139 non_post_simp_exp: '!' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 139 non_post_simp_exp: '!' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
'^' shift, and go to state 92
+ '^' [reduce using rule 139 (non_post_simp_exp)]
$default reduce using rule 139 (non_post_simp_exp)
Conflict between rule 139 and token '+' resolved as reduce ('+' < UNARY).
Conflict between rule 139 and token '-' resolved as reduce ('-' < UNARY).
@@ -3001,7 +3018,7 @@ state 85
state 86
- 116 exp: exp simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING, RELOP,
MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN,
LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '!', '$', '(', ')', ']',
'{', ';']
+ 116 exp: exp simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING, RELOP,
MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN,
LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '+', '-', '!', '$', '(',
')', ']', '{', ';']
131 simp_exp: simp_exp . '^' simp_exp
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
@@ -3016,6 +3033,8 @@ state 86
'%' shift, and go to state 91
'^' shift, and go to state 92
+ '+' [reduce using rule 116 (exp)]
+ '-' [reduce using rule 116 (exp)]
$default reduce using rule 116 (exp)
Conflict between rule 116 and token '+' resolved as shift (CONCAT_OP <
'+').
Conflict between rule 116 and token '-' resolved as shift (CONCAT_OP <
'-').
@@ -4686,8 +4705,8 @@ state 146
106 | exp . LEX_OR exp
107 | exp . MATCHOP exp
110 | exp . LEX_IN NAME
- 111 | exp . RELOP exp [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
- 111 | exp RELOP exp . [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
+ 111 | exp . RELOP exp [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 111 | exp RELOP exp . [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
112 | exp . '<' exp
113 | exp . '>' exp
114 | exp . '?' exp ':' exp
@@ -4735,7 +4754,13 @@ state 146
'|' error (nonassociative)
TWOWAYIO error (nonassociative)
- NAME [reduce using rule 111 (exp)]
+ INCREMENT [reduce using rule 111 (exp)]
+ DECREMENT [reduce using rule 111 (exp)]
+ '+' [reduce using rule 111 (exp)]
+ '-' [reduce using rule 111 (exp)]
+ '!' [reduce using rule 111 (exp)]
+ '$' [reduce using rule 111 (exp)]
+ '(' [reduce using rule 111 (exp)]
$default reduce using rule 111 (exp)
simp_exp go to state 86
@@ -4771,8 +4796,8 @@ state 147
103 | exp . TWOWAYIO LEX_GETLINE opt_variable
105 | exp . LEX_AND exp
106 | exp . LEX_OR exp
- 107 | exp . MATCHOP exp [error, FUNC_CALL, NAME, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
- 107 | exp MATCHOP exp . [error, FUNC_CALL, NAME, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
+ 107 | exp . MATCHOP exp [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 107 | exp MATCHOP exp . [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
110 | exp . LEX_IN NAME
111 | exp . RELOP exp
112 | exp . '<' exp
@@ -4823,7 +4848,17 @@ state 147
MATCHOP error (nonassociative)
- NAME [reduce using rule 107 (exp)]
+ INCREMENT [reduce using rule 107 (exp)]
+ DECREMENT [reduce using rule 107 (exp)]
+ '<' [reduce using rule 107 (exp)]
+ '>' [reduce using rule 107 (exp)]
+ '|' [reduce using rule 107 (exp)]
+ TWOWAYIO [reduce using rule 107 (exp)]
+ '+' [reduce using rule 107 (exp)]
+ '-' [reduce using rule 107 (exp)]
+ '!' [reduce using rule 107 (exp)]
+ '$' [reduce using rule 107 (exp)]
+ '(' [reduce using rule 107 (exp)]
$default reduce using rule 107 (exp)
simp_exp go to state 86
@@ -4864,8 +4899,8 @@ state 149
102 exp: exp . '|' LEX_GETLINE opt_variable
103 | exp . TWOWAYIO LEX_GETLINE opt_variable
- 105 | exp . LEX_AND exp [error, NAME, NEWLINE, LEX_AND, LEX_OR, '?',
':', ',', ')', ']', '{', ';']
- 105 | exp LEX_AND exp . [error, NAME, NEWLINE, LEX_AND, LEX_OR, '?',
':', ',', ')', ']', '{', ';']
+ 105 | exp . LEX_AND exp [LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '+', '-', '!',
'$', '(', ')', ']', '{', ';']
+ 105 | exp LEX_AND exp . [LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '+', '-', '!',
'$', '(', ')', ']', '{', ';']
106 | exp . LEX_OR exp
107 | exp . MATCHOP exp
110 | exp . LEX_IN NAME
@@ -4921,7 +4956,20 @@ state 149
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 105 (exp)]
+ LEX_IN [reduce using rule 105 (exp)]
+ INCREMENT [reduce using rule 105 (exp)]
+ DECREMENT [reduce using rule 105 (exp)]
+ LEX_BUILTIN [reduce using rule 105 (exp)]
+ LEX_LENGTH [reduce using rule 105 (exp)]
+ '<' [reduce using rule 105 (exp)]
+ '>' [reduce using rule 105 (exp)]
+ '|' [reduce using rule 105 (exp)]
+ TWOWAYIO [reduce using rule 105 (exp)]
+ '+' [reduce using rule 105 (exp)]
+ '-' [reduce using rule 105 (exp)]
+ '!' [reduce using rule 105 (exp)]
+ '$' [reduce using rule 105 (exp)]
+ '(' [reduce using rule 105 (exp)]
$default reduce using rule 105 (exp)
simp_exp go to state 86
@@ -4956,8 +5004,8 @@ state 150
102 exp: exp . '|' LEX_GETLINE opt_variable
103 | exp . TWOWAYIO LEX_GETLINE opt_variable
105 | exp . LEX_AND exp
- 106 | exp . LEX_OR exp [error, NAME, NEWLINE, LEX_OR, '?', ':', ',',
')', ']', '{', ';']
- 106 | exp LEX_OR exp . [error, NAME, NEWLINE, LEX_OR, '?', ':', ',',
')', ']', '{', ';']
+ 106 | exp . LEX_OR exp [LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '+', '-', '!',
'$', '(', ')', ']', '{', ';']
+ 106 | exp LEX_OR exp . [LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO, '+', '-', '!',
'$', '(', ')', ']', '{', ';']
107 | exp . MATCHOP exp
110 | exp . LEX_IN NAME
111 | exp . RELOP exp
@@ -5013,7 +5061,21 @@ state 150
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 106 (exp)]
+ LEX_IN [reduce using rule 106 (exp)]
+ LEX_AND [reduce using rule 106 (exp)]
+ INCREMENT [reduce using rule 106 (exp)]
+ DECREMENT [reduce using rule 106 (exp)]
+ LEX_BUILTIN [reduce using rule 106 (exp)]
+ LEX_LENGTH [reduce using rule 106 (exp)]
+ '<' [reduce using rule 106 (exp)]
+ '>' [reduce using rule 106 (exp)]
+ '|' [reduce using rule 106 (exp)]
+ TWOWAYIO [reduce using rule 106 (exp)]
+ '+' [reduce using rule 106 (exp)]
+ '-' [reduce using rule 106 (exp)]
+ '!' [reduce using rule 106 (exp)]
+ '$' [reduce using rule 106 (exp)]
+ '(' [reduce using rule 106 (exp)]
$default reduce using rule 106 (exp)
simp_exp go to state 86
@@ -5193,8 +5255,8 @@ state 153
107 | exp . MATCHOP exp
110 | exp . LEX_IN NAME
111 | exp . RELOP exp
- 112 | exp . '<' exp [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
- 112 | exp '<' exp . [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
+ 112 | exp . '<' exp [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 112 | exp '<' exp . [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
113 | exp . '>' exp
114 | exp . '?' exp ':' exp
116 | exp . simp_exp
@@ -5241,7 +5303,13 @@ state 153
'|' error (nonassociative)
TWOWAYIO error (nonassociative)
- NAME [reduce using rule 112 (exp)]
+ INCREMENT [reduce using rule 112 (exp)]
+ DECREMENT [reduce using rule 112 (exp)]
+ '+' [reduce using rule 112 (exp)]
+ '-' [reduce using rule 112 (exp)]
+ '!' [reduce using rule 112 (exp)]
+ '$' [reduce using rule 112 (exp)]
+ '(' [reduce using rule 112 (exp)]
$default reduce using rule 112 (exp)
simp_exp go to state 86
@@ -5281,8 +5349,8 @@ state 154
110 | exp . LEX_IN NAME
111 | exp . RELOP exp
112 | exp . '<' exp
- 113 | exp . '>' exp [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
- 113 | exp '>' exp . [error, FUNC_CALL, NAME, MATCHOP, NEWLINE, LEX_IN,
LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', ')', ']', '{', ';']
+ 113 | exp . '>' exp [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 113 | exp '>' exp . [error, FUNC_CALL, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
114 | exp . '?' exp ':' exp
116 | exp . simp_exp
130 simp_exp: . non_post_simp_exp
@@ -5328,7 +5396,13 @@ state 154
'|' error (nonassociative)
TWOWAYIO error (nonassociative)
- NAME [reduce using rule 113 (exp)]
+ INCREMENT [reduce using rule 113 (exp)]
+ DECREMENT [reduce using rule 113 (exp)]
+ '+' [reduce using rule 113 (exp)]
+ '-' [reduce using rule 113 (exp)]
+ '!' [reduce using rule 113 (exp)]
+ '$' [reduce using rule 113 (exp)]
+ '(' [reduce using rule 113 (exp)]
$default reduce using rule 113 (exp)
simp_exp go to state 86
@@ -5404,8 +5478,8 @@ state 157
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
134 | simp_exp . '%' simp_exp
- 135 | simp_exp . '+' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
- 135 | simp_exp '+' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 135 | simp_exp . '+' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 135 | simp_exp '+' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
136 | simp_exp . '-' simp_exp
'*' shift, and go to state 89
@@ -5413,6 +5487,10 @@ state 157
'%' shift, and go to state 91
'^' shift, and go to state 92
+ '*' [reduce using rule 135 (simp_exp)]
+ '/' [reduce using rule 135 (simp_exp)]
+ '%' [reduce using rule 135 (simp_exp)]
+ '^' [reduce using rule 135 (simp_exp)]
$default reduce using rule 135 (simp_exp)
Conflict between rule 135 and token '+' resolved as reduce (%left '+').
Conflict between rule 135 and token '-' resolved as reduce (%left '-').
@@ -5429,14 +5507,18 @@ state 158
133 | simp_exp . '/' simp_exp
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
- 136 | simp_exp . '-' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
- 136 | simp_exp '-' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 136 | simp_exp . '-' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 136 | simp_exp '-' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
'*' shift, and go to state 89
'/' shift, and go to state 90
'%' shift, and go to state 91
'^' shift, and go to state 92
+ '*' [reduce using rule 136 (simp_exp)]
+ '/' [reduce using rule 136 (simp_exp)]
+ '%' [reduce using rule 136 (simp_exp)]
+ '^' [reduce using rule 136 (simp_exp)]
$default reduce using rule 136 (simp_exp)
Conflict between rule 136 and token '+' resolved as reduce (%left '+').
Conflict between rule 136 and token '-' resolved as reduce (%left '-').
@@ -5449,8 +5531,8 @@ state 158
state 159
131 simp_exp: simp_exp . '^' simp_exp
- 132 | simp_exp . '*' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
- 132 | simp_exp '*' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 132 | simp_exp . '*' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 132 | simp_exp '*' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
133 | simp_exp . '/' simp_exp
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
@@ -5458,6 +5540,7 @@ state 159
'^' shift, and go to state 92
+ '^' [reduce using rule 132 (simp_exp)]
$default reduce using rule 132 (simp_exp)
Conflict between rule 132 and token '+' resolved as reduce ('+' < '*').
Conflict between rule 132 and token '-' resolved as reduce ('-' < '*').
@@ -5471,14 +5554,15 @@ state 160
131 simp_exp: simp_exp . '^' simp_exp
132 | simp_exp . '*' simp_exp
- 133 | simp_exp . '/' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
- 133 | simp_exp '/' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 133 | simp_exp . '/' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 133 | simp_exp '/' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
134 | simp_exp . '%' simp_exp
135 | simp_exp . '+' simp_exp
136 | simp_exp . '-' simp_exp
'^' shift, and go to state 92
+ '^' [reduce using rule 133 (simp_exp)]
$default reduce using rule 133 (simp_exp)
Conflict between rule 133 and token '+' resolved as reduce ('+' < '/').
Conflict between rule 133 and token '-' resolved as reduce ('-' < '/').
@@ -5493,13 +5577,14 @@ state 161
131 simp_exp: simp_exp . '^' simp_exp
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
- 134 | simp_exp . '%' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
- 134 | simp_exp '%' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 134 | simp_exp . '%' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 134 | simp_exp '%' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
135 | simp_exp . '+' simp_exp
136 | simp_exp . '-' simp_exp
'^' shift, and go to state 92
+ '^' [reduce using rule 134 (simp_exp)]
$default reduce using rule 134 (simp_exp)
Conflict between rule 134 and token '+' resolved as reduce ('+' < '%').
Conflict between rule 134 and token '-' resolved as reduce ('-' < '%').
@@ -5511,8 +5596,8 @@ state 161
state 162
- 131 simp_exp: simp_exp . '^' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
- 131 | simp_exp '^' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '$', '(', ')', ']', '{', ';']
+ 131 simp_exp: simp_exp . '^' simp_exp [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
+ 131 | simp_exp '^' simp_exp . [error, FUNC_CALL, NAME, YNUMBER,
YSTRING, RELOP, APPEND_OP, ASSIGNOP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|',
TWOWAYIO, '+', '-', '*', '/', '%', '!', '^', '$', '(', ')', ']', '{', ';']
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
134 | simp_exp . '%' simp_exp
@@ -5521,6 +5606,7 @@ state 162
'^' shift, and go to state 92
+ '^' [reduce using rule 131 (simp_exp)]
$default reduce using rule 131 (simp_exp)
Conflict between rule 131 and token '+' resolved as reduce ('+' < '^').
Conflict between rule 131 and token '-' resolved as reduce ('-' < '^').
@@ -6690,7 +6776,7 @@ state 198
state 199
- 68 input_redir: '<' simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING,
RELOP, APPEND_OP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT,
DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO,
'!', '$', '(', ')', ']', '{', ';']
+ 68 input_redir: '<' simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING,
RELOP, APPEND_OP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT,
DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO,
'+', '-', '!', '$', '(', ')', ']', '{', ';']
131 simp_exp: simp_exp . '^' simp_exp
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
@@ -6705,6 +6791,8 @@ state 199
'%' shift, and go to state 91
'^' shift, and go to state 92
+ '+' [reduce using rule 68 (input_redir)]
+ '-' [reduce using rule 68 (input_redir)]
$default reduce using rule 68 (input_redir)
Conflict between rule 68 and token '+' resolved as shift ('<' < '+').
Conflict between rule 68 and token '-' resolved as shift ('<' < '-').
@@ -7012,7 +7100,7 @@ state 212
state 213
- 100 exp: variable ASSIGNOP @6 exp . [error, NAME, NEWLINE, ':', ',', ')',
']', '{', ';']
+ 100 exp: variable ASSIGNOP @6 exp . [LEX_IN, LEX_AND, LEX_OR, INCREMENT,
DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO,
'+', '-', '!', '$', '(', ')', ']', '{', ';']
102 | exp . '|' LEX_GETLINE opt_variable
103 | exp . TWOWAYIO LEX_GETLINE opt_variable
105 | exp . LEX_AND exp
@@ -7074,7 +7162,23 @@ state 213
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 100 (exp)]
+ LEX_IN [reduce using rule 100 (exp)]
+ LEX_AND [reduce using rule 100 (exp)]
+ LEX_OR [reduce using rule 100 (exp)]
+ INCREMENT [reduce using rule 100 (exp)]
+ DECREMENT [reduce using rule 100 (exp)]
+ LEX_BUILTIN [reduce using rule 100 (exp)]
+ LEX_LENGTH [reduce using rule 100 (exp)]
+ '?' [reduce using rule 100 (exp)]
+ '<' [reduce using rule 100 (exp)]
+ '>' [reduce using rule 100 (exp)]
+ '|' [reduce using rule 100 (exp)]
+ TWOWAYIO [reduce using rule 100 (exp)]
+ '+' [reduce using rule 100 (exp)]
+ '-' [reduce using rule 100 (exp)]
+ '!' [reduce using rule 100 (exp)]
+ '$' [reduce using rule 100 (exp)]
+ '(' [reduce using rule 100 (exp)]
$default reduce using rule 100 (exp)
simp_exp go to state 86
@@ -8210,7 +8314,7 @@ state 239
state 240
- 129 rexp: rexp simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING, RELOP,
APPEND_OP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|', TWOWAYIO, '!', '$', '(', ';']
+ 129 rexp: rexp simp_exp . [error, FUNC_CALL, NAME, YNUMBER, YSTRING, RELOP,
APPEND_OP, MATCHOP, NEWLINE, LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT,
LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|', TWOWAYIO, '+', '-', '!', '$',
'(', ';']
131 simp_exp: simp_exp . '^' simp_exp
132 | simp_exp . '*' simp_exp
133 | simp_exp . '/' simp_exp
@@ -8225,6 +8329,8 @@ state 240
'%' shift, and go to state 91
'^' shift, and go to state 92
+ '+' [reduce using rule 129 (rexp)]
+ '-' [reduce using rule 129 (rexp)]
$default reduce using rule 129 (rexp)
Conflict between rule 129 and token '+' resolved as shift (CONCAT_OP <
'+').
Conflict between rule 129 and token '-' resolved as shift (CONCAT_OP <
'-').
@@ -8336,8 +8442,8 @@ state 251
111 | exp . RELOP exp
112 | exp . '<' exp
113 | exp . '>' exp
- 114 | exp . '?' exp ':' exp [error, NAME, NEWLINE, ':', ',', ')', ']',
'{', ';']
- 114 | exp '?' exp ':' exp . [error, NAME, NEWLINE, ':', ',', ')', ']',
'{', ';']
+ 114 | exp . '?' exp ':' exp [LEX_IN, LEX_AND, LEX_OR, INCREMENT,
DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO,
'+', '-', '!', '$', '(', ')', ']', '{', ';']
+ 114 | exp '?' exp ':' exp . [LEX_IN, LEX_AND, LEX_OR, INCREMENT,
DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '<', '>', '|', TWOWAYIO,
'+', '-', '!', '$', '(', ')', ']', '{', ';']
116 | exp . simp_exp
130 simp_exp: . non_post_simp_exp
131 | . simp_exp '^' simp_exp
@@ -8389,7 +8495,23 @@ state 251
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 114 (exp)]
+ LEX_IN [reduce using rule 114 (exp)]
+ LEX_AND [reduce using rule 114 (exp)]
+ LEX_OR [reduce using rule 114 (exp)]
+ INCREMENT [reduce using rule 114 (exp)]
+ DECREMENT [reduce using rule 114 (exp)]
+ LEX_BUILTIN [reduce using rule 114 (exp)]
+ LEX_LENGTH [reduce using rule 114 (exp)]
+ '?' [reduce using rule 114 (exp)]
+ '<' [reduce using rule 114 (exp)]
+ '>' [reduce using rule 114 (exp)]
+ '|' [reduce using rule 114 (exp)]
+ TWOWAYIO [reduce using rule 114 (exp)]
+ '+' [reduce using rule 114 (exp)]
+ '-' [reduce using rule 114 (exp)]
+ '!' [reduce using rule 114 (exp)]
+ '$' [reduce using rule 114 (exp)]
+ '(' [reduce using rule 114 (exp)]
$default reduce using rule 114 (exp)
simp_exp go to state 86
@@ -8969,8 +9091,8 @@ state 270
120 | rexp . LEX_OR rexp
124 | rexp . MATCHOP rexp
125 | rexp . LEX_IN NAME
- 126 | rexp . RELOP rexp [error, FUNC_CALL, NAME, APPEND_OP, MATCHOP,
NEWLINE, LEX_IN, LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>',
'|', TWOWAYIO, ';']
- 126 | rexp RELOP rexp . [error, FUNC_CALL, NAME, APPEND_OP, MATCHOP,
NEWLINE, LEX_IN, LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>',
'|', TWOWAYIO, ';']
+ 126 | rexp . RELOP rexp [error, FUNC_CALL, APPEND_OP, MATCHOP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?',
':', ',', '>', '|', TWOWAYIO, '+', '-', '!', '$', '(', ';']
+ 126 | rexp RELOP rexp . [error, FUNC_CALL, APPEND_OP, MATCHOP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?',
':', ',', '>', '|', TWOWAYIO, '+', '-', '!', '$', '(', ';']
127 | rexp . '?' rexp ':' rexp
129 | rexp . simp_exp
130 simp_exp: . non_post_simp_exp
@@ -9012,7 +9134,13 @@ state 270
RELOP error (nonassociative)
- NAME [reduce using rule 126 (rexp)]
+ INCREMENT [reduce using rule 126 (rexp)]
+ DECREMENT [reduce using rule 126 (rexp)]
+ '+' [reduce using rule 126 (rexp)]
+ '-' [reduce using rule 126 (rexp)]
+ '!' [reduce using rule 126 (rexp)]
+ '$' [reduce using rule 126 (rexp)]
+ '(' [reduce using rule 126 (rexp)]
$default reduce using rule 126 (rexp)
simp_exp go to state 240
@@ -9042,8 +9170,8 @@ state 271
119 rexp: rexp . LEX_AND rexp
120 | rexp . LEX_OR rexp
- 124 | rexp . MATCHOP rexp [error, FUNC_CALL, NAME, APPEND_OP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, ';']
- 124 | rexp MATCHOP rexp . [error, FUNC_CALL, NAME, APPEND_OP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, ';']
+ 124 | rexp . MATCHOP rexp [error, FUNC_CALL, APPEND_OP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?',
':', ',', '>', '|', TWOWAYIO, '+', '-', '!', '$', '(', ';']
+ 124 | rexp MATCHOP rexp . [error, FUNC_CALL, APPEND_OP, NEWLINE,
LEX_IN, LEX_AND, LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?',
':', ',', '>', '|', TWOWAYIO, '+', '-', '!', '$', '(', ';']
125 | rexp . LEX_IN NAME
126 | rexp . RELOP rexp
127 | rexp . '?' rexp ':' rexp
@@ -9088,7 +9216,13 @@ state 271
MATCHOP error (nonassociative)
- NAME [reduce using rule 124 (rexp)]
+ INCREMENT [reduce using rule 124 (rexp)]
+ DECREMENT [reduce using rule 124 (rexp)]
+ '+' [reduce using rule 124 (rexp)]
+ '-' [reduce using rule 124 (rexp)]
+ '!' [reduce using rule 124 (rexp)]
+ '$' [reduce using rule 124 (rexp)]
+ '(' [reduce using rule 124 (rexp)]
$default reduce using rule 124 (rexp)
simp_exp go to state 240
@@ -9123,8 +9257,8 @@ state 272
state 273
- 119 rexp: rexp . LEX_AND rexp [error, NAME, APPEND_OP, NEWLINE, LEX_AND,
LEX_OR, '?', ':', ',', '>', '|', TWOWAYIO, ';']
- 119 | rexp LEX_AND rexp . [error, NAME, APPEND_OP, NEWLINE, LEX_AND,
LEX_OR, '?', ':', ',', '>', '|', TWOWAYIO, ';']
+ 119 rexp: rexp . LEX_AND rexp [APPEND_OP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
+ 119 | rexp LEX_AND rexp . [APPEND_OP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
120 | rexp . LEX_OR rexp
124 | rexp . MATCHOP rexp
125 | rexp . LEX_IN NAME
@@ -9174,7 +9308,16 @@ state 273
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 119 (rexp)]
+ LEX_IN [reduce using rule 119 (rexp)]
+ INCREMENT [reduce using rule 119 (rexp)]
+ DECREMENT [reduce using rule 119 (rexp)]
+ LEX_BUILTIN [reduce using rule 119 (rexp)]
+ LEX_LENGTH [reduce using rule 119 (rexp)]
+ '+' [reduce using rule 119 (rexp)]
+ '-' [reduce using rule 119 (rexp)]
+ '!' [reduce using rule 119 (rexp)]
+ '$' [reduce using rule 119 (rexp)]
+ '(' [reduce using rule 119 (rexp)]
$default reduce using rule 119 (rexp)
simp_exp go to state 240
@@ -9203,8 +9346,8 @@ state 273
state 274
119 rexp: rexp . LEX_AND rexp
- 120 | rexp . LEX_OR rexp [error, NAME, APPEND_OP, NEWLINE, LEX_OR, '?',
':', ',', '>', '|', TWOWAYIO, ';']
- 120 | rexp LEX_OR rexp . [error, NAME, APPEND_OP, NEWLINE, LEX_OR, '?',
':', ',', '>', '|', TWOWAYIO, ';']
+ 120 | rexp . LEX_OR rexp [APPEND_OP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
+ 120 | rexp LEX_OR rexp . [APPEND_OP, NEWLINE, LEX_IN, LEX_AND, LEX_OR,
INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
124 | rexp . MATCHOP rexp
125 | rexp . LEX_IN NAME
126 | rexp . RELOP rexp
@@ -9254,7 +9397,17 @@ state 274
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 120 (rexp)]
+ LEX_IN [reduce using rule 120 (rexp)]
+ LEX_AND [reduce using rule 120 (rexp)]
+ INCREMENT [reduce using rule 120 (rexp)]
+ DECREMENT [reduce using rule 120 (rexp)]
+ LEX_BUILTIN [reduce using rule 120 (rexp)]
+ LEX_LENGTH [reduce using rule 120 (rexp)]
+ '+' [reduce using rule 120 (rexp)]
+ '-' [reduce using rule 120 (rexp)]
+ '!' [reduce using rule 120 (rexp)]
+ '$' [reduce using rule 120 (rexp)]
+ '(' [reduce using rule 120 (rexp)]
$default reduce using rule 120 (rexp)
simp_exp go to state 240
@@ -9934,7 +10087,7 @@ state 288
state 289
- 118 rexp: variable ASSIGNOP @7 rexp . [error, NAME, APPEND_OP, NEWLINE,
':', ',', '>', '|', TWOWAYIO, ';']
+ 118 rexp: variable ASSIGNOP @7 rexp . [APPEND_OP, NEWLINE, LEX_IN, LEX_AND,
LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
119 | rexp . LEX_AND rexp
120 | rexp . LEX_OR rexp
124 | rexp . MATCHOP rexp
@@ -9988,7 +10141,19 @@ state 289
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 118 (rexp)]
+ LEX_IN [reduce using rule 118 (rexp)]
+ LEX_AND [reduce using rule 118 (rexp)]
+ LEX_OR [reduce using rule 118 (rexp)]
+ INCREMENT [reduce using rule 118 (rexp)]
+ DECREMENT [reduce using rule 118 (rexp)]
+ LEX_BUILTIN [reduce using rule 118 (rexp)]
+ LEX_LENGTH [reduce using rule 118 (rexp)]
+ '?' [reduce using rule 118 (rexp)]
+ '+' [reduce using rule 118 (rexp)]
+ '-' [reduce using rule 118 (rexp)]
+ '!' [reduce using rule 118 (rexp)]
+ '$' [reduce using rule 118 (rexp)]
+ '(' [reduce using rule 118 (rexp)]
$default reduce using rule 118 (rexp)
simp_exp go to state 240
@@ -10250,8 +10415,8 @@ state 301
124 | rexp . MATCHOP rexp
125 | rexp . LEX_IN NAME
126 | rexp . RELOP rexp
- 127 | rexp . '?' rexp ':' rexp [error, NAME, APPEND_OP, NEWLINE, ':',
',', '>', '|', TWOWAYIO, ';']
- 127 | rexp '?' rexp ':' rexp . [error, NAME, APPEND_OP, NEWLINE, ':',
',', '>', '|', TWOWAYIO, ';']
+ 127 | rexp . '?' rexp ':' rexp [APPEND_OP, NEWLINE, LEX_IN, LEX_AND,
LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
+ 127 | rexp '?' rexp ':' rexp . [APPEND_OP, NEWLINE, LEX_IN, LEX_AND,
LEX_OR, INCREMENT, DECREMENT, LEX_BUILTIN, LEX_LENGTH, '?', ':', ',', '>', '|',
TWOWAYIO, '+', '-', '!', '$', '(', ';']
129 | rexp . simp_exp
130 simp_exp: . non_post_simp_exp
131 | . simp_exp '^' simp_exp
@@ -10299,7 +10464,19 @@ state 301
'$' shift, and go to state 24
'(' shift, and go to state 55
- NAME [reduce using rule 127 (rexp)]
+ LEX_IN [reduce using rule 127 (rexp)]
+ LEX_AND [reduce using rule 127 (rexp)]
+ LEX_OR [reduce using rule 127 (rexp)]
+ INCREMENT [reduce using rule 127 (rexp)]
+ DECREMENT [reduce using rule 127 (rexp)]
+ LEX_BUILTIN [reduce using rule 127 (rexp)]
+ LEX_LENGTH [reduce using rule 127 (rexp)]
+ '?' [reduce using rule 127 (rexp)]
+ '+' [reduce using rule 127 (rexp)]
+ '-' [reduce using rule 127 (rexp)]
+ '!' [reduce using rule 127 (rexp)]
+ '$' [reduce using rule 127 (rexp)]
+ '(' [reduce using rule 127 (rexp)]
$default reduce using rule 127 (rexp)
simp_exp go to state 240
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- Bison 1.50 test failure on 64-bit SPARC,
Paul Eggert <=