X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/d2729d44ab05f89e96d199ad6b10e127c1cb0a38..ce4ccb4b11bb3d19681055cc2b732493603d3508:/src/print.c

diff --git a/src/print.c b/src/print.c
index 3ea8b425..76e5f740 100644
--- a/src/print.c
+++ b/src/print.c
@@ -1,329 +1,413 @@
 /* Print information on generated parser, for bison,
-   Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc.
+   Copyright (C) 1984, 1986, 1989, 2000, 2001, 2002
+   Free Software Foundation, Inc.
 
-This file is part of Bison, the GNU Compiler Compiler.
+   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 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.
+   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, 675 Mass Ave, Cambridge, MA 02139, USA.  */
+   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., 59 Temple Place - Suite 330,
+   Boston, MA 02111-1307, USA.  */
 
 
-#include <stdio.h>
 #include "system.h"
-#include "machine.h"
-#include "alloc.h"
+#include "quotearg.h"
 #include "files.h"
+#include "symtab.h"
 #include "gram.h"
+#include "LR0.h"
+#include "lalr.h"
+#include "conflicts.h"
+#include "getargs.h"
 #include "state.h"
+#include "reader.h"
+#include "print.h"
+#include "reduce.h"
+#include "closure.h"
+#include "bitset.h"
 
+static bitset shiftset;
+static bitset lookaheadset;
 
-extern char **tags;
-extern int nstates;
-extern short *accessing_symbol;
-extern core **state_table;
-extern shifts **shift_table;
-extern errs **err_table;
-extern reductions **reduction_table;
-extern char *consistent;
-extern char any_conflicts;
-extern char *conflicts;
-extern int final_state;
-
-extern void conflict_log PARAMS((void));
-extern void verbose_conflict_log PARAMS((void));
-extern void print_reductions PARAMS((int));
-
-void terse PARAMS((void));
-void verbose PARAMS((void));
-void print_token PARAMS((int, int));
-void print_state PARAMS((int));
-void print_core PARAMS((int));
-void print_actions PARAMS((int));
-void print_grammar PARAMS((void));
-
-void
-terse (void)
+#if 0
+static void
+print_token (int extnum, int token)
 {
-  if (any_conflicts)
-    {
-      conflict_log();
-    }
+  fprintf (out, _(" type %d is %s\n"), extnum, tags[token]);
 }
+#endif
 
+
+/*--------------------------------.
+| Report information on a state.  |
+`--------------------------------*/
 
-void
-verbose (void)
+static void
+print_core (FILE *out, state_t *state)
 {
-  register int i;
+  int i;
+  item_number_t *sitems = state->items;
+  int snritems   = state->nitems;
+  symbol_t *previous_lhs = NULL;
 
-  if (any_conflicts)
-    verbose_conflict_log();
+  /* Output all the items of a state, not only its kernel.  */
+  if (report_flag & report_itemsets)
+    {
+      closure (sitems, snritems);
+      sitems = itemset;
+      snritems = nritemset;
+    }
 
-  print_grammar();
+  if (!snritems)
+    return;
 
-  for (i = 0; i < nstates; i++)
+  for (i = 0; i < snritems; i++)
     {
-      print_state(i);
+      item_number_t *sp;
+      item_number_t *sp1;
+      int rule;
+
+      sp1 = sp = ritem + sitems[i];
+
+      while (*sp >= 0)
+	sp++;
+
+      rule = -(*sp);
+
+      rule_lhs_print (&rules[rule], previous_lhs, out);
+      previous_lhs = rules[rule].lhs;
+
+      for (sp = rules[rule].rhs; sp < sp1; sp++)
+	fprintf (out, " %s", symbol_tag_get (symbols[*sp]));
+      fputs (" .", out);
+      for (/* Nothing */; *sp >= 0; ++sp)
+	fprintf (out, " %s", symbol_tag_get (symbols[*sp]));
+
+      /* Display the lookaheads?  */
+      if (report_flag & report_lookaheads)
+	state_rule_lookaheads_print (state, &rules[rule], out);
+
+      fputc ('\n', out);
     }
+
+  fputc ('\n', out);
 }
 
 
-void
-print_token (int extnum, int token)
+static void
+print_shifts (FILE *out, state_t *state)
 {
-  fprintf(foutput, _(" type %d is %s\n"), extnum, tags[token]);
+  int i;
+  shifts_t *shiftp = state->shifts;
+
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    if (!SHIFT_IS_DISABLED (shiftp, i))
+      {
+	state_number_t state1 = shiftp->shifts[i];
+	symbol_number_t symbol = states[state1]->accessing_symbol;
+	fprintf (out,
+		 _("    %-4s\tshift, and go to state %d\n"),
+		 symbol_tag_get (symbols[symbol]), state1);
+      }
+
+  if (i > 0)
+    fputc ('\n', out);
 }
 
 
