Get rid of broken %no-parser, -n, and --no-parser implementation and

[bison.git] / src / closure.c

diff --git a/src/closure.c b/src/closure.c
index 8652a22bf0584922ec23685ab4b0c81373fdeefe..a6cc784a49c837d100c6fa9e053d001804bdb9db 100644 (file)
--- a/src/closure.c
+++ b/src/closure.c
@@ -1,7 +1,7 @@
 /* Closures for Bison
 
-   Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004 Free Software
-   Foundation, Inc.
+   Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004, 2005, 2007 Free
+   Software Foundation, Inc.
 
    This file is part of Bison, the GNU Compiler Compiler.
 
@@ -20,6 +20,7 @@
    Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
    02110-1301, USA.  */
 
+#include <config.h>
 #include "system.h"
 
 #include <bitset.h>
@@ -36,7 +37,7 @@
 
 /* NITEMSET is the size of the array ITEMSET.  */
 item_number *itemset;
-size_t nritemset;
+size_t nitemset;
 
 static bitset ruleset;
 
@@ -75,7 +76,7 @@ print_firsts (void)
 {
   symbol_number i, j;
 
-  fputs ("FIRSTS\n", stderr);
+  fprintf (stderr, "FIRSTS\n");
   for (i = ntokens; i < nsyms; i++)
     {
       bitset_iterator iter;
@@ -86,7 +87,7 @@ print_firsts (void)
                   symbols[j + ntokens]->tag);
        }
     }
-  fputs ("\n\n", stderr);
+  fprintf (stderr, "\n\n");
 }
 
 
@@ -96,7 +97,7 @@ print_fderives (void)
   int i;
   rule_number r;
 
-  fputs ("FDERIVES\n", stderr);
+  fprintf (stderr, "FDERIVES\n");
   for (i = ntokens; i < nsyms; i++)
     {
       bitset_iterator iter;
@@ -107,7 +108,7 @@ print_fderives (void)
          rule_rhs_print (&rules[r], stderr);
        }
     }
-  fputs ("\n\n", stderr);
+  fprintf (stderr, "\n\n");
 }
 \f
 /*------------------------------------------------------------------.
@@ -212,30 +213,32 @@ closure (item_number *core, size_t n)
     if (ISVAR (ritem[core[c]]))
       bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
 
-  nritemset = 0;
+  /* core is sorted on item index in ritem, which is sorted on rule number.
+     Compute itemset with the same sort.  */
+  nitemset = 0;
   c = 0;
   BITSET_FOR_EACH (iter, ruleset, ruleno, 0)
     {
       item_number itemno = rules[ruleno].rhs - ritem;
       while (c < n && core[c] < itemno)
        {
-         itemset[nritemset] = core[c];
-         nritemset++;
+         itemset[nitemset] = core[c];
+         nitemset++;
          c++;
        }
-      itemset[nritemset] = itemno;
-      nritemset++;
+      itemset[nitemset] = itemno;
+      nitemset++;
     };
 
   while (c < n)
     {
-      itemset[nritemset] = core[c];
-      nritemset++;
+      itemset[nitemset] = core[c];
+      nitemset++;
       c++;
     }
 
   if (trace_flag & trace_sets)
-    print_closure ("output", itemset, nritemset);
+    print_closure ("output", itemset, nitemset);
 }