* src/closure.c (print_firsts, print_fderives, closure):

[bison.git] / src / print.c

diff --git a/src/print.c b/src/print.c
index 9a8485370ad7f16ef71696fdb37e67f5496bbe81..021cb4837ac6fcc12e638417f84827e94f2de159 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 (C) 1984, 1986, 1989, 2000 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,8 +21,9 @@
 
 
 #include "system.h"
 
 
 #include "system.h"

-#include "alloc.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"


@@ -29,274 +31,372 @@
 #include "getargs.h"
 #include "state.h"
 #include "reader.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;

 
 #if 0
 static void
 print_token (int extnum, int token)
 {
 
 #if 0
 static void
 print_token (int extnum, int token)
 {

-  fprintf (foutput, _(" type %d is %s\n"), extnum, tags[token]);
+  fprintf (out, _(" type %d is %s\n"), extnum, tags[token]);

 }
 #endif
 
 \f
 }
 #endif
 
 \f

-/*================================\
+/*--------------------------------.

 | Report information on a state.  |
 | Report information on a state.  |

-\================================*/
+`--------------------------------*/

 
 static void
 
 static void

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

 {
   int i;
 {
   int i;

-  int k;
-  int rule;
-  core *statep;
-  short *sp;
-  short *sp1;
+  item_number_t *sitems = state->items;
+  int snritems   = state->nitems;

 
 

-  statep = state_table[state];
-  k = statep->nitems;
-
-  if (k == 0)
-    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 < k; i++)
+  if (snritems)

     {
     {

-      sp1 = sp = ritem + statep->items[i];
+      for (i = 0; i < snritems; i++)
+       {
+         item_number_t *sp;
+         item_number_t *sp1;
+         int rule;

 
 

-      while (*sp > 0)
-       sp++;
+         sp1 = sp = ritem + sitems[i];

 
 

-      rule = -(*sp);
-      fprintf (foutput, "    %s  ->  ", tags[rlhs[rule]]);
+         while (*sp >= 0)
+           sp++;

 
 

-      for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
-       {
-         fprintf (foutput, "%s ", tags[*sp]);
-       }
+         rule = -(*sp);
+         fprintf (out, "    %s  ->  ", symbol_tag_get (rules[rule].lhs));

 
 

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

 
 

-      while (*sp > 0)
-       {
-         fprintf (foutput, " %s", tags[*sp]);
-         sp++;
+         fputc ('.', 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);
+
+         fprintf (out, _("   (rule %d)"), rule - 1);
+         fputc ('\n', out);

        }
 
        }
 

-      fprintf (foutput, _("   (rule %d)"), rule);
-      putc ('\n', foutput);
+      fputc ('\n', out);

     }
     }

+}
+
+
+static void
+print_shifts (FILE *out, state_t *state)
+{
+  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);
+}
+
+
+static void
+print_errs (FILE *out, state_t *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]]));

 
 

-  putc ('\n', foutput);
+  if (i > 0)
+    fputc ('\n', out);

 }
 
 }
 

+

 static void
 static void

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

 {
   int i;
 {
   int i;

-  int k;
-  int state1;
-  int symbol;
-  shifts *shiftp;
-  errs *errp;
-  reductions *redp;
-  int rule;
-
-  shiftp = shift_table[state];
-  redp = reduction_table[state];
-  errp = err_table[state];
-
-  if (!shiftp && !redp)
+  shifts_t *shiftp = state->shifts;
+
+  for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+    /* Skip token shifts.  */;
+
+  if (i < shiftp->nshifts)

     {
     {

-      if (final_state == state)
-       fprintf (foutput, _("    $default\taccept\n"));
-      else
-       fprintf (foutput, _("    NO ACTIONS\n"));
+      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);
+         }
+
+      fputc ('\n', out);
+    }
+}
+
+static void
+print_reductions (FILE *out, state_t *state)
+{
+  int i;
+  shifts_t *shiftp = state->shifts;
+  reductions_t *redp = state->reductions;
+  errs_t *errp = state->errs;
+  int nodefault = 0;
+
+  if (redp->nreds == 0)
+    return;
+
+  if (state->consistent)
+    {
+      int rule = redp->rules[0];
+      symbol_number_t symbol = rules[rule].lhs->number;
+      fprintf (out, _("    $default\treduce using rule %d (%s)\n\n"),
+              rule - 1, symbol_tag_get (symbols[symbol]));

       return;
     }
 
       return;
     }
 

-  if (shiftp)
+  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)

     {
     {

-      k = shiftp->nshifts;
+      rule_t *default_rule = state->lookaheads_rule[0];

 
 

-      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);
-       }
+      bitset_and (lookaheadset, state->lookaheads[0], shiftset);

 
 

-      if (i > 0)
-       putc ('\n', foutput);
+      BITSET_EXECUTE (lookaheadset, 0, 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
+  else if (state->nlookaheads >= 1)

     {
     {

-      i = 0;
-      k = 0;
-    }
+      int cmax = 0;
+      int default_LA = -1;
+      rule_t *default_rule = NULL;

 
 

-  if (errp)
-    {
-      int j, nerrs;
+      if (!nodefault)
+       for (i = 0; i < state->nlookaheads; ++i)
+         {
+           int count = 0;

 
 

-      nerrs = errp->nerrs;
+           bitset_andn (lookaheadset, state->lookaheads[i], shiftset);
+           count = bitset_count (lookaheadset);
+
+           if (count > cmax)
+             {
+               cmax = count;
+               default_LA = i;
+               default_rule = state->lookaheads_rule[i];
+             }

 
 

-      for (j = 0; j < nerrs; j++)
+           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++)

        {
        {

-         if (!errp->errs[j])
-           continue;
-         symbol = errp->errs[j];
-         fprintf (foutput, _("    %-4s\terror (nonassociative)\n"),
-                  tags[symbol]);
+         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 (j != default_LA)
+                     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]),
+                              state->lookaheads_rule[default_LA]->number - 1,
+                              symbol_tag_get_n (state->lookaheads_rule[default_LA]->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 (j > 0)
-       putc ('\n', foutput);
+      if (default_LA >= 0)
+       fprintf (out, _("    $default\treduce using rule %d (%s)\n"),
+                default_rule->number - 1,
+                symbol_tag_get (default_rule->lhs));

     }
     }

+}

 
 

-  if (consistent[state] && redp)
-    {
-      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 (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);
-       }
+static void
+print_actions (FILE *out, state_t *state)
+{
+  reductions_t *redp = state->reductions;
+  shifts_t *shiftp = state->shifts;

 
 

-      putc ('\n', foutput);
+  if (shiftp->nshifts == 0 && redp->nreds == 0)
+    {
+      if (state->number == final_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
 }
 
 static void

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

 {
 {

-  fprintf (foutput, _("\n\nstate %d\n\n"), state);
-  print_core (state);
-  print_actions (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);

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

-#define END_TEST(end)                          \
-  do {                                         \
-    if (column + strlen(buffer) > (end)) {     \
-      fprintf (foutput, "%s\n   ", buffer);    \
+#define END_TEST(End)                          \
+do {                                           \
+  if (column + strlen(buffer) > (End))         \
+    {                                          \
+      fprintf (out, "%s\n   ", buffer);                \

       column = 3;                              \
       buffer[0] = 0;                           \
     }                                          \
       column = 3;                              \
       buffer[0] = 0;                           \
     }                                          \

-  } while (0)
+} while (0)

 
 
 static void
 
 
 static void

-print_grammar (void)
+print_grammar (FILE *out)

 {
 {

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

   char buffer[90];
   int column = 0;
 
   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 */
 
   /* 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;
        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);
 
        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;
     {
       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++;
            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;
              {
                right_count++;
                break;


@@ -304,8 +404,8 @@ print_grammar (void)
        }
 
       buffer[0] = 0;
        }
 
       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);
 
       sprintf (buffer, " (%d)", i);
       END_TEST (0);
 


@@ -314,11 +414,11 @@ print_grammar (void)
          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 (rlhs[j] == i)
-               sprintf (buffer + strlen (buffer), " %d", j);
+             if (rules[r].lhs->number == i)
+               sprintf (buffer + strlen (buffer), " %d", r - 1);

            }
        }
 
            }
        }
 


@@ -328,33 +428,50 @@ print_grammar (void)
            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[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);
                  {
                    END_TEST (65);

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

                    break;
                  }
            }
        }
                    break;
                  }
            }
        }

-      fprintf (foutput, "%s\n", buffer);
+      fprintf (out, "%s\n", buffer);

     }
     }

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

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

-  int i;
-
-  if (any_conflicts)
-    print_conflicts ();
-
-  if (verboseflag)
-    print_grammar ();
-
-  if (verboseflag)
-    for (i = 0; i < nstates; i++)
-      print_state (i);
+  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);

 }
 }