-void
-print_state (int state)
+static void
+print_errs (FILE *out, state_t *state)
 {
-  fprintf(foutput, _("\n\nstate %d\n\n"), state);
-  print_core(state);
-  print_actions(state);
+  errs_t *errp = state->errs;
+  int i;
+
+  for (i = 0; i < errp->nerrs; ++i)
+    if (errp->errs[i])
+      fprintf (out, _("    %-4s\terror (nonassociative)\n"),
+	       symbol_tag_get (symbols[errp->errs[i]]));
+
+  if (i > 0)
+    fputc ('\n', out);
 }
 
 
-void
-print_core (int state)
+static void
+print_gotos (FILE *out, state_t *state)
 {
-  register int i;
-  register int k;
-  register int rule;
-  register core *statep;
-  register short *sp;
-  register short *sp1;
+  int i;
+  shifts_t *shiftp = state->shifts;
 
-  statep = state_table[state];
-  k = statep->nitems;
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    /* Skip token shifts.  */;
 
-  if (k == 0) return;
-
-  for (i = 0; i < k; i++)
+  if (i < shiftp->nshifts)
     {
-      sp1 = sp = ritem + statep->items[i];
+      for (; i < shiftp->nshifts; i++)
+	if (!SHIFT_IS_DISABLED (shiftp, i))
+	  {
+	    state_number_t state1 = shiftp->shifts[i];
+	    symbol_number_t symbol = states[state1]->accessing_symbol;
+	    fprintf (out, _("    %-4s\tgo to state %d\n"),
+		     symbol_tag_get (symbols[symbol]), state1);
+	  }
 
-      while (*sp > 0)
-	sp++;
+      fputc ('\n', out);
+    }
+}
 
-      rule = -(*sp);
-      fprintf(foutput, "    %s  ->  ", tags[rlhs[rule]]);
 
-      for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
+/*----------------------------------------------------------.
+| Return the default rule of this STATE if it has one, NULL |
+| otherwise.                                                |
+`----------------------------------------------------------*/
+
+static rule_t *
+state_default_rule_compute (state_t *state)
+{
+  reductions_t *redp = state->reductions;
+  rule_t *default_rule = NULL;
+  int cmax = 0;
+  int i;
+
+  /* No need for a lookahead.  */
+  if (state->consistent)
+    return &rules[redp->rules[0]];
+
+  /* 1. Each reduction is possibly masked by the lookaheads on which
+     we shift (S/R conflicts)...  */
+  bitset_zero (shiftset);
+  {
+    shifts_t *shiftp = state->shifts;
+    for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+      if (!SHIFT_IS_DISABLED (shiftp, i))
 	{
-	  fprintf(foutput, "%s ", tags[*sp]);
+	  /* If this state has a shift for the error token, don't use a
+	     default rule.  */
+	  if (SHIFT_IS_ERROR (shiftp, i))
+	    return NULL;
+	  bitset_set (shiftset, SHIFT_SYMBOL (shiftp, i));
 	}
+  }
+
+  /* 2. Each reduction is possibly masked by the lookaheads on which
+     we raise an error (due to %nonassoc).  */
+  {
+    errs_t *errp = state->errs;
+    for (i = 0; i < errp->nerrs; i++)
+      if (errp->errs[i])
+	bitset_set (shiftset, errp->errs[i]);
+  }
+
+  for (i = 0; i < state->nlookaheads; ++i)
+    {
+      int count = 0;
 
-      putc('.', foutput);
+      /* How many non-masked lookaheads are there for this reduction?
+	 */
+      bitset_andn (lookaheadset, state->lookaheads[i], shiftset);
+      count = bitset_count (lookaheadset);
 
-      while (*sp > 0)
+      if (count > cmax)
 	{
-	  fprintf(foutput, " %s", tags[*sp]);
-	  sp++;
+	  cmax = count;
+	  default_rule = state->lookaheads_rule[i];
 	}
 
-      fprintf (foutput, _("   (rule %d)"), rule);
-      putc('\n', foutput);
+      /* 3. And finally, each reduction is possibly masked by previous
+	 reductions (in R/R conflicts, we keep the first reductions).
+	 */
+      bitset_or (shiftset, shiftset, state->lookaheads[i]);
     }
 
-  putc('\n', foutput);
+  return default_rule;
 }
 
 
