X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/b09f4f48512c274a7574b6a22e4a1eac6a86fd61..d0d3313d10a28aa6fe77f158d61b84424aa9b3ce:/src/closure.c?ds=inline diff --git a/src/closure.c b/src/closure.c index a12e9622..d9bc5ffa 100644 --- a/src/closure.c +++ b/src/closure.c @@ -1,24 +1,22 @@ /* Closures for Bison - Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004, 2005 Free + Copyright (C) 1984, 1989, 2000-2002, 2004-2005, 2007, 2009-2012 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. - Bison is free software; you can redistribute it and/or modify it - under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - Bison is distributed in the hope that it will be useful, but - WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - General Public License for more details. + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. 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., 51 Franklin Street, Fifth Floor, Boston, MA - 02110-1301, USA. */ + along with this program. If not, see . */ #include #include "system.h" @@ -26,7 +24,6 @@ #include #include #include -#include #include "closure.h" #include "derives.h" @@ -213,6 +210,8 @@ closure (item_number *core, size_t n) if (ISVAR (ritem[core[c]])) bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]])); + /* 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)