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 item_number_t *ritem = NULL;
  31 int nritems = 0;
  32
  33 rule_t *rules = NULL;
  34 int nrules = 0;
  35
  36 symbol_t **symbols = NULL;
  37 int nsyms = 0;
  38 int ntokens = 1;
  39 int nvars = 0;
  40
  41 token_number_t *token_translations = NULL;
  42
  43 token_number_t start_symbol = 0;
  44
  45 int max_user_token_number = 256;
  46
  47 int semantic_parser = 0;
  48
  49 int pure_parser = 0;
  50
  51
  52 /*--------------------------------------.
  53 | Return the number of symbols in RHS.  |
  54 `--------------------------------------*/
  55
  56 int
  57 rule_rhs_length (rule_t *rule)
  58 {
  59   int res = 0;
  60   item_number_t *rhsp;
  61   for (rhsp = rule->rhs; *rhsp >= 0; ++rhsp)
  62     ++res;
  63   return res;
  64 }
  65
  66
  67 /*------------------------.
  68 | Dump RITEM for traces.  |
  69 `------------------------*/
  70
  71 void
  72 ritem_print (FILE *out)
  73 {
  74   int i;
  75   fputs ("RITEM\n", out);
  76   for (i = 0; i < nritems; ++i)
  77     if (ritem[i] >= 0)
  78       fprintf (out, "  %s", quotearg_style (escape_quoting_style,
  79                                             symbols[ritem[i]]->tag));
  80     else
  81       fprintf (out, "  (rule %d)\n", -ritem[i] - 1);
  82   fputs ("\n\n", out);
  83 }
  84
  85
  86 /*------------------------------------------.
  87 | Return the size of the longest rule RHS.  |
  88 `------------------------------------------*/
  89
  90 size_t
  91 ritem_longest_rhs (void)
  92 {
  93   int max = 0;
  94   int i;
  95
  96   for (i = 1; i < nrules + 1; ++i)
  97     {
  98       int length = rule_rhs_length (&rules[i]);
  99       if (length > max)
 100         max = length;
 101     }
 102
 103   return max;
 104 }