[bison.git] / src / print-xml.c

/* Print an xml on generated parser, for Bison,

   Copyright (C) 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
   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.

   Bison 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.  */

#include <config.h>
#include "system.h"

#include <stdarg.h>

#include <bitset.h>
#include <quotearg.h>

#include "LR0.h"
#include "closure.h"
#include "conflicts.h"
#include "files.h"
#include "getargs.h"
#include "gram.h"
#include "lalr.h"
#include "print.h"
#include "print-xml.h"
#include "reader.h"
#include "reduce.h"
#include "state.h"
#include "symtab.h"
#include "tables.h"

static bitset no_reduce_set;
struct escape_buf
{
  char *ptr;
  size_t size;
};
static struct escape_buf escape_bufs[2];


/*--------------------------------.
| Report information on a state.  |
`--------------------------------*/

static void
print_core (FILE *out, int level, state *s)
{
  size_t i;
  item_number *sitems = s->items;
  size_t snritems = s->nitems;

  /* Output all the items of a state, not only its kernel.  */
  if (report_flag & report_itemsets)
    {
      closure (sitems, snritems);
      sitems = itemset;
      snritems = nitemset;
    }

  if (!snritems) {
    xml_puts (out, level, "<itemset/>");
    return;
  }

  xml_puts (out, level, "<itemset>");

  for (i = 0; i < snritems; i++)
    {
      bool printed = false;
      item_number *sp;
      item_number *sp1;
      rule_number r;

      sp1 = sp = ritem + sitems[i];

      while (*sp >= 0)
	sp++;

      r = item_number_as_rule_number (*sp);
      sp = rules[r].rhs;

      /* Display the lookahead tokens?  */
      if (report_flag & report_lookahead_tokens
          && item_number_is_rule_number (*sp1))
	{
	  reductions *reds = s->reductions;
	  int red = state_reduction_find (s, &rules[r]);
	  /* Print item with lookaheads if there are. */
	  if (reds->lookahead_tokens && red != -1)
	    {
	      xml_printf (out, level + 1,
			  "<item rule-number=\"%d\" point=\"%d\">",
			  rules[r].number, sp1 - sp);
	      state_rule_lookahead_tokens_print_xml (s, &rules[r],
						     out, level + 2);
	      xml_puts (out, level + 1, "</item>");
	      printed = true;
	    }
	}

      if (!printed)
	{
	  xml_printf (out, level + 1,
		      "<item rule-number=\"%d\" point=\"%d\"/>",
		      rules[r].number,
		      sp1 - sp);
	}
    }
  xml_puts (out, level, "</itemset>");
}


/*-----------------------------------------------------------.
| Report the shifts if DISPLAY_SHIFTS_P or the gotos of S on |
| OUT.                                                       |
`-----------------------------------------------------------*/

static void
print_transitions (state *s, FILE *out, int level)
{
  transitions *trans = s->transitions;
  int n = 0;
  int i;

  for (i = 0; i < trans->num; i++)
    if (!TRANSITION_IS_DISABLED (trans, i))
      {
	n++;
      }

  /* Nothing to report. */
  if (!n) {
    xml_puts (out, level, "<transitions/>");
    return;
  }

  /* Report lookahead tokens and shifts.  */
  xml_puts (out, level, "<transitions>");

  for (i = 0; i < trans->num; i++)
    if (!TRANSITION_IS_DISABLED (trans, i)
	&& TRANSITION_IS_SHIFT (trans, i))
      {
	symbol *sym = symbols[TRANSITION_SYMBOL (trans, i)];
	char const *tag = sym->tag;
	state *s1 = trans->states[i];

	xml_printf (out, level + 1,
		    "<transition type=\"shift\" symbol=\"%s\" state=\"%d\"/>",
		    xml_escape (tag), s1->number);
      }

  for (i = 0; i < trans->num; i++)
    if (!TRANSITION_IS_DISABLED (trans, i)
	&& !TRANSITION_IS_SHIFT (trans, i))
      {
	symbol *sym = symbols[TRANSITION_SYMBOL (trans, i)];
	char const *tag = sym->tag;
	state *s1 = trans->states[i];

	xml_printf (out, level + 1,
		    "<transition type=\"goto\" symbol=\"%s\" state=\"%d\"/>",
		    xml_escape (tag), s1->number);
      }

  xml_puts (out, level, "</transitions>");
}


