/* Find and resolve or report lookahead conflicts for bison,
Copyright (C) 1984, 1989, 1992, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
- 2007 Free Software Foundation, Inc.
+ 2007, 2008 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
}
obstack_sgrow (&solved_conflicts_obstack, ".\n");
+ }
- /* XML report */
- if (xml_flag)
- {
- /* The description of the resolution. */
- switch (resolution)
- {
- case shift_resolution:
- case right_resolution:
- obstack_fgrow2 (&solved_conflicts_xml_obstack,
- " <resolution rule=\"%d\" symbol=\"%s\""
- " type=\"shift\">",
- r->number,
- xml_escape (symbols[token]->tag));
- break;
-
- case reduce_resolution:
- case left_resolution:
- obstack_fgrow2 (&solved_conflicts_xml_obstack,
- " <resolution rule=\"%d\" symbol=\"%s\""
- " type=\"reduce\">",
- r->number,
- xml_escape (symbols[token]->tag));
- break;
-
- case nonassoc_resolution:
- obstack_fgrow2 (&solved_conflicts_xml_obstack,
- " <resolution rule=\"%d\" symbol=\"%s\""
- " type=\"error\">",
- r->number,
- xml_escape (symbols[token]->tag));
- break;
- }
-
- /* The reason. */
- switch (resolution)
- {
- case shift_resolution:
- obstack_fgrow2 (&solved_conflicts_xml_obstack,
- "%s < %s",
- xml_escape_n (0, r->prec->tag),
- xml_escape_n (1, symbols[token]->tag));
- break;
-
- case reduce_resolution:
- obstack_fgrow2 (&solved_conflicts_xml_obstack,
- "%s < %s",
- xml_escape_n (0, symbols[token]->tag),
- xml_escape_n (1, r->prec->tag));
- break;
-
- case left_resolution:
- obstack_fgrow1 (&solved_conflicts_xml_obstack,
- "%%left %s",
- xml_escape (symbols[token]->tag));
- break;
-
- case right_resolution:
- obstack_fgrow1 (&solved_conflicts_xml_obstack,
- "%%right %s",
- xml_escape (symbols[token]->tag));
- break;
-
- case nonassoc_resolution:
- obstack_fgrow1 (&solved_conflicts_xml_obstack,
- "%%nonassoc %s",
- xml_escape (symbols[token]->tag));
- break;
- }
+ /* XML report */
+ if (xml_flag)
+ {
+ /* The description of the resolution. */
+ switch (resolution)
+ {
+ case shift_resolution:
+ case right_resolution:
+ obstack_fgrow2 (&solved_conflicts_xml_obstack,
+ " <resolution rule=\"%d\" symbol=\"%s\""
+ " type=\"shift\">",
+ r->number,
+ xml_escape (symbols[token]->tag));
+ break;
+
+ case reduce_resolution:
+ case left_resolution:
+ obstack_fgrow2 (&solved_conflicts_xml_obstack,
+ " <resolution rule=\"%d\" symbol=\"%s\""
+ " type=\"reduce\">",
+ r->number,
+ xml_escape (symbols[token]->tag));
+ break;
+
+ case nonassoc_resolution:
+ obstack_fgrow2 (&solved_conflicts_xml_obstack,
+ " <resolution rule=\"%d\" symbol=\"%s\""
+ " type=\"error\">",
+ r->number,
+ xml_escape (symbols[token]->tag));
+ break;
+ }
- obstack_sgrow (&solved_conflicts_xml_obstack, "</resolution>\n");
- }
+ /* The reason. */
+ switch (resolution)
+ {
+ case shift_resolution:
+ obstack_fgrow2 (&solved_conflicts_xml_obstack,
+ "%s < %s",
+ xml_escape_n (0, r->prec->tag),
+ xml_escape_n (1, symbols[token]->tag));
+ break;
+
+ case reduce_resolution:
+ obstack_fgrow2 (&solved_conflicts_xml_obstack,
+ "%s < %s",
+ xml_escape_n (0, symbols[token]->tag),
+ xml_escape_n (1, r->prec->tag));
+ break;
+
+ case left_resolution:
+ obstack_fgrow1 (&solved_conflicts_xml_obstack,
+ "%%left %s",
+ xml_escape (symbols[token]->tag));
+ break;
+
+ case right_resolution:
+ obstack_fgrow1 (&solved_conflicts_xml_obstack,
+ "%%right %s",
+ xml_escape (symbols[token]->tag));
+ break;
+
+ case nonassoc_resolution:
+ obstack_fgrow1 (&solved_conflicts_xml_obstack,
+ "%%nonassoc %s",
+ xml_escape (symbols[token]->tag));
+ break;
+ }
+
+ obstack_sgrow (&solved_conflicts_xml_obstack, "</resolution>\n");
}
}
flush_reduce (lookahead_tokens, i);
}
else
- /* Matching precedence levels.
- For left association, keep only the reduction.
- For right association, keep only the shift.
- For nonassociation, keep neither. */
+ /* Matching precedence levels.
+ For non-defined associativity, keep both: unexpected
+ associativity conflict.
+ For left associativity, keep only the reduction.
+ For right associativity, keep only the shift.
+ For nonassociativity, keep neither. */
switch (symbols[i]->assoc)
{
- default:
+ case undef_assoc:
abort ();
+ case precedence_assoc:
+ break;
+
case right_assoc:
log_resolution (redrule, i, right_resolution);
flush_reduce (lookahead_tokens, i);
fputs ("\n\n", out);
}
-void
-conflicts_output_xml (FILE *out, int level)
-{
- bool printed_sth = false;
- state_number i;
- int src_num;
- int rrc_num;
-
- for (i = 0; i < nstates; i++)
- {
- state *s = states[i];
- if (conflicts[i])
- {
- if (!printed_sth) {
- fputc ('\n', out);
- xml_puts (out, level, "<conflicts>");
- }
-
- src_num = count_sr_conflicts (s);
- rrc_num = count_rr_conflicts (s, true);
-
- if (src_num)
- xml_printf (out, level + 1,
- "<conflict state=\"%d\" num=\"%d\""
- " type=\"shift/reduce\"/>",
- i, src_num);
- if (rrc_num)
- xml_printf (out, level + 1,
- "<conflict state=\"%d\" num=\"%d\""
- " type=\"reduce/reduce\"/>",
- i, rrc_num);
-
- printed_sth = true;
- }
- }
- if (printed_sth)
- xml_puts (out, level, "</conflicts>");
- else
- xml_puts (out, level, "<conflicts/>");
-}
-
/*--------------------------------------------------------.
| Total the number of S/R and R/R conflicts. Unlike the |
| code in conflicts_output, however, count EACH pair of |