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