src/gram.c

   1 /* Allocate input grammar variables for bison,
   2    Copyright 1984, 1986, 1989, 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
   7    it 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,
  12    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14    GNU 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
  18    the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19    Boston, MA 02111-1307, USA.  */
  20
  21
  22 #include "system.h"
  23 #include "gram.h"
  24 #include "reader.h"
  25
  26 /* comments for these variables are in gram.h  */
  27
  28 int nitems;
  29 int nrules;
  30 int nsyms;
  31 int ntokens;
  32 int nvars;
  33
  34 short *ritem = NULL;
  35 int nritems;
  36
  37 rule_t *rule_table = NULL;
  38 short *rprec = NULL;
  39 short *rprecsym = NULL;
  40 short *sprec = NULL;
  41 short *rassoc = NULL;
  42 short *sassoc = NULL;
  43 short *token_translations = NULL;
  44
  45 int start_symbol;
  46
  47 int max_user_token_number;
  48
  49 int semantic_parser;
  50
  51 int pure_parser;
  52
  53 int error_token_number;
  54
  55
  56 /*------------------------.
  57 | Dump RITEM for traces.  |
  58 `------------------------*/
  59
  60 void
  61 ritem_print (FILE *out)
  62 {
  63   int i;
  64   fputs ("RITEM\n", out);
  65   for (i = 0; i < nritems; ++i)
  66     if (ritem[i] >= 0)
  67       fprintf (out, "  %s", tags[ritem[i]]);
  68     else
  69       fprintf (out, "  (rule %d)\n", -ritem[i]);
  70   fputs ("\n\n", out);
  71 }
  72
  73
  74 /*------------------------------------------.
  75 | Return the size of the longest rule RHS.  |
  76 `------------------------------------------*/
  77
  78 size_t
  79 ritem_longest_rhs (void)
  80 {
  81   int length;
  82   int max;
  83   int i;
  84
  85   length = 0;
  86   max = 0;
  87   for (i = 0; i < nritems; ++i)
  88     if (ritem[i] >= 0)
  89       {
  90         length++;
  91       }
  92     else
  93       {
  94         if (length > max)
  95           max = length;
  96         length = 0;
  97       }
  98
  99   return max;
 100 }