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 *rules = NULL;
  39
  40 struct bucket **symbols = NULL;
  41 short *token_translations = NULL;
  42
  43 int start_symbol;
  44
  45 int max_user_token_number;
  46
  47 int semantic_parser;
  48
  49 int pure_parser;
  50
  51 int error_token_number;
  52
  53
  54 /*------------------------.
  55 | Dump RITEM for traces.  |
  56 `------------------------*/
  57
  58 void
  59 ritem_print (FILE *out)
  60 {
  61   int i;
  62   fputs ("RITEM\n", out);
  63   for (i = 0; i < nritems; ++i)
  64     if (ritem[i] >= 0)
  65       fprintf (out, "  %s", symbols[ritem[i]]->tag);
  66     else
  67       fprintf (out, "  (rule %d)\n", -ritem[i] - 1);
  68   fputs ("\n\n", out);
  69 }
  70
  71
  72 /*------------------------------------------.
  73 | Return the size of the longest rule RHS.  |
  74 `------------------------------------------*/
  75
  76 size_t
  77 ritem_longest_rhs (void)
  78 {
  79   int length;
  80   int max;
  81   int i;
  82
  83   length = 0;
  84   max = 0;
  85   for (i = 0; i < nritems; ++i)
  86     if (ritem[i] >= 0)
  87       {
  88         length++;
  89       }
  90     else
  91       {
  92         if (length > max)
  93           max = length;
  94         length = 0;
  95       }
  96
  97   return max;
  98 }