Copy BYacc's nice way to report the grammar.

[bison.git] / src / print.c

diff --git a/src/print.c b/src/print.c
index faa6c0a133e68da3e69f775141b660c5dafa5ce0..280ac8d8417acbe5c4ffe8def58090df8968d31c 100644 (file)
--- a/src/print.c
+++ b/src/print.c
@@ -1,5 +1,6 @@
 /* Print information on generated parser, for bison,
 /* Print information on generated parser, for bison,

-   Copyright 1984, 1986, 1989, 2000, 2001 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.
 


@@ -20,7 +21,9 @@
 
 
 #include "system.h"
 
 
 #include "system.h"

+#include "quotearg.h"

 #include "files.h"
 #include "files.h"

+#include "symtab.h"

 #include "gram.h"
 #include "LR0.h"
 #include "lalr.h"
 #include "gram.h"
 #include "LR0.h"
 #include "lalr.h"


@@ -30,6 +33,11 @@
 #include "reader.h"
 #include "print.h"
 #include "reduce.h"
 #include "reader.h"
 #include "print.h"
 #include "reduce.h"

+#include "closure.h"
+#include "bitset.h"
+
+static bitset shiftset;
+static bitset lookaheadset;

 
 #if 0
 static void
 
 #if 0
 static void


@@ -45,147 +53,307 @@ print_token (int extnum, int token)
 `--------------------------------*/
 
 static void
 `--------------------------------*/
 
 static void

-print_core (FILE *out, int state)
+print_core (FILE *out, state_t *state)

 {
   int i;
 {
   int i;

-  core *statep = state_table[state].state;
+  item_number_t *sitems = state->items;
+  int snritems   = state->nitems;

 
 

-  if (!statep->nitems)
-    return;
+  /* Output all the items of a state, not only its kernel.  */
+  if (report_flag & report_itemsets)
+    {
+      closure (sitems, snritems);
+      sitems = itemset;
+      snritems = nritemset;
+    }

 
 

-  for (i = 0; i < statep->nitems; i++)
+  if (snritems)

     {
     {

-      short *sp;
-      short *sp1;
-      int rule;
+      for (i = 0; i < snritems; i++)
+       {
+         item_number_t *sp;
+         item_number_t *sp1;
+         int rule;

 
 

-      sp1 = sp = ritem + statep->items[i];
+         sp1 = sp = ritem + sitems[i];

 
 

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

 
 

-      rule = -(*sp);
-      fprintf (out, "    %s  ->  ", tags[rule_table[rule].lhs]);
+         rule = -(*sp);
+         fprintf (out, "    %s  ->  ", symbol_tag_get (rules[rule].lhs));

 
 

-      for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
-       fprintf (out, "%s ", tags[*sp]);
+         for (sp = rules[rule].rhs; sp < sp1; sp++)
+           fprintf (out, "%s ", symbol_tag_get (symbols[*sp]));

 
 

-      fputc ('.', out);
+         fputc ('.', out);

 
 

-      for (/* Nothing */; *sp > 0; ++sp)
-       fprintf (out, " %s", tags[*sp]);
+         for (/* Nothing */; *sp >= 0; ++sp)
+           fprintf (out, " %s", symbol_tag_get (symbols[*sp]));
+
+         /* Display the lookaheads?  */
+         if (report_flag & report_lookaheads)
+           {
+             int j, k;
+             int nlookaheads = 0;
+             /* Look for lookaheads corresponding to this rule. */
+             for (j = 0; j < state->nlookaheads; ++j)
+               for (k = 0; k < ntokens; ++k)
+                 if (bitset_test (LA[state->lookaheadsp + j], k)
+                     && LArule[state->lookaheadsp + j]->number == rule)
+                   nlookaheads++;
+             if (nlookaheads)
+               {
+                 fprintf (out, "  [");
+                 for (j = 0; j < state->nlookaheads; ++j)
+                   for (k = 0; k < ntokens; ++k)
+                     if (bitset_test (LA[state->lookaheadsp + j], k)
+                         && LArule[state->lookaheadsp + j]->number == rule)
+                       fprintf (out, "%s%s",
+                                symbol_tag_get (symbols[k]),
+                                --nlookaheads ? ", " : "");
+                 fprintf (out, "]");
+               }
+           }
+
+         fprintf (out, _("   (rule %d)"), rule - 1);
+         fputc ('\n', out);
+       }

 
 

-      fprintf (out, _("   (rule %d)"), rule);

       fputc ('\n', out);
     }
       fputc ('\n', out);
     }

+}
+
+
+static void
+print_shifts (FILE *out, state_t *state)
+{
+  int i;
+  shifts *shiftp = state->shifts;

 
 

-  fputc ('\n', out);
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    if (!SHIFT_IS_DISABLED (shiftp, i))
+      {
+       int 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);

 }
 
 }
 

+

 static void
 static void

-print_actions (FILE *out, int state)
+print_errs (FILE *out, state_t *state)

 {
 {

+  errs *errp = state->errs;

   int i;
   int i;

-  int k;

 
 

-  shifts   *shiftp = state_table[state].shift_table;
-  reductions *redp = state_table[state].reduction_table;
-  errs       *errp = err_table[state];
+  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 (!shiftp && !redp)
-    {
-      if (final_state == state)
-       fprintf (out, _("    $default\taccept\n"));
-      else
-       fprintf (out, _("    NO ACTIONS\n"));
-      return;
-    }
+  if (i > 0)
+    fputc ('\n', out);
+}

 
 

-  if (shiftp)
-    {
-      k = shiftp->nshifts;

 
 

-      for (i = 0; i < k; i++)
-       {
-         int symbol;
-         int state1 = shiftp->shifts[i];
-         if (!state1)
-           continue;
-         symbol = state_table[state1].accessing_symbol;
-         /* The following line used to be turned off.  */
-         if (ISVAR (symbol))
-           break;
-         if (symbol == 0)      /* I.e. strcmp(tags[symbol],"$")==0 */
-           fprintf (out,
-                    _("    $   \tgo to state %d\n"), state1);
-         else
-           fprintf (out,
-                    _("    %-4s\tshift, and go to state %d\n"),
-                    tags[symbol], state1);
-       }
+static void
+print_gotos (FILE *out, state_t *state)
+{
+  int i;
+  shifts *shiftp = state->shifts;

 
 

-      if (i > 0)
-       fputc ('\n', out);
-    }
-  else
-    {
-      i = 0;
-      k = 0;
-    }
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    /* Skip token shifts.  */;

 
 

-  if (errp)
+  if (i < shiftp->nshifts)

     {
     {

-      int j;
-      for (j = 0; j < errp->nerrs; j++)
-       {
-         int symbol = errp->errs[j];
-         if (!symbol)
-           continue;
-         fprintf (out, _("    %-4s\terror (nonassociative)\n"),
-                  tags[symbol]);
-       }
+      for (; i < shiftp->nshifts; i++)
+       if (!SHIFT_IS_DISABLED (shiftp, i))
+         {
+           int 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);
+         }

 
 

-      if (j > 0)
-       fputc ('\n', out);
+      fputc ('\n', out);

     }
     }

+}

 
 

-  if (state_table[state].consistent && redp)
+static void
+print_reductions (FILE *out, state_t *state)
+{
+  int i;
+  shifts *shiftp = state->shifts;
+  reductions *redp = state->reductions;
+  errs *errp = state->errs;
+  int nodefault = 0;
+
+  if (redp->nreds == 0)
+    return;
+
+  if (state->consistent)

     {
       int rule = redp->rules[0];
     {
       int rule = redp->rules[0];

-      int symbol = rule_table[rule].lhs;
+      symbol_number_t symbol = rules[rule].lhs->number;

       fprintf (out, _("    $default\treduce using rule %d (%s)\n\n"),
       fprintf (out, _("    $default\treduce using rule %d (%s)\n\n"),

-              rule, tags[symbol]);
+              rule - 1, symbol_tag_get (symbols[symbol]));
+      return;

     }
     }

-  else if (redp)
+
+  bitset_zero (shiftset);
+
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    if (!SHIFT_IS_DISABLED (shiftp, i))
+      {
+       /* if this state has a shift for the error token, don't use a
+          default rule.  */
+       if (SHIFT_IS_ERROR (shiftp, i))
+         nodefault = 1;
+       bitset_set (shiftset, SHIFT_SYMBOL (shiftp, i));
+      }
+
+  for (i = 0; i < errp->nerrs; i++)
+    if (errp->errs[i])
+      bitset_set (shiftset, errp->errs[i]);
+
+  if (state->nlookaheads == 1 && !nodefault)

     {
     {

-      print_reductions (out, state);
-    }
+      rule_t *default_rule = LArule[state->lookaheadsp];
+
+      bitset_and (lookaheadset, LA[state->lookaheadsp], shiftset);

 
 

-  if (i < k)
+      for (i = 0; i < ntokens; i++)
+       if (bitset_test (lookaheadset, i))
+         fprintf (out, _("    %-4s\t[reduce using rule %d (%s)]\n"),
+                  symbol_tag_get (symbols[i]),
+                  default_rule->number - 1,
+                  symbol_tag_get_n (default_rule->lhs, 1));
+
+      fprintf (out, _("    $default\treduce using rule %d (%s)\n\n"),
+              default_rule->number - 1,
+              symbol_tag_get (default_rule->lhs));
+    }
+  else if (state->nlookaheads >= 1)

     {
     {

-      for (; i < k; i++)
+      int cmax = 0;
+      int default_LA = -1;
+      rule_t *default_rule = NULL;
+
+      if (!nodefault)
+       for (i = 0; i < state->nlookaheads; ++i)
+         {
+           int count = 0;
+           int j;
+
+           bitset_andn (lookaheadset, LA[state->lookaheadsp + i], shiftset);
+
+           for (j = 0; j < ntokens; j++)
+             if (bitset_test (lookaheadset, j))
+               count++;
+
+           if (count > cmax)
+             {
+               cmax = count;
+               default_LA = state->lookaheadsp + i;
+               default_rule = LArule[state->lookaheadsp + i];
+             }
+
+           bitset_or (shiftset, shiftset, lookaheadset);
+         }
+
+      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++)

        {
        {

-         int symbol;
-         int state1 = shiftp->shifts[i];
-         if (!state1)
-           continue;
-         symbol = state_table[state1].accessing_symbol;
-         fprintf (out, _("    %-4s\tgo to state %d\n"),
-                  tags[symbol], state1);
+         int j;
+         int defaulted = 0;
+         int count = bitset_test (shiftset, i);
+
+         for (j = 0; j < state->nlookaheads; ++j)
+           if (bitset_test (LA[state->lookaheadsp + j], i))
+             {
+               if (count == 0)
+                 {
+                   if (state->lookaheadsp + j != default_LA)
+                     fprintf (out,
+                              _("    %-4s\treduce using rule %d (%s)\n"),
+                              symbol_tag_get (symbols[i]),
+                              LArule[state->lookaheadsp + j]->number - 1,
+                              symbol_tag_get_n (LArule[state->lookaheadsp + j]->lhs, 1));
+                   else
+                     defaulted = 1;
+
+                   count++;
+                 }
+               else
+                 {
+                   if (defaulted)
+                     fprintf (out,
+                              _("    %-4s\treduce using rule %d (%s)\n"),
+                              symbol_tag_get (symbols[i]),
+                              LArule[default_LA]->number - 1,
+                              symbol_tag_get_n (LArule[default_LA]->lhs, 1));
+                   defaulted = 0;
+                   fprintf (out,
+                            _("    %-4s\t[reduce using rule %d (%s)]\n"),
+                            symbol_tag_get (symbols[i]),
+                            LArule[state->lookaheadsp + j]->number - 1,
+                            symbol_tag_get_n (LArule[state->lookaheadsp + j]->lhs, 1));
+                 }
+             }

        }
 
        }
 

-      fputc ('\n', out);
+      if (default_LA >= 0)
+       fprintf (out, _("    $default\treduce using rule %d (%s)\n"),
+                default_rule->number - 1,
+                symbol_tag_get (default_rule->lhs));

     }
 }
 
     }
 }
 

+

 static void
 static void

-print_state (FILE *out, int state)
+print_actions (FILE *out, state_t *state)

 {
 {

-  fputs ("\n\n", out);
-  fprintf (out, _("state %d"), state);
+  reductions *redp = state->reductions;
+  shifts *shiftp = state->shifts;
+
+  if (shiftp->nshifts == 0 && redp->nreds == 0)
+    {
+      if (final_state == state->number)
+       fprintf (out, _("    $default\taccept\n"));
+      else
+       fprintf (out, _("    NO ACTIONS\n"));
+      return;
+    }
+
+  print_shifts (out, state);
+  print_errs (out, state);
+  print_reductions (out, state);
+  print_gotos (out, state);
+}
+
+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);
   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);

 }
 \f
 /*-----------------------------------------.
 }
 \f
 /*-----------------------------------------.


@@ -206,63 +374,52 @@ do {                                              \
 static void
 print_grammar (FILE *out)
 {
 static void
 print_grammar (FILE *out)
 {

-  int i, j;
-  short *rule;
+  symbol_number_t i;
+  item_number_t *rule;

   char buffer[90];
   int column = 0;
 
   char buffer[90];
   int column = 0;
 

-  /* rule # : LHS -> RHS */
-  fprintf (out, "\n%s\n\n", _("Grammar"));
-  for (i = 1; i <= nrules; i++)
-    /* Don't print rules disabled in reduce_grammar_tables.  */
-    if (rule_table[i].lhs >= 0)
-      {
-       fprintf (out, _("rule %-4d %s ->"), i, tags[rule_table[i].lhs]);
-       rule = &ritem[rule_table[i].rhs];
-       if (*rule > 0)
-         while (*rule > 0)
-           fprintf (out, " %s", tags[*rule++]);
-       else
-         fprintf (out, "               /* %s */", _("empty"));
-       fputc ('\n', out);
-      }
+  grammar_rules_print (out);

 
   /* TERMINAL (type #) : rule #s terminal is on RHS */
 
   /* TERMINAL (type #) : rule #s terminal is on RHS */

-  fprintf (out, "\n%s\n\n", _("Terminals, with rules where they appear"));
-  fprintf (out, "%s (-1)\n", tags[0]);
-
-  for (i = 0; i <= max_user_token_number; i++)
-    if (token_translations[i] != 2)
+  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]]);
+       int r;

        buffer[0] = 0;
        buffer[0] = 0;

-       column = strlen (tags[token_translations[i]]);
-       fputs (tags[token_translations[i]], out);
+       column = strlen (tag);
+       fputs (tag, out);

        END_TEST (50);
        sprintf (buffer, " (%d)", i);
 
        END_TEST (50);
        sprintf (buffer, " (%d)", i);
 

-       for (j = 1; j <= nrules; j++)
-         for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
-           if (*rule == token_translations[i])
+       for (r = 1; r < nrules + 1; r++)
+         for (rule = rules[r].rhs; *rule >= 0; rule++)
+           if (item_number_as_symbol_number (*rule) == token_translations[i])

              {
                END_TEST (65);
              {
                END_TEST (65);

-               sprintf (buffer + strlen (buffer), " %d", j);
+               sprintf (buffer + strlen (buffer), " %d", r - 1);

                break;
              }
        fprintf (out, "%s\n", buffer);
       }
                break;
              }
        fprintf (out, "%s\n", buffer);
       }

+  fputs ("\n\n", out);
+

 
 

-  fprintf (out, "\n%s\n\n",
-          _("Nonterminals, with rules where they appear"));
-  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;
     {
       int left_count = 0, right_count = 0;

+      int r;
+      const char *tag = symbol_tag_get (symbols[i]);

 
 

-      for (j = 1; j <= nrules; j++)
+      for (r = 1; r < nrules + 1; r++)

        {
        {

-         if (rule_table[j].lhs == i)
+         if (rules[r].lhs->number == i)

            left_count++;
            left_count++;

-         for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
-           if (*rule == i)
+         for (rule = rules[r].rhs; *rule >= 0; rule++)
+           if (item_number_as_symbol_number (*rule) == i)

              {
                right_count++;
                break;
              {
                right_count++;
                break;


@@ -270,8 +427,8 @@ print_grammar (FILE *out)
        }
 
       buffer[0] = 0;
        }
 
       buffer[0] = 0;

-      fputs (tags[i], out);
-      column = strlen (tags[i]);
+      fputs (tag, out);
+      column = strlen (tag);

       sprintf (buffer, " (%d)", i);
       END_TEST (0);
 
       sprintf (buffer, " (%d)", i);
       END_TEST (0);
 


@@ -280,11 +437,11 @@ print_grammar (FILE *out)
          END_TEST (50);
          sprintf (buffer + strlen (buffer), _(" on left:"));
 
          END_TEST (50);
          sprintf (buffer + strlen (buffer), _(" on left:"));
 

-         for (j = 1; j <= nrules; j++)
+         for (r = 1; r < nrules + 1; r++)

            {
              END_TEST (65);
            {
              END_TEST (65);

-             if (rule_table[j].lhs == i)
-               sprintf (buffer + strlen (buffer), " %d", j);
+             if (rules[r].lhs->number == i)
+               sprintf (buffer + strlen (buffer), " %d", r - 1);

            }
        }
 
            }
        }
 


@@ -294,44 +451,49 @@ print_grammar (FILE *out)
            sprintf (buffer + strlen (buffer), ",");
          END_TEST (50);
          sprintf (buffer + strlen (buffer), _(" on right:"));
            sprintf (buffer + strlen (buffer), ",");
          END_TEST (50);
          sprintf (buffer + strlen (buffer), _(" on right:"));

-         for (j = 1; j <= nrules; j++)
+         for (r = 1; r < nrules + 1; r++)

            {
            {

-             for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
-               if (*rule == i)
+             for (rule = rules[r].rhs; *rule >= 0; rule++)
+               if (item_number_as_symbol_number (*rule) == i)

                  {
                    END_TEST (65);
                  {
                    END_TEST (65);

-                   sprintf (buffer + strlen (buffer), " %d", j);
+                   sprintf (buffer + strlen (buffer), " %d", r - 1);

                    break;
                  }
            }
        }
       fprintf (out, "%s\n", buffer);
     }
                    break;
                  }
            }
        }
       fprintf (out, "%s\n", buffer);
     }

+  fputs ("\n\n", out);

 }
 \f
 void
 print_results (void)
 {
 }
 \f
 void
 print_results (void)
 {

-  if (verbose_flag)
-    {
-      int 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");
-
-      size_t size = obstack_object_size (&output_obstack);
-      fwrite (obstack_finish (&output_obstack), 1, size, out);
-
-      reduce_output (out);
-      conflicts_output (out);
-
-      print_grammar (out);
-
-      for (i = 0; i < nstates; i++)
-       print_state (out, i);
-
-      xfclose (out);
-    }
-  obstack_free (&output_obstack, NULL);
+  size_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);

 }
 }