src/closure.c

   1 /* Subroutines for bison
   2    Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
   3
   4    This file is part of Bison, the GNU Compiler Compiler.
   5
   6    Bison is free software; you can redistribute it and/or modify it
   7    under the terms of the GNU General Public License as published by
   8    the Free Software Foundation; either version 2, or (at your option)
   9    any later version.
  10
  11    Bison is distributed in the hope that it will be useful, but
  12    WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14    General Public License for more details.
  15
  16    You should have received a copy of the GNU General Public License
  17    along with Bison; see the file COPYING.  If not, write to the Free
  18    Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  19    02111-1307, USA.  */
  20
  21 #include "system.h"
  22 #include "getargs.h"
  23 #include "symtab.h"
  24 #include "gram.h"
  25 #include "reader.h"
  26 #include "closure.h"
  27 #include "derives.h"
  28 #include "bitset.h"
  29 #include "warshall.h"
  30
  31 /* NITEMSET is the size of the array ITEMSET.  */
  32 short *itemset;
  33 int nitemset;
  34
  35 static bitset ruleset;
  36
  37 /* internal data.  See comments before set_fderives and set_firsts.  */
  38 static bitset *fderives = NULL;
  39 static bitset *firsts = NULL;
  40
  41 /* Retrieve the FDERIVES/FIRSTS sets of the nonterminals numbered Var.  */
  42 #define FDERIVES(Var)   fderives[(Var) - ntokens]
  43 #define   FIRSTS(Var)   firsts[(Var) - ntokens]
  44 \f
  45
  46 /*-----------------.
  47 | Debugging code.  |
  48 `-----------------*/
  49
  50 static void
  51 print_closure (const char *title, short *array, size_t size)
  52 {
  53   size_t i;
  54   fprintf (stderr, "Closure: %s\n", title);
  55   for (i = 0; i < size; ++i)
  56     {
  57       short *rp;
  58       fprintf (stderr, "  %2d: .", array[i]);
  59       for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
  60         fprintf (stderr, " %s", symbols[*rp]->tag);
  61       fprintf (stderr, "  (rule %d)\n", -*rp - 1);
  62     }
  63   fputs ("\n\n", stderr);
  64 }
  65
  66
  67 static void
  68 print_firsts (void)
  69 {
  70   int i, j;
  71
  72   fprintf (stderr, "FIRSTS\n");
  73   for (i = ntokens; i < nsyms; i++)
  74     {
  75       fprintf (stderr, "\t%s firsts\n", symbols[i]->tag);
  76       for (j = 0; j < nvars; j++)
  77         if (bitset_test (FIRSTS (i), j))
  78           fprintf (stderr, "\t\t%d (%s)\n",
  79                    j + ntokens, symbols[j + ntokens]->tag);
  80     }
  81   fprintf (stderr, "\n\n");
  82 }
  83
  84
  85 static void
  86 print_fderives (void)
  87 {
  88   int i, j;
  89
  90   fprintf (stderr, "FDERIVES\n");
  91   for (i = ntokens; i < nsyms; i++)
  92     {
  93       fprintf (stderr, "\t%s derives\n", symbols[i]->tag);
  94       for (j = 0; j <= nrules; j++)
  95         if (bitset_test (FDERIVES (i), j))
  96           {
  97             short *rhsp;
  98             fprintf (stderr, "\t\t%d:", j - 1);
  99             for (rhsp = &ritem[rules[j].rhs]; *rhsp >= 0; ++rhsp)
 100               fprintf (stderr, " %s", symbols[*rhsp]->tag);
 101             fputc ('\n', stderr);
 102           }
 103     }
 104   fprintf (stderr, "\n\n");
 105 }
 106 \f
 107 /*------------------------------------------------------------------.
 108 | Set FIRSTS to be an NVARS array of NVARS bitsets indicating which |
 109 | items can represent the beginning of the input corresponding to   |
 110 | which other items.                                                |
 111 |                                                                   |
 112 | For example, if some rule expands symbol 5 into the sequence of   |
 113 | symbols 8 3 20, the symbol 8 can be the beginning of the data for |
 114 | symbol 5, so the bit [8 - ntokens] in first[5 - ntokens] (= FIRST |
 115 | (5)) is set.                                                      |
 116 `------------------------------------------------------------------*/
 117
 118 static void
 119 set_firsts (void)
 120 {
 121   int i, j;
 122
 123   firsts = XCALLOC (bitset, nvars);
 124   for (i = ntokens; i < nsyms; i++)
 125     {
 126       FIRSTS (i) = bitset_create (nvars, BITSET_FIXED);
 127       bitset_zero (FIRSTS (i));
 128       for (j = 0; derives[i][j] >= 0; ++j)
 129         {
 130           int symbol = ritem[rules[derives[i][j]].rhs];
 131           if (ISVAR (symbol))
 132             bitset_set (FIRSTS (i), symbol - ntokens);
 133         }
 134     }
 135
 136   RTC (firsts, nvars);
 137
 138   if (trace_flag)
 139     print_firsts ();
 140 }
 141
 142 /*-------------------------------------------------------------------.
 143 | Set FDERIVES to an NVARS by NRULES matrix of bits indicating which |
 144 | rules can help derive the beginning of the data for each           |
 145 | nonterminal.                                                       |
 146 |                                                                    |
 147 | For example, if symbol 5 can be derived as the sequence of symbols |
 148 | 8 3 20, and one of the rules for deriving symbol 8 is rule 4, then |
 149 | the [5 - NTOKENS, 4] bit in FDERIVES is set.                       |
 150 `-------------------------------------------------------------------*/
 151
 152 static void
 153 set_fderives (void)
 154 {
 155   int i, j, k;
 156
 157   fderives = XCALLOC (bitset, nvars);
 158   bitset_stats_init ();
 159   for (i = 0 ; i < nvars; ++i)
 160     {
 161       fderives[i] = bitset_create (nrules + 1, BITSET_FIXED);
 162       bitset_zero (fderives[i]);
 163     }
 164
 165   set_firsts ();
 166
 167   for (i = ntokens; i < nsyms; ++i)
 168     for (j = ntokens; j < nsyms; ++j)
 169       if (bitset_test (FIRSTS (i), j - ntokens))
 170         for (k = 0; derives[j][k] > 0; ++k)
 171           bitset_set (FDERIVES (i), derives[j][k]);
 172
 173   if (trace_flag)
 174     print_fderives ();
 175
 176   for (i = ntokens; i < nsyms; ++i)
 177     bitset_free (FIRSTS (i));
 178   XFREE (firsts);
 179 }
 180 \f
 181
 182 void
 183 new_closure (int n)
 184 {
 185   itemset = XCALLOC (short, n);
 186
 187   ruleset = bitset_create (nrules + 1, BITSET_FIXED);
 188   bitset_zero (ruleset);
 189
 190   set_fderives ();
 191 }
 192
 193
 194
 195 void
 196 closure (short *core, int n)
 197 {
 198   /* Index over CORE. */
 199   int c;
 200
 201   /* An index over RULESET. */
 202   int r;
 203
 204   /* A bit index over RULESET. */
 205   int ruleno;
 206
 207   if (trace_flag)
 208     print_closure ("input", core, n);
 209
 210   if (n == 0)
 211     {
 212       bitset_copy (ruleset, FDERIVES (start_symbol));
 213     }
 214   else
 215     {
 216       bitset_zero (ruleset);
 217
 218       for (c = 0; c < n; ++c)
 219         if (ISVAR (ritem[core[c]]))
 220           bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
 221     }
 222
 223   nitemset = 0;
 224   c = 0;
 225   for (ruleno = 0; ruleno < nrules + 1; ++ruleno)
 226     if (bitset_test (ruleset, ruleno))
 227       {
 228         int itemno = rules[ruleno].rhs;
 229         while (c < n && core[c] < itemno)
 230           {
 231             itemset[nitemset] = core[c];
 232             nitemset++;
 233             c++;
 234           }
 235         itemset[nitemset] = itemno;
 236         nitemset++;
 237       }
 238
 239   while (c < n)
 240     {
 241       itemset[nitemset] = core[c];
 242       nitemset++;
 243       c++;
 244     }
 245
 246   if (trace_flag)
 247     print_closure ("output", itemset, nitemset);
 248 }
 249
 250
 251 void
 252 free_closure (void)
 253 {
 254   int i;
 255   XFREE (itemset);
 256
 257   bitset_free (ruleset);
 258
 259   for (i = 0 ; i < nvars; ++i)
 260     bitset_free (fderives[i]);
 261   free (fderives);
 262 }