/*--------------------------------------------------------.
| Report the explicit errors of S raised from %nonassoc.  |
`--------------------------------------------------------*/

static void
print_errs (FILE *out, int level, state *s)
{
  errs *errp = s->errs;
  bool count = false;
  int i;

  for (i = 0; i < errp->num; ++i)
    if (errp->symbols[i])
      count = true;

  /* Nothing to report. */
  if (!count) {
    xml_puts (out, level, "<errors/>");
    return;
  }

  /* Report lookahead tokens and errors.  */
  xml_puts (out, level, "<errors>");
  for (i = 0; i < errp->num; ++i)
    if (errp->symbols[i])
      {
	char const *tag = errp->symbols[i]->tag;
	xml_printf (out, level + 1,
		    "<error symbol=\"%s\">nonassociative</error>",
		    xml_escape (tag));
      }
  xml_puts (out, level, "</errors>");
}


/*-------------------------------------------------------------------------.
| Report a reduction of RULE on LOOKAHEAD_TOKEN (which can be `default').  |
| If not ENABLED, the rule is masked by a shift or a reduce (S/R and       |
| R/R conflicts).                                                          |
`-------------------------------------------------------------------------*/

static void
print_reduction (FILE *out, int level, char const *lookahead_token,
		 rule *r, bool enabled)
{
  if (r->number)
    xml_printf (out, level,
		"<reduction symbol=\"%s\" rule=\"%d\" enabled=\"%s\"/>",
		xml_escape (lookahead_token),
		r->number,
		enabled ? "true" : "false");
  else
    xml_printf (out, level,
		"<reduction symbol=\"%s\" rule=\"accept\" enabled=\"%s\"/>",
		xml_escape (lookahead_token),
		enabled ? "true" : "false");
}


/*-------------------------------------------.
| Report on OUT the reduction actions of S.  |
`-------------------------------------------*/

static void
print_reductions (FILE *out, int level, state *s)
{
  transitions *trans = s->transitions;
  reductions *reds = s->reductions;
  rule *default_rule = NULL;
  int report = false;
  int i, j;

  if (reds->num == 0) {
    xml_puts (out, level, "<reductions/>");
    return;
  }

  if (yydefact[s->number] != 0)
    default_rule = &rules[yydefact[s->number] - 1];

  bitset_zero (no_reduce_set);
  FOR_EACH_SHIFT (trans, i)
    bitset_set (no_reduce_set, TRANSITION_SYMBOL (trans, i));
  for (i = 0; i < s->errs->num; ++i)
    if (s->errs->symbols[i])
      bitset_set (no_reduce_set, s->errs->symbols[i]->number);

  if (default_rule)
    report = true;

  if (reds->lookahead_tokens)
    for (i = 0; i < ntokens; i++)
      {
	bool count = bitset_test (no_reduce_set, i);

	for (j = 0; j < reds->num; ++j)
	  if (bitset_test (reds->lookahead_tokens[j], i))
	    {
	      if (! count)
		{
		  if (reds->rules[j] != default_rule)
		    report = true;
		  count = true;
		}
	      else
		{
		  report = true;
		}
	    }
      }

  /* Nothing to report. */
  if (!report) {
    xml_puts (out, level, "<reductions/>");
    return;
  }

  xml_puts (out, level, "<reductions>");

  /* Report lookahead tokens (or $default) and reductions.  */
  if (reds->lookahead_tokens)
    for (i = 0; i < ntokens; i++)
      {
	bool defaulted = false;
	bool count = bitset_test (no_reduce_set, i);

	for (j = 0; j < reds->num; ++j)
	  if (bitset_test (reds->lookahead_tokens[j], i))
	    {
	      if (! count)
		{
		  if (reds->rules[j] != default_rule)
		    print_reduction (out, level + 1, symbols[i]->tag,
				     reds->rules[j], true);
		  else
		    defaulted = true;
		  count = true;
		}
	      else
		{
		  if (defaulted)
		    print_reduction (out, level + 1, symbols[i]->tag,
				     default_rule, true);
		  defaulted = false;
		  print_reduction (out, level + 1, symbols[i]->tag,
				   reds->rules[j], false);
		}
	    }
      }

  if (default_rule)
    print_reduction (out, level + 1,
		     "$default", default_rule, true);

  xml_puts (out, level, "</reductions>");
}


/*--------------------------------------------------------------.
| Report on OUT all the actions (shifts, gotos, reductions, and |
| explicit erros from %nonassoc) of S.                          |
`--------------------------------------------------------------*/

