src/gram.c

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