akim@io ~bison $ ∫ -Wcou _build/g9d/tests/testsuite.dir/544/input.y
Shift-Reduce Conflict:
0: 65 opt_nls: . %empty
0: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example • program NEWLINE
First derivation start ::=[ opt_nls ::=[ • ] program opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example • NEWLINE program opt_nls
Second derivation start ::=[ opt_nls ::=[ nls ::=[ • NEWLINE ] ] program opt_nls ]
Shift-Reduce Conflict:
3: 66 opt_nls: nls .
3: 64 nls: nls . NEWLINE
On Symbol: NEWLINE
Example nls • program NEWLINE
First derivation start ::=[ opt_nls ::=[ nls • ] program opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example nls • NEWLINE program opt_nls
Second derivation start ::=[ opt_nls ::=[ nls ::=[ nls • NEWLINE ] ] program opt_nls ]
Shift-Reduce Conflict:
4: 6 program: . %empty
4: 4 program: . error
On Symbol: error
Example • error
First derivation program ::=[ program ::=[ • ] error ]
Example • error
Second derivation program ::=[ • error ]
Shift-Reduce Conflict:
15: 152 opt_variable: . %empty
15: 154 variable: . NAME
On Symbol: NAME
Example LEX_GETLINE • input_redir NAME '<' simp_exp
First derivation exp ::=[ exp ::=[ exp ::=[ LEX_GETLINE opt_variable ::=[ • ] input_redir ] simp_exp ::=[ non_post_simp_exp ::=[ variable ::=[ NAME ] ] ] ] '<' exp ::=[ simp_exp ] ]
Example LEX_GETLINE • NAME '<' simp_exp
Second derivation exp ::=[ LEX_GETLINE opt_variable ::=[ variable ::=[ • NAME ] ] input_redir ::=[ '<' simp_exp ] ]
Shift-Reduce Conflict:
34: 115 exp: simp_exp .
34: 135 simp_exp: simp_exp . '+' simp_exp
On Symbol: '+'
Example simp_exp • '+' simp_exp
First derivation exp ::=[ exp ::=[ simp_exp • ] simp_exp ::=[ non_post_simp_exp ::=[ '+' simp_exp ] ] ]
Example simp_exp • '+' simp_exp
Second derivation exp ::=[ simp_exp ::=[ simp_exp • '+' simp_exp ] ]
Shift-Reduce Conflict:
36: 145 non_post_simp_exp: variable .
36: 137 simp_exp: variable . INCREMENT
On Symbol: INCREMENT
time limit exceeded: 6,000000
First example opt_nls variable • INCREMENT variable action opt_nls $end
First derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ pattern ::=[ exp ::=[ exp ::=[ simp_exp ::=[ non_post_simp_exp ::=[ variable • ] ] ] simp_exp ::=[ non_post_simp_exp ::=[ INCREMENT variable ] ] ] ] action ] ] opt_nls ] $end ]
Second example opt_nls variable • INCREMENT action opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ pattern ::=[ exp ::=[ simp_exp ::=[ variable • INCREMENT ] ] ] action ] ] opt_nls ]
Shift-Reduce Conflict:
43: 36 statement_term: nls .
43: 64 nls: nls . NEWLINE
On Symbol: NEWLINE
Example opt_nls LEX_BEGIN nls • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ LEX_BEGIN statement_term ::=[ nls • ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls LEX_BEGIN nls • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ LEX_BEGIN statement_term ::=[ nls ::=[ nls • NEWLINE ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
44: 65 opt_nls: . %empty
44: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example opt_nls LEX_BEGIN semi • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ LEX_BEGIN statement_term ::=[ semi opt_nls ::=[ • ] ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls LEX_BEGIN semi • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ LEX_BEGIN statement_term ::=[ semi opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
48: 67 input_redir: . %empty
48: 68 input_redir: . '<' simp_exp
On Symbol: '<'
First example opt_nls LEX_GETLINE opt_variable • '<' exp action opt_nls $end
First derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ pattern ::=[ exp ::=[ exp ::=[ LEX_GETLINE opt_variable input_redir ::=[ • ] ] '<' exp ] ] action ] ] opt_nls ] $end ]
Second example opt_nls LEX_GETLINE opt_variable • '<' simp_exp action opt_nls $end
Second derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ pattern ::=[ exp ::=[ LEX_GETLINE opt_variable input_redir ::=[ • '<' simp_exp ] ] ] action ] ] opt_nls ] $end ]
Shift-Reduce Conflict:
57: 145 non_post_simp_exp: variable .
57: 137 simp_exp: variable . INCREMENT
On Symbol: INCREMENT
Productions leading up to the conflict state found. Still finding a possible unifying counterexample...time limit exceeded: 6,000000
First example INCREMENT
First derivation exp ::=[ INCREMENT ]
Second example variable • INCREMENT
Second derivation exp ::=[ simp_exp ::=[ variable • INCREMENT ] ]
Shift-Reduce Conflict:
66: 93 expression_list: exp .
66: 159 r_paren: . ')'
On Symbol: ')'
Example '(' exp • ')' LEX_IN NAME
First derivation exp ::=[ '(' expression_list ::=[ exp • ] r_paren ::=[ ')' ] LEX_IN NAME ]
Example '(' exp • ')' LEX_IN NAME
Second derivation exp ::=[ exp ::=[ simp_exp ::=[ non_post_simp_exp ::=[ '(' exp r_paren ::=[ • ')' ] ] ] ] LEX_IN NAME ]
Shift-Reduce Conflict:
110: 65 opt_nls: . %empty
110: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example l_brace '}' • opt_semi NEWLINE
First derivation action ::=[ l_brace r_brace ::=[ '}' opt_nls ::=[ • ] ] opt_semi opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example l_brace '}' • NEWLINE opt_semi opt_nls
Second derivation action ::=[ l_brace r_brace ::=[ '}' opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] opt_semi opt_nls ]
Shift-Reduce Conflict:
146: 111 exp: exp RELOP exp .
146: 154 variable: . NAME
On Symbol: NAME
Example exp RELOP exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp RELOP exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp RELOP exp • NAME INCREMENT
Second derivation exp ::=[ exp RELOP exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
147: 107 exp: exp MATCHOP exp .
147: 154 variable: . NAME
On Symbol: NAME
Example exp MATCHOP exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp MATCHOP exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp MATCHOP exp • NAME INCREMENT
Second derivation exp ::=[ exp MATCHOP exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
149: 105 exp: exp LEX_AND exp .
149: 154 variable: . NAME
On Symbol: NAME
Example exp LEX_AND exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp LEX_AND exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp LEX_AND exp • NAME INCREMENT
Second derivation exp ::=[ exp LEX_AND exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
150: 106 exp: exp LEX_OR exp .
150: 154 variable: . NAME
On Symbol: NAME
Example exp LEX_OR exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp LEX_OR exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp LEX_OR exp • NAME INCREMENT
Second derivation exp ::=[ exp LEX_OR exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
153: 112 exp: exp '<' exp .
153: 154 variable: . NAME
On Symbol: NAME
Example exp '<' exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp '<' exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp '<' exp • NAME INCREMENT
Second derivation exp ::=[ exp '<' exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
154: 113 exp: exp '>' exp .
154: 154 variable: . NAME
On Symbol: NAME
Example exp '>' exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp '>' exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp '>' exp • NAME INCREMENT
Second derivation exp ::=[ exp '>' exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
155: 152 opt_variable: . %empty
155: 154 variable: . NAME
On Symbol: NAME
Example exp '|' LEX_GETLINE • NAME
First derivation exp ::=[ exp ::=[ exp '|' LEX_GETLINE opt_variable ::=[ • ] ] simp_exp ::=[ non_post_simp_exp ::=[ variable ::=[ NAME ] ] ] ]
Example exp '|' LEX_GETLINE • NAME
Second derivation exp ::=[ exp '|' LEX_GETLINE opt_variable ::=[ variable ::=[ • NAME ] ] ]
Shift-Reduce Conflict:
156: 152 opt_variable: . %empty
156: 154 variable: . NAME
On Symbol: NAME
Example exp TWOWAYIO LEX_GETLINE • NAME
First derivation exp ::=[ exp ::=[ exp TWOWAYIO LEX_GETLINE opt_variable ::=[ • ] ] simp_exp ::=[ non_post_simp_exp ::=[ variable ::=[ NAME ] ] ] ]
Example exp TWOWAYIO LEX_GETLINE • NAME
Second derivation exp ::=[ exp TWOWAYIO LEX_GETLINE opt_variable ::=[ variable ::=[ • NAME ] ] ]
Shift-Reduce Conflict:
181: 152 opt_variable: . %empty
181: 154 variable: . NAME
On Symbol: NAME
time limit exceeded: 6,000000
First example opt_nls l_brace print LEX_GETLINE • input_redir NAME INCREMENT output_redir statement_term r_brace opt_semi opt_nls opt_nls $end
First derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements ::=[ statement ::=[ print opt_rexpression_list ::=[ rexpression_list ::=[ rexp ::=[ rexp ::=[ LEX_GETLINE opt_variable ::=[ • ] input_redir ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ] ] ] output_redir statement_term ] ] r_brace opt_semi opt_nls ] ] ] opt_nls ] $end ]
Second example opt_nls l_brace print LEX_GETLINE • NAME input_redir output_redir statement_term r_brace opt_semi opt_nls opt_nls $end
Second derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements ::=[ statement ::=[ print opt_rexpression_list ::=[ rexpression_list ::=[ rexp ::=[ LEX_GETLINE opt_variable ::=[ variable ::=[ • NAME ] ] input_redir ] ] ] output_redir statement_term ] ] r_brace opt_semi opt_nls ] ] ] opt_nls ] $end ]
Shift-Reduce Conflict:
188: 128 rexp: simp_exp .
188: 135 simp_exp: simp_exp . '+' simp_exp
On Symbol: '+'
Example simp_exp • '+' simp_exp
First derivation rexp ::=[ rexp ::=[ simp_exp • ] simp_exp ::=[ non_post_simp_exp ::=[ '+' simp_exp ] ] ]
Example simp_exp • '+' simp_exp
Second derivation rexp ::=[ simp_exp ::=[ simp_exp • '+' simp_exp ] ]
Shift-Reduce Conflict:
189: 145 non_post_simp_exp: variable .
189: 137 simp_exp: variable . INCREMENT
On Symbol: INCREMENT
time limit exceeded: 6,000000
First example opt_nls l_brace print variable • INCREMENT variable output_redir statement_term r_brace opt_semi opt_nls opt_nls $end
First derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements ::=[ statement ::=[ print opt_rexpression_list ::=[ rexpression_list ::=[ rexp ::=[ rexp ::=[ simp_exp ::=[ non_post_simp_exp ::=[ variable • ] ] ] simp_exp ::=[ non_post_simp_exp ::=[ INCREMENT variable ] ] ] ] ] output_redir statement_term ] ] r_brace opt_semi opt_nls ] ] ] opt_nls ] $end ]
Second example opt_nls l_brace print variable • INCREMENT output_redir statement_term r_brace opt_semi opt_nls opt_nls $end
Second derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statement ::=[ print opt_rexpression_list ::=[ rexpression_list ::=[ rexp ::=[ simp_exp ::=[ variable • INCREMENT ] ] ] ] output_redir statement_term ] r_brace opt_semi opt_nls ] ] ] opt_nls ] $end ]
Shift-Reduce Conflict:
193: 65 opt_nls: . %empty
193: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example opt_nls l_brace r_brace opt_semi • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace r_brace opt_semi opt_nls ::=[ • ] ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls l_brace r_brace opt_semi • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace r_brace opt_semi opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
209: 65 opt_nls: . %empty
209: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example opt_nls function_prologue l_brace r_brace opt_semi • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ function_prologue function_body ::=[ l_brace r_brace opt_semi opt_nls ::=[ • ] ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls function_prologue l_brace r_brace opt_semi • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ function_prologue function_body ::=[ l_brace r_brace opt_semi opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
213: 100 exp: variable ASSIGNOP $@6 exp .
213: 154 variable: . NAME
On Symbol: NAME
Example variable ASSIGNOP $@6 exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ variable ASSIGNOP $@6 exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example variable ASSIGNOP $@6 exp • NAME INCREMENT
Second derivation exp ::=[ variable ASSIGNOP $@6 exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
220: 154 variable: NAME .
220: 44 statement: LEX_FOR '(' NAME . LEX_IN NAME r_paren opt_nls statement
On Symbol: LEX_IN
First example opt_nls l_brace LEX_FOR '(' NAME • LEX_IN NAME semi opt_nls exp semi opt_nls opt_exp r_paren opt_nls statement r_brace opt_semi opt_nls opt_nls $end
First derivation $accept ::=[ start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements ::=[ statement ::=[ LEX_FOR '(' opt_exp ::=[ exp ::=[ exp ::=[ simp_exp ::=[ non_post_simp_exp ::=[ variable ::=[ NAME • ] ] ] ] LEX_IN NAME ] ] semi opt_nls exp semi opt_nls opt_exp r_paren opt_nls statement ] ] r_brace opt_semi opt_nls ] ] ] opt_nls ] $end ]
Second example opt_nls l_brace LEX_FOR '(' NAME • LEX_IN NAME r_paren opt_nls statement r_brace opt_semi opt_nls opt_nls $end
Second derivation $accept ::=[ start ::=[ opt_nls program ::=[ action ::=[ l_brace statements ::=[ statement ::=[ LEX_FOR '(' NAME • LEX_IN NAME r_paren opt_nls statement ] ] r_brace opt_semi opt_nls ] ] opt_nls ] $end ]
Shift-Reduce Conflict:
223: 65 opt_nls: . %empty
223: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example opt_nls l_brace statements r_brace opt_semi • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements r_brace opt_semi opt_nls ::=[ • ] ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls l_brace statements r_brace opt_semi • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ action ::=[ l_brace statements r_brace opt_semi opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
249: 65 opt_nls: . %empty
249: 63 nls: . NEWLINE
On Symbol: NEWLINE
Example opt_nls function_prologue l_brace statements r_brace opt_semi • NEWLINE
First derivation start ::=[ opt_nls program ::=[ rule ::=[ function_prologue function_body ::=[ l_brace statements r_brace opt_semi opt_nls ::=[ • ] ] ] ] opt_nls ::=[ nls ::=[ NEWLINE ] ] ]
Example opt_nls function_prologue l_brace statements r_brace opt_semi • NEWLINE opt_nls
Second derivation start ::=[ opt_nls program ::=[ rule ::=[ function_prologue function_body ::=[ l_brace statements r_brace opt_semi opt_nls ::=[ nls ::=[ • NEWLINE ] ] ] ] ] opt_nls ]
Shift-Reduce Conflict:
251: 114 exp: exp '?' exp ':' exp .
251: 154 variable: . NAME
On Symbol: NAME
Example exp '?' exp ':' exp • NAME INCREMENT
First derivation exp ::=[ exp ::=[ exp '?' exp ':' exp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example exp '?' exp ':' exp • NAME INCREMENT
Second derivation exp ::=[ exp '?' exp ':' exp ::=[ exp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
270: 126 rexp: rexp RELOP rexp .
270: 154 variable: . NAME
On Symbol: NAME
Example rexp RELOP rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ rexp RELOP rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example rexp RELOP rexp • NAME INCREMENT
Second derivation rexp ::=[ rexp RELOP rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
271: 124 rexp: rexp MATCHOP rexp .
271: 154 variable: . NAME
On Symbol: NAME
Example rexp MATCHOP rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ rexp MATCHOP rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example rexp MATCHOP rexp • NAME INCREMENT
Second derivation rexp ::=[ rexp MATCHOP rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
273: 119 rexp: rexp LEX_AND rexp .
273: 154 variable: . NAME
On Symbol: NAME
Example rexp LEX_AND rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ rexp LEX_AND rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example rexp LEX_AND rexp • NAME INCREMENT
Second derivation rexp ::=[ rexp LEX_AND rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
274: 120 rexp: rexp LEX_OR rexp .
274: 154 variable: . NAME
On Symbol: NAME
Example rexp LEX_OR rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ rexp LEX_OR rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example rexp LEX_OR rexp • NAME INCREMENT
Second derivation rexp ::=[ rexp LEX_OR rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
289: 118 rexp: variable ASSIGNOP $@7 rexp .
289: 154 variable: . NAME
On Symbol: NAME
Example variable ASSIGNOP $@7 rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ variable ASSIGNOP $@7 rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example variable ASSIGNOP $@7 rexp • NAME INCREMENT
Second derivation rexp ::=[ variable ASSIGNOP $@7 rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
Shift-Reduce Conflict:
293: 61 if_statement: LEX_IF '(' exp r_paren opt_nls statement .
293: 62 if_statement: LEX_IF '(' exp r_paren opt_nls statement . LEX_ELSE opt_nls statement
On Symbol: LEX_ELSE
Example LEX_IF '(' exp r_paren opt_nls LEX_IF '(' exp r_paren opt_nls statement • LEX_ELSE opt_nls statement
First derivation if_statement ::=[ LEX_IF '(' exp r_paren opt_nls statement ::=[ if_statement ::=[ LEX_IF '(' exp r_paren opt_nls statement • ] ] LEX_ELSE opt_nls statement ]
Example LEX_IF '(' exp r_paren opt_nls LEX_IF '(' exp r_paren opt_nls statement • LEX_ELSE opt_nls statement
Second derivation if_statement ::=[ LEX_IF '(' exp r_paren opt_nls statement ::=[ if_statement ::=[ LEX_IF '(' exp r_paren opt_nls statement • LEX_ELSE opt_nls statement ] ] ]
Shift-Reduce Conflict:
301: 127 rexp: rexp '?' rexp ':' rexp .
301: 154 variable: . NAME
On Symbol: NAME
Example rexp '?' rexp ':' rexp • NAME INCREMENT
First derivation rexp ::=[ rexp ::=[ rexp '?' rexp ':' rexp • ] simp_exp ::=[ variable ::=[ NAME ] INCREMENT ] ]
Example rexp '?' rexp ':' rexp • NAME INCREMENT
Second derivation rexp ::=[ rexp '?' rexp ':' rexp ::=[ rexp simp_exp ::=[ variable ::=[ • NAME ] INCREMENT ] ] ]
_build/g9d/tests/testsuite.dir/544/input.y: avertissement: 65 conflits par décalage/réduction [-Wconflicts-sr]