-void
-print_actions (int state)
+/*----------------------------------------------------.
+| Report on OUT the reduction actions of this STATE.  |
+`----------------------------------------------------*/
+
+static void
+print_reductions (FILE *out, state_t *state)
 {
-  register int i;
-  register int k;
-  register int state1;
-  register int symbol;
-  register shifts *shiftp;
-  register errs *errp;
-  register reductions *redp;
-  register int rule;
-
-  shiftp = shift_table[state];
-  redp = reduction_table[state];
-  errp = err_table[state];
-
-  if (!shiftp && !redp)
-    {
-      if (final_state == state)
-	fprintf(foutput, _("    $default\taccept\n"));
-      else
-	fprintf(foutput, _("    NO ACTIONS\n"));
-      return;
-    }
+  int i;
+  shifts_t *shiftp = state->shifts;
+  reductions_t *redp = state->reductions;
+  rule_t *default_rule = NULL;
 
-  if (shiftp)
-    {
-      k = shiftp->nshifts;
+  if (redp->nreds == 0)
+    return;
 
-      for (i = 0; i < k; i++)
-	{
-	  if (! shiftp->shifts[i]) continue;
-	  state1 = shiftp->shifts[i];
-	  symbol = accessing_symbol[state1];
-	  /* The following line used to be turned off.  */
-	  if (ISVAR(symbol)) break;
-          if (symbol==0)      /* I.e. strcmp(tags[symbol],"$")==0 */
-            fprintf(foutput, _("    $   \tgo to state %d\n"), state1);
-          else
-            fprintf(foutput, _("    %-4s\tshift, and go to state %d\n"),
-                    tags[symbol], state1);
-	}
+  default_rule = state_default_rule_compute (state);
 
-      if (i > 0)
-	putc('\n', foutput);
-    }
-  else
+  bitset_zero (shiftset);
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    if (!SHIFT_IS_DISABLED (shiftp, i))
+      bitset_set (shiftset, SHIFT_SYMBOL (shiftp, i));
+
+  for (i = 0; i < ntokens; i++)
     {
-      i = 0;
-      k = 0;
+      int j;
+      int defaulted = 0;
+      int count = bitset_test (shiftset, i);
+
+      for (j = 0; j < state->nlookaheads; ++j)
+	if (bitset_test (state->lookaheads[j], i))
+	  {
+	    if (count == 0)
+	      {
+		if (state->lookaheads_rule[j] != default_rule)
+		  fprintf (out,
+			   _("    %-4s\treduce using rule %d (%s)\n"),
+			   symbol_tag_get (symbols[i]),
+			   state->lookaheads_rule[j]->number - 1,
+			   symbol_tag_get_n (state->lookaheads_rule[j]->lhs, 1));
+		else
+		  defaulted = 1;
+		count++;
+	      }
+	    else
+	      {
+		if (defaulted)
+		  fprintf (out,
+			   _("    %-4s\treduce using rule %d (%s)\n"),
+			   symbol_tag_get (symbols[i]),
+			   default_rule->number - 1,
+			   symbol_tag_get_n (default_rule->lhs, 1));
+		defaulted = 0;
+		fprintf (out,
+			 _("    %-4s\t[reduce using rule %d (%s)]\n"),
+			 symbol_tag_get (symbols[i]),
+			 state->lookaheads_rule[j]->number - 1,
+			 symbol_tag_get_n (state->lookaheads_rule[j]->lhs, 1));
+	      }
+	  }
     }
 
-  if (errp)
-    {
-      int j, nerrs;
+  if (default_rule)
+    fprintf (out, _("    $default\treduce using rule %d (%s)\n"),
+	     default_rule->number - 1,
+	     symbol_tag_get (default_rule->lhs));
+  fputc ('\n', out);
+}
 
-      nerrs = errp->nerrs;
 
-      for (j = 0; j < nerrs; j++)
-	{
-	  if (! errp->errs[j]) continue;
-	  symbol = errp->errs[j];
-	  fprintf(foutput, _("    %-4s\terror (nonassociative)\n"), tags[symbol]);
-	}
+/*--------------------------------------------------------------.
+| Report on OUT all the actions (shifts, gotos, reductions, and |
+| explicit erros from %nonassoc) of STATE.                      |
+`--------------------------------------------------------------*/
 
-      if (j > 0)
-	putc('\n', foutput);
-    }
+static void
+print_actions (FILE *out, state_t *state)
+{
+  reductions_t *redp = state->reductions;
+  shifts_t *shiftp = state->shifts;
 
-  if (consistent[state] && redp)
+  if (shiftp->nshifts == 0 && redp->nreds == 0)
     {
-      rule = redp->rules[0];
-      symbol = rlhs[rule];
-      fprintf(foutput, _("    $default\treduce using rule %d (%s)\n\n"),
-     	        rule, tags[symbol]);
-    }
-  else if (redp)
-    {
-      print_reductions(state);
+      if (state->number == final_state->number)
+	fprintf (out, _("    $default\taccept\n"));
+      else
+	fprintf (out, _("    NO ACTIONS\n"));
+      return;
     }
 
-  if (i < k)
-    {
-      for (; i < k; i++)
-	{
-	  if (! shiftp->shifts[i]) continue;
-	  state1 = shiftp->shifts[i];
-	  symbol = accessing_symbol[state1];
-	  fprintf(foutput, _("    %-4s\tgo to state %d\n"), tags[symbol], state1);
-	}
-
-      putc('\n', foutput);
-    }
+  print_shifts (out, state);
+  print_errs (out, state);
+  print_reductions (out, state);
+  print_gotos (out, state);
 }
 
