/* Grammar reduction for Bison.
- Copyright (C) 1988, 1989, 2000, 2001, 2002, 2003, 2005 Free
- Software Foundation, Inc.
+ Copyright (C) 1988, 1989, 2000, 2001, 2002, 2003, 2005, 2006,
+ 2007 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
- Bison is free software; you can redistribute it and/or modify
+ This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2, or (at your option)
- any later version.
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
- Bison is distributed in the hope that it will be useful,
+ This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
- along with Bison; see the file COPYING. If not, write to
- the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- Boston, MA 02110-1301, USA. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* Reduce the grammar: Find and eliminate unreachable terminals,
#include "files.h"
#include "getargs.h"
#include "gram.h"
+#include "print-xml.h"
#include "reader.h"
#include "reduce.h"
#include "symtab.h"
}
\f
+/*--------------------------------------------------------------.
+| Output the detailed results of the reductions. For FILE.xml. |
+`---------------------------------------------------------------*/
+void
+reduce_xml (FILE *out, int level)
+{
+ fputc ('\n', out);
+ xml_puts (out, level, "<reductions>");
+ xml_puts (out, level + 1, "<useless>");
+ if (nuseless_nonterminals > 0)
+ {
+ int i;
+ xml_puts (out, level + 2, "<nonterminals>");
+ for (i = 0; i < nuseless_nonterminals; ++i)
+ xml_printf (out, level + 3,
+ "<nonterminal>%s</nonterminal>",
+ symbols[nsyms + i]->tag);
+ xml_puts (out, level + 2, "</nonterminals>");
+ }
+ else
+ xml_puts (out, level + 2, "<nonterminals/>");
+
+ if (nuseless_productions > 0)
+ grammar_rules_partial_print_xml (out, level + 1, true, rule_useless_p);
+ else
+ xml_puts (out, level + 2, "<rules/>");
+
+ xml_puts (out, level + 1, "</useless>");
+ xml_puts (out, level + 1, "<unused>");
+
+ {
+ bool b = false;
+ int i;
+ for (i = 0; i < ntokens; i++)
+ if (!bitset_test (V, i) && !bitset_test (V1, i))
+ {
+ if (!b)
+ xml_puts (out, level + 2, "<terminals>");
+ b = true;
+ xml_printf (out, level + 3,
+ "<terminal>%s</terminal>",
+ xml_escape (symbols[i]->tag));
+ }
+ if (b)
+ xml_puts (out, level + 2, "</terminals>");
+ else
+ xml_puts (out, level + 2, "<terminals/>");
+ }
+
+ xml_puts (out, level + 1, "</unused>");
+ xml_puts (out, level, "</reductions>");
+ fputc ('\n', out);
+}
+\f
/*-------------------------------.
| Report the results to STDERR. |