static void
print_actions (FILE *out, int level, state *s)
{
  xml_puts (out, level, "<actions>");
  print_transitions (s, out, level + 1);
  print_errs (out, level + 1, s);
  print_reductions (out, level + 1, s);
  xml_puts (out, level, "</actions>");
}


/*----------------------------------.
| Report all the data on S on OUT.  |
`----------------------------------*/

static void
print_state (FILE *out, int level, state *s)
{
  fputc ('\n', out);
  xml_printf (out, level, "<state number=\"%d\">", s->number);
  print_core (out, level + 1, s);
  print_actions (out, level + 1, s);
  if ((report_flag & report_solved_conflicts) && s->solved_conflicts_xml)
    {
      xml_puts (out, level + 1, "<solved-conflicts>");
      fputs (s->solved_conflicts_xml, out);
      xml_puts (out, level + 1, "</solved-conflicts>");
    }
  else
    xml_puts (out, level + 1, "<solved-conflicts/>");
  xml_puts (out, level, "</state>");
}


/*-----------------------------------------.
| Print information on the whole grammar.  |
`-----------------------------------------*/

static void
print_grammar (FILE *out, int level)
{
  symbol_number i;

  fputc ('\n', out);
  xml_puts (out, level, "<grammar>");
  grammar_rules_print_xml (out, level);

  /* Terminals */
  xml_puts (out, level + 1, "<terminals>");
  for (i = 0; i < max_user_token_number + 1; i++)
    if (token_translations[i] != undeftoken->number)
      {
	char const *tag = symbols[token_translations[i]]->tag;
	rule_number r;
	item_number *rhsp;

	xml_printf (out, level + 2,
		    "<terminal symbol-number=\"%d\" token-number=\"%d\""
                    " name=\"%s\" usefulness=\"%s\">",
		    token_translations[i], i, xml_escape (tag),
                    reduce_token_unused_in_grammar (token_translations[i])
                      ? "unused-in-grammar" : "useful");

	for (r = 0; r < nrules; r++)
	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
	    if (item_number_as_symbol_number (*rhsp) == token_translations[i])
	      {
		xml_printf (out, level + 3, "<rule>%d</rule>", r);
		break;
	      }
	xml_puts (out, level + 2, "</terminal>");
      }
  xml_puts (out, level + 1, "</terminals>");

  /* Nonterminals */
  xml_puts (out, level + 1, "<nonterminals>");
  for (i = ntokens; i < nsyms + nuseless_nonterminals; i++)
    {
      int left_count = 0, right_count = 0;
      rule_number r;
      char const *tag = symbols[i]->tag;

      for (r = 0; r < nrules; r++)
	{
	  item_number *rhsp;
	  if (rules[r].lhs->number == i)
	    left_count++;
	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
	    if (item_number_as_symbol_number (*rhsp) == i)
	      {
		right_count++;
		break;
	      }
	}

      xml_printf (out, level + 2,
		  "<nonterminal symbol-number=\"%d\" name=\"%s\""
                  " usefulness=\"%s\">",
		  i, xml_escape (tag),
                  reduce_nonterminal_useless_in_grammar (i)
                    ? "useless-in-grammar" : "useful");

      if (left_count > 0)
	{
	  xml_puts (out, level + 3, "<left>");
	  for (r = 0; r < nrules; r++)
	    {
	      if (rules[r].lhs->number == i)
		xml_printf (out, level + 4, "<rule>%d</rule>", r);
	    }
	  xml_puts (out, level + 3, "</left>");
	}

      if (right_count > 0)
	{
	  xml_puts (out, level + 3, "<right>");
	  for (r = 0; r < nrules; r++)
	    {
	      item_number *rhsp;
	      for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
		if (item_number_as_symbol_number (*rhsp) == i)
		  {
		    xml_printf (out, level + 4, "<rule>%d</rule>", r);
		    break;
		  }
	    }
	  xml_puts (out, level + 3, "</right>");
	}

      xml_puts (out, level + 2, "</nonterminal>");
    }
  xml_puts (out, level + 1, "</nonterminals>");
  xml_puts (out, level, "</grammar>");
}

void
xml_puts (FILE *out, int level, char const *s)
{
  int i;
  for (i = 0; i < level; i++)
    fputs ("  ", out);
  fputs (s, out);
  fputc ('\n', out);
}

