Regen.

[bison.git] / src / closure.c

diff --git a/src/closure.c b/src/closure.c
index bb45ba026cae20fe99ed42852bc383c00f28555b..d24e2eab73dc6574c434accd111a3b76a01cf438 100644 (file)
--- a/src/closure.c
+++ b/src/closure.c
@@ -20,15 +20,16 @@
 
 #include "system.h"
 #include "getargs.h"
 
 #include "system.h"
 #include "getargs.h"

+#include "symtab.h"

 #include "gram.h"
 #include "reader.h"
 #include "closure.h"
 #include "derives.h"
 #include "warshall.h"
 
 #include "gram.h"
 #include "reader.h"
 #include "closure.h"
 #include "derives.h"
 #include "warshall.h"
 

-/* ITEMSETSIZE is the size of the array ITEMSET.  */
+/* NITEMSET is the size of the array ITEMSET.  */

 short *itemset;
 short *itemset;

-int itemsetsize;
+int nitemset;

 
 static unsigned *ruleset;
 
 
 static unsigned *ruleset;
 


@@ -52,13 +53,19 @@ static int varsetsize;
 `-----------------*/
 
 static void
 `-----------------*/
 
 static void

-print_closure (int n)
+print_closure (const char *title, short *array, size_t size)

 {
 {

-  int i;
-  fprintf (stderr, "n = %d\n", n);
-  for (i = 0; i < itemsetsize; ++i)
-    fprintf (stderr, "   %d\n", itemset[i]);
-  fprintf (stderr, "\n\n");
+  size_t i;
+  fprintf (stderr, "Closure: %s\n", title);
+  for (i = 0; i < size; ++i)
+    {
+      short *rp;
+      fprintf (stderr, "  %2d: .", array[i]);
+      for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
+       fprintf (stderr, " %s", symbols[*rp]->tag);
+      fprintf (stderr, "  (rule %d)\n", -*rp - 1);
+    }
+  fputs ("\n\n", stderr);

 }
 
 
 }
 
 


@@ -70,10 +77,11 @@ print_firsts (void)
   fprintf (stderr, "FIRSTS\n");
   for (i = ntokens; i < nsyms; i++)
     {
   fprintf (stderr, "FIRSTS\n");
   for (i = ntokens; i < nsyms; i++)
     {

-      fprintf (stderr, "\t%s firsts\n", tags[i]);
+      fprintf (stderr, "\t%s firsts\n", symbols[i]->tag);

       for (j = 0; j < nvars; j++)
        if (BITISSET (FIRSTS (i), j))
       for (j = 0; j < nvars; j++)
        if (BITISSET (FIRSTS (i), j))

-         fprintf (stderr, "\t\t%d (%s)\n", j + ntokens, tags[j + ntokens]);
+         fprintf (stderr, "\t\t%d (%s)\n",
+                  j + ntokens, symbols[j + ntokens]->tag);

     }
   fprintf (stderr, "\n\n");
 }
     }
   fprintf (stderr, "\n\n");
 }


@@ -89,14 +97,14 @@ print_fderives (void)
 
   for (i = ntokens; i < nsyms; i++)
     {
 
   for (i = ntokens; i < nsyms; i++)
     {

-      fprintf (stderr, "\t%s derives\n", tags[i]);
+      fprintf (stderr, "\t%s derives\n", symbols[i]->tag);

       for (j = 0; j <= nrules; j++)
        if (BITISSET (FDERIVES (i), j))
          {
            short *rhsp;
       for (j = 0; j <= nrules; j++)
        if (BITISSET (FDERIVES (i), j))
          {
            short *rhsp;

-           fprintf (stderr, "\t\t%d:", j);
-           for (rhsp = ritem + rule_table[j].rhs; *rhsp > 0; ++rhsp)
-             fprintf (stderr, " %s", tags[*rhsp]);
+           fprintf (stderr, "\t\t%d:", j - 1);
+           for (rhsp = &ritem[rules[j].rhs]; *rhsp >= 0; ++rhsp)
+             fprintf (stderr, " %s", symbols[*rhsp]->tag);

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


@@ -125,7 +133,7 @@ set_firsts (void)
   for (i = ntokens; i < nsyms; i++)
     for (j = 0; derives[i][j] >= 0; ++j)
       {
   for (i = ntokens; i < nsyms; i++)
     for (j = 0; derives[i][j] >= 0; ++j)
       {

-       int symbol = ritem[rule_table[derives[i][j]].rhs];
+       int symbol = ritem[rules[derives[i][j]].rhs];

        if (ISVAR (symbol))
          SETBIT (FIRSTS (i), symbol - ntokens);
       }
        if (ISVAR (symbol))
          SETBIT (FIRSTS (i), symbol - ntokens);
       }


@@ -194,12 +202,7 @@ closure (short *core, int n)
   int ruleno;
 
   if (trace_flag)
   int ruleno;
 
   if (trace_flag)

-    {
-      fprintf (stderr, "Entering closure (items = {");
-      for (c = 0; c < n; ++c)
-       fprintf (stderr, " %d ", core[c]);
-      fprintf (stderr, "})\n");
-    }
+    print_closure ("input", core, n);

 
   if (n == 0)
     {
 
   if (n == 0)
     {


@@ -217,31 +220,31 @@ closure (short *core, int n)
            ruleset[r] |= FDERIVES (ritem[core[c]])[r];
     }
 
            ruleset[r] |= FDERIVES (ritem[core[c]])[r];
     }
 

-  itemsetsize = 0;
+  nitemset = 0;

   c = 0;
   c = 0;

-  for (ruleno = 0; ruleno < rulesetsize * BITS_PER_WORD; ++ruleno)
+  for (ruleno = 0; ruleno < nrules + 1; ++ruleno)

     if (BITISSET (ruleset, ruleno))
       {
     if (BITISSET (ruleset, ruleno))
       {

-       int itemno = rule_table[ruleno].rhs;
+       int itemno = rules[ruleno].rhs;

        while (c < n && core[c] < itemno)
          {
        while (c < n && core[c] < itemno)
          {

-           itemset[itemsetsize] = core[c];
-           itemsetsize++;
+           itemset[nitemset] = core[c];
+           nitemset++;

            c++;
          }
            c++;
          }

-       itemset[itemsetsize] = itemno;
-       itemsetsize++;
+       itemset[nitemset] = itemno;
+       nitemset++;

       }
 
   while (c < n)
     {
       }
 
   while (c < n)
     {

-      itemset[itemsetsize] = core[c];
-      itemsetsize++;
+      itemset[nitemset] = core[c];
+      nitemset++;

       c++;
     }
 
   if (trace_flag)
       c++;
     }
 
   if (trace_flag)

-    print_closure (n);
+    print_closure ("output", itemset, nitemset);

 }
 
 
 }