-#define END_TEST(end) \
-  if (column + strlen(buffer) > (end))					 \
-    { fprintf (foutput, "%s\n   ", buffer); column = 3; buffer[0] = 0; } \
-  else
 
-void
-print_grammar (void)
+static void
+print_state (FILE *out, state_t *state)
+{
+  fprintf (out, _("state %d"), state->number);
+  fputs ("\n\n", out);
+  print_core (out, state);
+  print_actions (out, state);
+  if ((report_flag & report_solved_conflicts)
+      && state->solved_conflicts)
+    fputs (state->solved_conflicts, out);
+  fputs ("\n\n", out);
+}
+
+/*-----------------------------------------.
+| Print information on the whole grammar.  |
+`-----------------------------------------*/
+
+#define END_TEST(End)				\
+do {						\
+  if (column + strlen(buffer) > (End))		\
+    {						\
+      fprintf (out, "%s\n   ", buffer);		\
+      column = 3;				\
+      buffer[0] = 0;				\
+    }						\
+} while (0)
+
+
+static void
+print_grammar (FILE *out)
 {
-  int i, j;
-  short* rule;
+  symbol_number_t i;
   char buffer[90];
   int column = 0;
 
-  /* rule # : LHS -> RHS */
-  fputs(_("\nGrammar\n"), foutput);
-  for (i = 1; i <= nrules; i++)
-    /* Don't print rules disabled in reduce_grammar_tables.  */
-    if (rlhs[i] >= 0)
-      {
-	fprintf(foutput, _("rule %-4d %s ->"), i, tags[rlhs[i]]);
-	rule = &ritem[rrhs[i]];
-	if (*rule > 0)
-	  while (*rule > 0)
-	    fprintf(foutput, " %s", tags[*rule++]);
-	else
-	  fputs (_("		/* empty */"), foutput);
-	putc('\n', foutput);
-      }
+  grammar_rules_print (out);
 
   /* TERMINAL (type #) : rule #s terminal is on RHS */
-  fputs(_("\nTerminals, with rules where they appear\n\n"), foutput);
-  fprintf(foutput, "%s (-1)\n", tags[0]);
-  if (translations)
-    {
-      for (i = 0; i <= max_user_token_number; i++)
-	if (token_translations[i] != 2)
-	  {
-	    buffer[0] = 0;
-	    column = strlen (tags[token_translations[i]]);
-	    fprintf(foutput, "%s", tags[token_translations[i]]);
-	    END_TEST (50);
-	    sprintf (buffer, " (%d)", i);
-
-	    for (j = 1; j <= nrules; j++)
-	      {
-		for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
-		  if (*rule == token_translations[i])
-		    {
-		      END_TEST (65);
-		      sprintf (buffer + strlen(buffer), " %d", j);
-		      break;
-		    }
-	      }
-	    fprintf (foutput, "%s\n", buffer);
-	  }
-    }
-  else
-    for (i = 1; i < ntokens; i++)
+  fprintf (out, "%s\n\n", _("Terminals, with rules where they appear"));
+  for (i = 0; i < max_user_token_number + 1; i++)
+    if (token_translations[i] != undeftoken->number)
       {
+	const char *tag = symbol_tag_get (symbols[token_translations[i]]);
+	rule_number_t r;
+	item_number_t *rhsp;
+
 	buffer[0] = 0;
-	column = strlen (tags[i]);
-	fprintf(foutput, "%s", tags[i]);
+	column = strlen (tag);
+	fputs (tag, out);
 	END_TEST (50);
 	sprintf (buffer, " (%d)", i);
 
-	for (j = 1; j <= nrules; j++)
-	  {
-	    for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
-	      if (*rule == i)
-		{
-		  END_TEST (65);
-		  sprintf (buffer + strlen(buffer), " %d", j);
-		  break;
-		}
-	  }
-	fprintf (foutput, "%s\n", buffer);
+	for (r = 1; r < nrules + 1; r++)
+	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+	    if (item_number_as_symbol_number (*rhsp) == token_translations[i])
+	      {
+		END_TEST (65);
+		sprintf (buffer + strlen (buffer), " %d", r - 1);
+		break;
+	      }
+	fprintf (out, "%s\n", buffer);
       }
+  fputs ("\n\n", out);
+
 
-  fputs(_("\nNonterminals, with rules where they appear\n\n"), foutput);
-  for (i = ntokens; i <= nsyms - 1; i++)
+  fprintf (out, "%s\n\n", _("Nonterminals, with rules where they appear"));
+  for (i = ntokens; i < nsyms; i++)
     {
       int left_count = 0, right_count = 0;
+      rule_number_t r;
+      const char *tag = symbol_tag_get (symbols[i]);
 
-      for (j = 1; j <= nrules; j++)
+      for (r = 1; r < nrules + 1; r++)
 	{
-	  if (rlhs[j] == i)
+	  item_number_t *rhsp;
+	  if (rules[r].lhs->number == i)
 	    left_count++;
-	  for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
-	    if (*rule == i)
+	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+	    if (item_number_as_symbol_number (*rhsp) == i)
 	      {
 		right_count++;
 		break;
@@ -331,41 +415,74 @@ print_grammar (void)
 	}
 
       buffer[0] = 0;
-      fprintf(foutput, "%s", tags[i]);
-      column = strlen (tags[i]);
+      fputs (tag, out);
+      column = strlen (tag);
       sprintf (buffer, " (%d)", i);
       END_TEST (0);
 
       if (left_count > 0)
 	{
 	  END_TEST (50);
-	  sprintf (buffer + strlen(buffer), _(" on left:"));
+	  sprintf (buffer + strlen (buffer), _(" on left:"));
 
-	  for (j = 1; j <= nrules; j++)
+	  for (r = 1; r < nrules + 1; r++)
 	    {
 	      END_TEST (65);
-	      if (rlhs[j] == i)
-		sprintf (buffer + strlen(buffer), " %d", j);
+	      if (rules[r].lhs->number == i)
+		sprintf (buffer + strlen (buffer), " %d", r - 1);
 	    }
 	}
 
       if (right_count > 0)
 	{
 	  if (left_count > 0)
-	    sprintf (buffer + strlen(buffer), ",");
+	    sprintf (buffer + strlen (buffer), ",");
 	  END_TEST (50);
-	  sprintf (buffer + strlen(buffer), _(" on right:"));
-	  for (j = 1; j <= nrules; j++)
+	  sprintf (buffer + strlen (buffer), _(" on right:"));
+	  for (r = 1; r < nrules + 1; r++)
 	    {
-	      for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
-		if (*rule == i)
+	      item_number_t *rhsp;
+	      for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+		if (item_number_as_symbol_number (*rhsp) == i)
 		  {
 		    END_TEST (65);
-		    sprintf (buffer + strlen(buffer), " %d", j);
+		    sprintf (buffer + strlen (buffer), " %d", r - 1);
 		    break;
 		  }
 	    }
 	}
-      fprintf (foutput, "%s\n", buffer);
+      fprintf (out, "%s\n", buffer);
     }
+  fputs ("\n\n", out);
+}
+
+void
+print_results (void)
+{
+  state_number_t i;
+
+  /* We used to use just .out if SPEC_NAME_PREFIX (-p) was used, but
+     that conflicts with Posix.  */
+  FILE *out = xfopen (spec_verbose_file, "w");
+
+  reduce_output (out);
+  conflicts_output (out);
+
+  print_grammar (out);
+
+  /* If the whole state item sets, not only the kernels, are wanted,
+     `closure' will be run, which needs memory allocation/deallocation.   */
+  if (report_flag & report_itemsets)
+    new_closure (nritems);
+  /* Storage for print_reductions.  */
+  shiftset =  bitset_create (ntokens, BITSET_FIXED);
+  lookaheadset = bitset_create (ntokens, BITSET_FIXED);
+  for (i = 0; i < nstates; i++)
+    print_state (out, states[i]);
+  bitset_free (shiftset);
+  bitset_free (lookaheadset);
+  if (report_flag & report_itemsets)
+    free_closure ();
+
+  xfclose (out);
 }