void
xml_printf (FILE *out, int level, char const *fmt, ...)
{
  int i;
  va_list arglist;

  for (i = 0; i < level; i++)
    fputs ("  ", out);

  va_start (arglist, fmt);
  vfprintf (out, fmt, arglist);
  va_end (arglist);

  fputc ('\n', out);
}

static char const *
xml_escape_string (struct escape_buf *buf, char const *str)
{
  size_t len = strlen (str);
  size_t max_expansion = sizeof "&quot;" - 1;
  char *p;

  if (buf->size <= max_expansion * len)
    {
      buf->size = max_expansion * len + 1;
      buf->ptr = x2realloc (buf->ptr, &buf->size);
    }
  p = buf->ptr;

  for (; *str; str++)
    switch (*str)
      {
      default: *p++ = *str; break;
      case '&': p = stpcpy (p, "&amp;" ); break;
      case '<': p = stpcpy (p, "&lt;"  ); break;
      case '>': p = stpcpy (p, "&gt;"  ); break;
      case '"': p = stpcpy (p, "&quot;"); break;
      }

  *p = '\0';
  return buf->ptr;
}

char const *
xml_escape_n (int n, char const *str)
{
  return xml_escape_string (escape_bufs + n, str);
}

char const *
xml_escape (char const *str)
{
  return xml_escape_n (0, str);
}

void
print_xml (void)
{
  state_number i;
  int level = 0;

  FILE *out = xfopen (spec_xml_file, "w");

  fputs ("<?xml version=\"1.0\"?>\n\n", out);
  xml_printf (out, level, "<bison-xml-report version=\"%s\">",
	      xml_escape (VERSION));

  fputc ('\n', out);
  xml_printf (out, level + 1, "<filename>%s</filename>",
	      xml_escape (grammar_file));

  /* print grammar */
  print_grammar (out, level + 1);

  if (report_flag & report_itemsets)
    new_closure (nritems);
  no_reduce_set =  bitset_create (ntokens, BITSET_FIXED);

  /* print automaton */
  fputc ('\n', out);
  xml_puts (out, level + 1, "<automaton>");
  for (i = 0; i < nstates; i++)
    print_state (out, level + 2, states[i]);
  xml_puts (out, level + 1, "</automaton>");

  bitset_free (no_reduce_set);
  if (report_flag & report_itemsets)
    free_closure ();

  xml_puts (out, 0, "</bison-xml-report>");

  free (escape_bufs[0].ptr);
  free (escape_bufs[1].ptr);

  xfclose (out);
}
Commit	Line	Data
41d7a5f2 PE	1	/* Print an xml on generated parser, for Bison,
	2
	3	Copyright (C) 2007 Free Software Foundation, Inc.
	4
	5	This file is part of Bison, the GNU Compiler Compiler.
	6
	7	Bison is free software; you can redistribute it and/or modify
	8	it under the terms of the GNU General Public License as published by
	9	the Free Software Foundation; either version 2, or (at your option)
	10	any later version.
	11
	12	Bison is distributed in the hope that it will be useful,
	13	but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	GNU General Public License for more details.
	16
	17	You should have received a copy of the GNU General Public License
	18	along with Bison; see the file COPYING. If not, write to
	19	the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
	20	Boston, MA 02110-1301, USA. */
	21
	22	#include <config.h>
	23	#include "system.h"
	24
	25	#include <stdarg.h>
	26
	27	#include <bitset.h>
	28	#include <quotearg.h>
	29
	30	#include "LR0.h"
	31	#include "closure.h"
	32	#include "conflicts.h"
	33	#include "files.h"
	34	#include "getargs.h"
	35	#include "gram.h"
	36	#include "lalr.h"
	37	#include "print.h"
	38	#include "print-xml.h"
	39	#include "reader.h"
	40	#include "reduce.h"
	41	#include "state.h"
	42	#include "symtab.h"
	43	#include "tables.h"
	44
	45	static bitset no_reduce_set;
34cdeddf JD	46	struct escape_buf
	47	{
	48	char *ptr;
	49	size_t size;
	50	};
	51	static struct escape_buf escape_bufs[2];
