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

[bison.git] / src / closure.h

diff --git a/src/closure.h b/src/closure.h
index 8cc4feb2512c6d2ba5213cb19c45e83f30d55bf4..d152f9c6eaedd7bde2edb6f9d1760fedb655b9e1 100644 (file)
--- a/src/closure.h
+++ b/src/closure.h
@@ -1,6 +1,6 @@
 /* Subroutines for bison
 
 /* Subroutines for bison
 

-   Copyright (C) 1984, 1989, 2000, 2001, 2002 Free Software
+   Copyright (C) 1984, 1989, 2000, 2001, 2002, 2007 Free Software

    Foundation, Inc.
 
    This file is part of Bison, the GNU Compiler Compiler.
    Foundation, Inc.
 
    This file is part of Bison, the GNU Compiler Compiler.


@@ -17,8 +17,8 @@
 
    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
 
    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.  */
+   Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+   02110-1301, USA.  */

 
 #ifndef CLOSURE_H_
 # define CLOSURE_H_
 
 #ifndef CLOSURE_H_
 # define CLOSURE_H_


@@ -29,10 +29,10 @@
    data so that closure can be called.  n is the number of elements to
    allocate for itemset.  */
 
    data so that closure can be called.  n is the number of elements to
    allocate for itemset.  */
 

-void new_closure (int n);
+void new_closure (unsigned int n);

 
 
 
 

-/* Given the kernel (aka core) of a state (a vector of item numbers
+/* Given the kernel (aka core) of a state (a sorted vector of item numbers

    ITEMS, of length N), set up RULESET and ITEMSET to indicate what
    rules could be run and which items could be accepted when those
    items are the active ones.
    ITEMS, of length N), set up RULESET and ITEMSET to indicate what
    rules could be run and which items could be accepted when those
    items are the active ones.


@@ -41,12 +41,12 @@ void new_closure (int n);
    all rules which could potentially describe the next input to be
    read.
 
    all rules which could potentially describe the next input to be
    read.
 

-   ITEMSET is a vector of item numbers; NITEMSET is its size
+   ITEMSET is a sorted vector of item numbers; NITEMSET is its size

    (actually, points to just beyond the end of the part of it that is
    significant).  CLOSURE places there the indices of all items which
    represent units of input that could arrive next.  */
 
    (actually, points to just beyond the end of the part of it that is
    significant).  CLOSURE places there the indices of all items which
    represent units of input that could arrive next.  */
 

-void closure (item_number *items, int n);
+void closure (item_number *items, size_t n);

 
 
 /* Frees ITEMSET, RULESET and internal data.  */
 
 
 /* Frees ITEMSET, RULESET and internal data.  */


@@ -54,6 +54,6 @@ void closure (item_number *items, int n);
 void free_closure (void);
 
 extern item_number *itemset;
 void free_closure (void);
 
 extern item_number *itemset;

-extern int nritemset;
+extern size_t nitemset;

 
 #endif /* !CLOSURE_H_ */
 
 #endif /* !CLOSURE_H_ */