X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/dfdb1797c3a1e30a39b0967b9067097b1660ac61..0fe9720964da510a2b359af390a3053aace65f9f:/src/closure.c?ds=inline diff --git a/src/closure.c b/src/closure.c index 03222cac..4719c419 100644 --- a/src/closure.c +++ b/src/closure.c @@ -1,49 +1,50 @@ -/* Subroutines for bison - Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc. +/* Closures for Bison + + 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., 59 Temple Place - Suite 330, Boston, MA - 02111-1307, USA. */ + along with this program. If not, see . */ +#include #include "system.h" + +#include +#include +#include + +#include "closure.h" +#include "derives.h" #include "getargs.h" -#include "symtab.h" #include "gram.h" #include "reader.h" -#include "closure.h" -#include "derives.h" -#include "warshall.h" -#include "bitset.h" +#include "symtab.h" /* NITEMSET is the size of the array ITEMSET. */ -short *itemset; -int nitemset; +item_number *itemset; +size_t nitemset; static bitset ruleset; /* internal data. See comments before set_fderives and set_firsts. */ -static bitset *fderives; -static unsigned int *firsts; +static bitsetv fderives = NULL; +static bitsetv firsts = NULL; /* Retrieve the FDERIVES/FIRSTS sets of the nonterminals numbered Var. */ #define FDERIVES(Var) fderives[(Var) - ntokens] -#define FIRSTS(Var) (firsts + ((Var) - ntokens) * varsetsize) - -/* number of words required to hold a bit for each variable */ -static int varsetsize; +#define FIRSTS(Var) firsts[(Var) - ntokens] /*-----------------. @@ -51,16 +52,16 @@ static int varsetsize; `-----------------*/ static void -print_closure (const char *title, short *array, size_t size) +print_closure (char const *title, item_number *array, size_t size) { size_t i; fprintf (stderr, "Closure: %s\n", title); for (i = 0; i < size; ++i) { - short *rp; + item_number *rp; fprintf (stderr, " %2d: .", array[i]); for (rp = &ritem[array[i]]; *rp >= 0; ++rp) - fprintf (stderr, " %s", symbols[*rp]->tag); + fprintf (stderr, " %s", symbols[*rp]->tag); fprintf (stderr, " (rule %d)\n", -*rp - 1); } fputs ("\n\n", stderr); @@ -70,16 +71,15 @@ print_closure (const char *title, short *array, size_t size) static void print_firsts (void) { - int i, j; + symbol_number i, j; fprintf (stderr, "FIRSTS\n"); for (i = ntokens; i < nsyms; i++) { - fprintf (stderr, "\t%s firsts\n", symbols[i]->tag); - for (j = 0; j < nvars; j++) - if (BITISSET (FIRSTS (i), j)) - fprintf (stderr, "\t\t%d (%s)\n", - j + ntokens, symbols[j + ntokens]->tag); + bitset_iterator iter; + fprintf (stderr, " %s firsts\n", symbols[i]->tag); + BITSET_FOR_EACH (iter, FIRSTS (i), j, 0) + fprintf (stderr, " %s\n", symbols[j + ntokens]->tag); } fprintf (stderr, "\n\n"); } @@ -89,56 +89,56 @@ static void print_fderives (void) { int i; - int j; + rule_number r; fprintf (stderr, "FDERIVES\n"); - for (i = ntokens; i < nsyms; i++) { - fprintf (stderr, "\t%s derives\n", symbols[i]->tag); - for (j = 0; j <= nrules; j++) - if (bitset_test (FDERIVES (i), j)) - { - short *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); - } + bitset_iterator iter; + fprintf (stderr, " %s derives\n", symbols[i]->tag); + BITSET_FOR_EACH (iter, FDERIVES (i), r, 0) + { + fprintf (stderr, " %3d ", r); + rule_rhs_print (&rules[r], stderr); + fprintf (stderr, "\n"); + } } fprintf (stderr, "\n\n"); } -/*-------------------------------------------------------------------. -| Set FIRSTS to be an NVARS by NVARS bit matrix indicating which | -| items can represent the beginning of the input corresponding to | -| which other items. | -| | -| For example, if some rule expands symbol 5 into the sequence of | -| symbols 8 3 20, the symbol 8 can be the beginning of the data for | -| symbol 5, so the bit [8 - ntokens, 5 - ntokens] in firsts is set. | -`-------------------------------------------------------------------*/ +/*------------------------------------------------------------------. +| Set FIRSTS to be an NVARS array of NVARS bitsets indicating which | +| items can represent the beginning of the input corresponding to | +| which other items. | +| | +| For example, if some rule expands symbol 5 into the sequence of | +| symbols 8 3 20, the symbol 8 can be the beginning of the data for | +| symbol 5, so the bit [8 - ntokens] in first[5 - ntokens] (= FIRST | +| (5)) is set. | +`------------------------------------------------------------------*/ static void set_firsts (void) { - int i, j; - - varsetsize = WORDSIZE (nvars); + symbol_number i, j; - firsts = XCALLOC (unsigned, nvars * varsetsize); + firsts = bitsetv_create (nvars, nvars, BITSET_FIXED); for (i = ntokens; i < nsyms; i++) - for (j = 0; derives[i][j] >= 0; ++j) + for (j = 0; derives[i - ntokens][j]; ++j) { - int symbol = ritem[rules[derives[i][j]].rhs]; - if (ISVAR (symbol)) - SETBIT (FIRSTS (i), symbol - ntokens); + item_number sym = derives[i - ntokens][j]->rhs[0]; + if (ISVAR (sym)) + bitset_set (FIRSTS (i), sym - ntokens); } - RTC (firsts, nvars); + if (trace_flag & trace_sets) + bitsetv_matrix_dump (stderr, "RTC: Firsts Input", firsts); + bitsetv_reflexive_transitive_closure (firsts); + if (trace_flag & trace_sets) + bitsetv_matrix_dump (stderr, "RTC: Firsts Output", firsts); - if (trace_flag) + if (trace_flag & trace_sets) print_firsts (); } @@ -155,38 +155,33 @@ set_firsts (void) static void set_fderives (void) { - int i, j, k; + symbol_number i, j; + rule_number k; - fderives = XCALLOC (bitset, nvars); - bitset_stats_init (); - for (i = 0 ; i < nvars; ++i) - { - fderives[i] = bitset_create (nrules + 1, BITSET_FIXED); - bitset_zero (fderives[i]); - } + fderives = bitsetv_create (nvars, nrules, BITSET_FIXED); set_firsts (); for (i = ntokens; i < nsyms; ++i) for (j = ntokens; j < nsyms; ++j) - if (BITISSET (FIRSTS (i), j - ntokens)) - for (k = 0; derives[j][k] > 0; ++k) - bitset_set (FDERIVES (i), derives[j][k]); + if (bitset_test (FIRSTS (i), j - ntokens)) + for (k = 0; derives[j - ntokens][k]; ++k) + bitset_set (FDERIVES (i), derives[j - ntokens][k]->number); - if (trace_flag) + if (trace_flag & trace_sets) print_fderives (); - XFREE (firsts); + bitsetv_free (firsts); } + void -new_closure (int n) +new_closure (unsigned int n) { - itemset = XCALLOC (short, n); + itemset = xnmalloc (n, sizeof *itemset); - ruleset = bitset_create (nrules + 1, BITSET_FIXED); - bitset_zero (ruleset); + ruleset = bitset_create (nrules, BITSET_FIXED); set_fderives (); } @@ -194,48 +189,41 @@ new_closure (int n) void -closure (short *core, int n) +closure (item_number *core, size_t n) { /* Index over CORE. */ - int c; - - /* An index over RULESET. */ - int r; + size_t c; /* A bit index over RULESET. */ - int ruleno; + rule_number ruleno; + + bitset_iterator iter; - if (trace_flag) + if (trace_flag & trace_sets) print_closure ("input", core, n); - if (n == 0) - { - bitset_copy (ruleset, FDERIVES (start_symbol)); - } - else - { - bitset_zero (ruleset); + bitset_zero (ruleset); - for (c = 0; c < n; ++c) - if (ISVAR (ritem[core[c]])) - bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]])); - } + for (c = 0; c < n; ++c) + 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; - for (ruleno = 0; ruleno < nrules + 1; ++ruleno) - if (bitset_test (ruleset, ruleno)) - { - int itemno = rules[ruleno].rhs; - while (c < n && core[c] < itemno) - { - itemset[nitemset] = core[c]; - nitemset++; - c++; - } - itemset[nitemset] = itemno; - nitemset++; - } + BITSET_FOR_EACH (iter, ruleset, ruleno, 0) + { + item_number itemno = rules[ruleno].rhs - ritem; + while (c < n && core[c] < itemno) + { + itemset[nitemset] = core[c]; + nitemset++; + c++; + } + itemset[nitemset] = itemno; + nitemset++; + }; while (c < n) { @@ -244,7 +232,7 @@ closure (short *core, int n) c++; } - if (trace_flag) + if (trace_flag & trace_sets) print_closure ("output", itemset, nitemset); } @@ -252,12 +240,7 @@ closure (short *core, int n) void free_closure (void) { - int i; - XFREE (itemset); - + free (itemset); bitset_free (ruleset); - - for (i = 0 ; i < nvars; ++i) - bitset_free (fderives[i]); - free (fderives); + bitsetv_free (fderives); }