41d7a5f2 PE	52
41d7a5f2 PE	53
41d7a5f2 PE	54	/*--------------------------------.
	55	\| Report information on a state. \|
	56	`--------------------------------*/
	57
	58	static void
	59	print_core (FILE out, int level, state s)
	60	{
	61	size_t i;
	62	item_number *sitems = s->items;
	63	size_t snritems = s->nitems;
	64
	65	/* Output all the items of a state, not only its kernel. */
	66	if (report_flag & report_itemsets)
	67	{
	68	closure (sitems, snritems);
	69	sitems = itemset;
	70	snritems = nitemset;
	71	}
	72
	73	if (!snritems) {
	74	xml_puts (out, level, "<itemset/>");
	75	return;
	76	}
	77
	78	xml_puts (out, level, "<itemset>");
	79
	80	for (i = 0; i < snritems; i++)
	81	{
25f6da67	82	bool printed = false;
41d7a5f2 PE	83	item_number *sp;
	84	item_number *sp1;
	85	rule_number r;
	86
	87	sp1 = sp = ritem + sitems[i];
	88
	89	while (*sp >= 0)
	90	sp++;
	91
	92	r = item_number_as_rule_number (*sp);
25f6da67	93	sp = rules[r].rhs;
41d7a5f2 PE	94
41d7a5f2 PE	95	/* Display the lookahead tokens? */
a0de5091 JD	96	if (report_flag & report_lookahead_tokens
a0de5091 JD	97	&& item_number_is_rule_number (*sp1))
25f6da67 WP	98	{
	99	reductions *reds = s->reductions;
	100	int red = state_reduction_find (s, &rules[r]);
	101	/* Print item with lookaheads if there are. */
	102	if (reds->lookahead_tokens && red != -1)
	103	{
	104	xml_printf (out, level + 1,
	105	"<item rule-number=\"%d\" point=\"%d\">",
	106	rules[r].number, sp1 - sp);
	107	state_rule_lookahead_tokens_print_xml (s, &rules[r],
	108	out, level + 2);
	109	xml_puts (out, level + 1, "</item>");
	110	printed = true;
	111	}
	112	}
41d7a5f2	113
25f6da67 WP	114	if (!printed)
	115	{
	116	xml_printf (out, level + 1,
	117	"<item rule-number=\"%d\" point=\"%d\"/>",
	118	rules[r].number,
	119	sp1 - sp);
	120	}
41d7a5f2 PE	121	}
	122	xml_puts (out, level, "</itemset>");
	123	}
	124
	125
	126	/*-----------------------------------------------------------.
	127	\| Report the shifts if DISPLAY_SHIFTS_P or the gotos of S on \|
	128	\| OUT. \|
	129	`-----------------------------------------------------------*/
	130
	131	static void
	132	print_transitions (state s, FILE out, int level)
	133	{
	134	transitions *trans = s->transitions;
	135	int n = 0;
	136	int i;
	137
	138	for (i = 0; i < trans->num; i++)
	139	if (!TRANSITION_IS_DISABLED (trans, i))
	140	{
	141	n++;
	142	}
	143
	144	/* Nothing to report. */
	145	if (!n) {
	146	xml_puts (out, level, "<transitions/>");
	147	return;
	148	}
	149
	150	/* Report lookahead tokens and shifts. */
	151	xml_puts (out, level, "<transitions>");
	152
	153	for (i = 0; i < trans->num; i++)
	154	if (!TRANSITION_IS_DISABLED (trans, i)
	155	&& TRANSITION_IS_SHIFT (trans, i))
	156	{
	157	symbol *sym = symbols[TRANSITION_SYMBOL (trans, i)];
	158	char const *tag = sym->tag;
	159	state *s1 = trans->states[i];
	160
	161	xml_printf (out, level + 1,
	162	"<transition type=\"shift\" symbol=\"%s\" state=\"%d\"/>",
	163	xml_escape (tag), s1->number);
	164	}
	165
	166	for (i = 0; i < trans->num; i++)
	167	if (!TRANSITION_IS_DISABLED (trans, i)
	168	&& !TRANSITION_IS_SHIFT (trans, i))
	169	{
	170	symbol *sym = symbols[TRANSITION_SYMBOL (trans, i)];
	171	char const *tag = sym->tag;
	172	state *s1 = trans->states[i];
	173
	174	xml_printf (out, level + 1,
	175	"<transition type=\"goto\" symbol=\"%s\" state=\"%d\"/>",
	176	xml_escape (tag), s1->number);
	177	}
	178
	179	xml_puts (out, level, "</transitions>");
	180	}
	181
	182
	183	/*--------------------------------------------------------.
	184	\| Report the explicit errors of S raised from %nonassoc. \|
185	`--------------------------------------------------------*/
186
187	static void
188	print_errs (FILE out, int level, state s)
189	{
190	errs *errp = s->errs;
191	bool count = false;
192	int i;
193
194	for (i = 0; i < errp->num; ++i)
195	if (errp->symbols[i])
196	count = true;
197
198	/* Nothing to report. */
199	if (!count) {
200	xml_puts (out, level, "<errors/>");
201	return;
202	}
203
204	/* Report lookahead tokens and errors. */
205	xml_puts (out, level, "<errors>");
206	for (i = 0; i < errp->num; ++i)
207	if (errp->symbols[i])
208	{
209	char const *tag = errp->symbols[i]->tag;
210	xml_printf (out, level + 1,
211	"<error symbol=\"%s\">nonassociative</error>",
212	xml_escape (tag));
213	}
214	xml_puts (out, level, "</errors>");
215	}
216
217
218	/*-------------------------------------------------------------------------.
219	\| Report a reduction of RULE on LOOKAHEAD_TOKEN (which can be `default'). \|
220	\| If not ENABLED, the rule is masked by a shift or a reduce (S/R and \|
221	\| R/R conflicts). \|
222	`-------------------------------------------------------------------------*/
223
224	static void
225	print_reduction (FILE out, int level, char const lookahead_token,
226	rule *r, bool enabled)
227	{
228	if (r->number)
229	xml_printf (out, level,
230	"<reduction symbol=\"%s\" rule=\"%d\" enabled=\"%s\"/>",
231	xml_escape (lookahead_token),
232	r->number,
233	enabled ? "true" : "false");
234	else
235	xml_printf (out, level,
236	"<reduction symbol=\"%s\" rule=\"accept\" enabled=\"%s\"/>",
237	xml_escape (lookahead_token),
238	enabled ? "true" : "false");
239	}
240
241
242	/*-------------------------------------------.
243	\| Report on OUT the reduction actions of S. \|
244	`-------------------------------------------*/
245
246	static void
247	print_reductions (FILE out, int level, state s)
248	{
249	transitions *trans = s->transitions;
250	reductions *reds = s->reductions;
251	rule *default_rule = NULL;
252	int report = false;
253	int i, j;
254
255	if (reds->num == 0) {
256	xml_puts (out, level, "<reductions/>");
257	return;
258	}
259
260	if (yydefact[s->number] != 0)
261	default_rule = &rules[yydefact[s->number] - 1];
262
263	bitset_zero (no_reduce_set);
264	FOR_EACH_SHIFT (trans, i)
265	bitset_set (no_reduce_set, TRANSITION_SYMBOL (trans, i));
266	for (i = 0; i < s->errs->num; ++i)
267	if (s->errs->symbols[i])
268	bitset_set (no_reduce_set, s->errs->symbols[i]->number);
269
270	if (default_rule)
271	report = true;
272
273	if (reds->lookahead_tokens)
274	for (i = 0; i < ntokens; i++)
275	{
276	bool count = bitset_test (no_reduce_set, i);
277
278	for (j = 0; j < reds->num; ++j)
279	if (bitset_test (reds->lookahead_tokens[j], i))
280	{
281	if (! count)
282	{
283	if (reds->rules[j] != default_rule)
284	report = true;
285	count = true;
286	}
287	else
288	{
289	report = true;
290	}
291	}
292	}
293
294	/* Nothing to report. */
295	if (!report) {
296	xml_puts (out, level, "<reductions/>");
297	return;
298	}
299
300	xml_puts (out, level, "<reductions>");
301
302	/* Report lookahead tokens (or $default) and reductions. */
303	if (reds->lookahead_tokens)
304	for (i = 0; i < ntokens; i++)
305	{
306	bool defaulted = false;
307	bool count = bitset_test (no_reduce_set, i);
308
309	for (j = 0; j < reds->num; ++j)
310	if (bitset_test (reds->lookahead_tokens[j], i))
311	{
312	if (! count)
313	{
314	if (reds->rules[j] != default_rule)
315	print_reduction (out, level + 1, symbols[i]->tag,
316	reds->rules[j], true);
317	else
318	defaulted = true;
319	count = true;
320	}
321	else
322	{
323	if (defaulted)
324	print_reduction (out, level + 1, symbols[i]->tag,
325	default_rule, true);
326	defaulted = false;
327	print_reduction (out, level + 1, symbols[i]->tag,
328	reds->rules[j], false);
329	}
330	}
331	}
332
333	if (default_rule)
334	print_reduction (out, level + 1,
335	"$default", default_rule, true);
336
337	xml_puts (out, level, "</reductions>");
338	}
339
340
341	/*--------------------------------------------------------------.
342	\| Report on OUT all the actions (shifts, gotos, reductions, and \|
343	\| explicit erros from %nonassoc) of S. \|
344	`--------------------------------------------------------------*/
345
346	static void
347	print_actions (FILE out, int level, state s)
348	{
349	xml_puts (out, level, "<actions>");
350	print_transitions (s, out, level + 1);
351	print_errs (out, level + 1, s);
352	print_reductions (out, level + 1, s);
353	xml_puts (out, level, "</actions>");
354	}
355
356
357	/*----------------------------------.
358	\| Report all the data on S on OUT. \|
359	`----------------------------------*/
360
361	static void
362	print_state (FILE out, int level, state s)
363	{
364	fputc ('\n', out);
365	xml_printf (out, level, "<state number=\"%d\">", s->number);
366	print_core (out, level + 1, s);
367	print_actions (out, level + 1, s);
368	if ((report_flag & report_solved_conflicts) && s->solved_conflicts_xml)
369	{
370	xml_puts (out, level + 1, "<solved-conflicts>");
371	fputs (s->solved_conflicts_xml, out);
372	xml_puts (out, level + 1, "</solved-conflicts>");
373	}
374	else
375	xml_puts (out, level + 1, "<solved-conflicts/>");
376	xml_puts (out, level, "</state>");
377	}
378
379
380	/*-----------------------------------------.
381	\| Print information on the whole grammar. \|
382	`-----------------------------------------*/
383
384	static void
385	print_grammar (FILE *out, int level)
386	{
387	symbol_number i;
388
389	fputc ('\n', out);
390	xml_puts (out, level, "<grammar>");
391	grammar_rules_print_xml (out, level);
392
393	/* Terminals */
394	xml_puts (out, level + 1, "<terminals>");
395	for (i = 0; i < max_user_token_number + 1; i++)
396	if (token_translations[i] != undeftoken->number)
397	{
398	char const *tag = symbols[token_translations[i]]->tag;
399	rule_number r;
400	item_number *rhsp;
401
402	xml_printf (out, level + 2,
32f19b6b	403	"<terminal symbol-number=\"%d\" token-number=\"%d\""
d80fb37a JD	404	" name=\"%s\" usefulness=\"%s\">",
	405	token_translations[i], i, xml_escape (tag),
	406	reduce_token_unused_in_grammar (token_translations[i])
	407	? "unused-in-grammar" : "useful");
41d7a5f2 PE	408
	409	for (r = 0; r < nrules; r++)
	410	for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
	411	if (item_number_as_symbol_number (*rhsp) == token_translations[i])
	412	{
	413	xml_printf (out, level + 3, "<rule>%d</rule>", r);
	414	break;
	415	}
	416	xml_puts (out, level + 2, "</terminal>");
	417	}
	418	xml_puts (out, level + 1, "</terminals>");
	419
	420	/* Nonterminals */
	421	xml_puts (out, level + 1, "<nonterminals>");
d80fb37a	422	for (i = ntokens; i < nsyms + nuseless_nonterminals; i++)
41d7a5f2 PE	423	{
	424	int left_count = 0, right_count = 0;
	425	rule_number r;
	426	char const *tag = symbols[i]->tag;
	427
	428	for (r = 0; r < nrules; r++)
	429	{
	430	item_number *rhsp;
	431	if (rules[r].lhs->number == i)
	432	left_count++;
	433	for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
	434	if (item_number_as_symbol_number (*rhsp) == i)
	435	{
	436	right_count++;
	437	break;
	438	}
	439	}
	440
	441	xml_printf (out, level + 2,
d80fb37a JD	442	"<nonterminal symbol-number=\"%d\" name=\"%s\""
	443	" usefulness=\"%s\">",
	444	i, xml_escape (tag),
	445	reduce_nonterminal_useless_in_grammar (i)
	446	? "useless-in-grammar" : "useful");
41d7a5f2 PE	447
	448	if (left_count > 0)
	449	{
	450	xml_puts (out, level + 3, "<left>");
	451	for (r = 0; r < nrules; r++)
	452	{
	453	if (rules[r].lhs->number == i)
	454	xml_printf (out, level + 4, "<rule>%d</rule>", r);
	455	}
	456	xml_puts (out, level + 3, "</left>");
	457	}
	458
	459	if (right_count > 0)
	460	{
	461	xml_puts (out, level + 3, "<right>");
	462	for (r = 0; r < nrules; r++)
	463	{
	464	item_number *rhsp;
	465	for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
	466	if (item_number_as_symbol_number (*rhsp) == i)
	467	{
	468	xml_printf (out, level + 4, "<rule>%d</rule>", r);
	469	break;
	470	}
	471	}
	472	xml_puts (out, level + 3, "</right>");
	473	}
	474
	475	xml_puts (out, level + 2, "</nonterminal>");
	476	}
	477	xml_puts (out, level + 1, "</nonterminals>");
	478	xml_puts (out, level, "</grammar>");
	479	}
	480
	481	void
