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 "symtab.h"
  25 #include "reader.h"
  26
  27 /* comments for these variables are in gram.h  */
  28
  29 int nitems;
  30 int nrules;
  31 int nsyms;
  32 int ntokens;
  33 int nvars;
  34
  35 short *ritem = NULL;
  36 int nritems;
  37
  38 rule_t *rule_table = NULL;
  39 short *rprec = NULL;
  40 short *rprecsym = NULL;
  41
  42 struct bucket **symbols = NULL;
  43 short *sprec = NULL;
  44 short *rassoc = NULL;
  45 short *sassoc = NULL;
  46 short *token_translations = NULL;
  47
  48 int start_symbol;
  49
  50 int max_user_token_number;
  51
  52 int semantic_parser;
  53
  54 int pure_parser;
  55
  56 int error_token_number;
  57
  58
  59 /*------------------------.
  60 | Dump RITEM for traces.  |
  61 `------------------------*/
  62
  63 void
  64 ritem_print (FILE *out)
  65 {
  66   int i;
  67   fputs ("RITEM\n", out);
  68   for (i = 0; i < nritems; ++i)
  69     if (ritem[i] >= 0)
  70       fprintf (out, "  %s", tags[ritem[i]]);
  71     else
  72       fprintf (out, "  (rule %d)\n", -ritem[i] - 1);
  73   fputs ("\n\n", out);
  74 }
  75
  76
  77 /*------------------------------------------.
  78 | Return the size of the longest rule RHS.  |
  79 `------------------------------------------*/
  80
  81 size_t
  82 ritem_longest_rhs (void)
  83 {
  84   int length;
  85   int max;
  86   int i;
  87
  88   length = 0;
  89   max = 0;
  90   for (i = 0; i < nritems; ++i)
  91     if (ritem[i] >= 0)
  92       {
  93         length++;
  94       }
  95     else
  96       {
  97         if (length > max)
  98           max = length;
  99         length = 0;
 100       }
 101
 102   return max;
 103 }