ad5feac4	482	xml_puts (FILE out, int level, char const s)
41d7a5f2 PE	483	{
41d7a5f2 PE	484	int i;
41d7a5f2	485	for (i = 0; i < level; i++)
a4f75309	486	fputs (" ", out);
41d7a5f2 PE	487	fputs (s, out);
	488	fputc ('\n', out);
	489	}
	490
	491	void
	492	xml_printf (FILE out, int level, char const fmt, ...)
	493	{
	494	int i;
	495	va_list arglist;
	496
	497	for (i = 0; i < level; i++)
a4f75309	498	fputs (" ", out);
41d7a5f2 PE	499
	500	va_start (arglist, fmt);
	501	vfprintf (out, fmt, arglist);
	502	va_end (arglist);
	503
	504	fputc ('\n', out);
	505	}
	506
41d7a5f2 PE	507	static char const *
	508	xml_escape_string (struct escape_buf buf, char const str)
	509	{
	510	size_t len = strlen (str);
	511	size_t max_expansion = sizeof """ - 1;
	512	char *p;
	513
	514	if (buf->size <= max_expansion * len)
	515	{
	516	buf->size = max_expansion * len + 1;
	517	buf->ptr = x2realloc (buf->ptr, &buf->size);
	518	}
	519	p = buf->ptr;
	520
	521	for (; *str; str++)
	522	switch (*str)
	523	{
	524	default: p++ = str; break;
	525	case '&': p = stpcpy (p, "&" ); break;
	526	case '<': p = stpcpy (p, "<" ); break;
	527	case '>': p = stpcpy (p, ">" ); break;
	528	case '"': p = stpcpy (p, """); break;
	529	}
	530
	531	*p = '\0';
	532	return buf->ptr;
	533	}
	534
	535	char const *
	536	xml_escape_n (int n, char const *str)
	537	{
34cdeddf	538	return xml_escape_string (escape_bufs + n, str);
41d7a5f2 PE	539	}
	540
	541	char const *
	542	xml_escape (char const *str)
	543	{
	544	return xml_escape_n (0, str);
	545	}
	546
	547	void
	548	print_xml (void)
	549	{
	550	state_number i;
	551	int level = 0;
	552
	553	FILE *out = xfopen (spec_xml_file, "w");
	554
	555	fputs ("<?xml version=\"1.0\"?>\n\n", out);
	556	xml_printf (out, level, "<bison-xml-report version=\"%s\">",
	557	xml_escape (VERSION));
	558
	559	fputc ('\n', out);
	560	xml_printf (out, level + 1, "<filename>%s</filename>",
	561	xml_escape (grammar_file));
	562
41d7a5f2 PE	563	/* print grammar */
	564	print_grammar (out, level + 1);
	565
	566	if (report_flag & report_itemsets)
	567	new_closure (nritems);
	568	no_reduce_set = bitset_create (ntokens, BITSET_FIXED);
	569
	570	/* print automaton */
	571	fputc ('\n', out);
	572	xml_puts (out, level + 1, "<automaton>");
	573	for (i = 0; i < nstates; i++)
	574	print_state (out, level + 2, states[i]);
	575	xml_puts (out, level + 1, "</automaton>");
	576
	577	bitset_free (no_reduce_set);
	578	if (report_flag & report_itemsets)
	579	free_closure ();
	580
	581	xml_puts (out, 0, "</bison-xml-report>");
	582
34cdeddf JD	583	free (escape_bufs[0].ptr);
	584	free (escape_bufs[1].ptr);
	585
41d7a5f2 PE	586	xfclose (out);
41d7a5f2 PE	587	}