X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/c49a8e71cec845d32366432b824a9317e4a80160..0e78e603f696b4b820231b56fdb21c2a173e6bd3:/src/gram.c diff --git a/src/gram.c b/src/gram.c index 05dc665c..ffab36d3 100644 --- a/src/gram.c +++ b/src/gram.c @@ -1,24 +1,29 @@ /* Allocate input grammar variables for bison, - Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc. + Copyright 1984, 1986, 1989, 2001 Free Software Foundation, Inc. -This file is part of Bison, the GNU Compiler Compiler. + This file is part of Bison, the GNU Compiler Compiler. -Bison is free software; you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2, or (at your option) -any later version. + Bison is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. -Bison is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. + Bison is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. -You should have received a copy of the GNU General Public License -along with Bison; see the file COPYING. If not, write to -the Free Software Foundation, Inc., 59 Temple Place - Suite 330, -Boston, MA 02111-1307, USA. */ + You should have received a copy of the GNU General Public License + along with Bison; see the file COPYING. If not, write to + the Free Software Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. */ +#include "system.h" +#include "gram.h" +#include "symtab.h" +#include "reader.h" + /* comments for these variables are in gram.h */ int nitems; @@ -27,20 +32,20 @@ int nsyms; int ntokens; int nvars; -short *ritem; -short *rlhs; -short *rrhs; -short *rprec; -short *rprecsym; -short *sprec; -short *rassoc; -short *sassoc; -short *token_translations; -short *rline; +short *ritem = NULL; +int nritems; -int start_symbol; +rule_t *rule_table = NULL; +short *rprec = NULL; +short *rprecsym = NULL; -int translations; +struct bucket **symbols = NULL; +short *sprec = NULL; +short *rassoc = NULL; +short *sassoc = NULL; +short *token_translations = NULL; + +int start_symbol; int max_user_token_number; @@ -50,10 +55,49 @@ int pure_parser; int error_token_number; -/* This is to avoid linker problems which occur on VMS when using GCC, - when the file in question contains data definitions only. */ -static void -dummy (void) +/*------------------------. +| Dump RITEM for traces. | +`------------------------*/ + +void +ritem_print (FILE *out) +{ + int i; + fputs ("RITEM\n", out); + for (i = 0; i < nritems; ++i) + if (ritem[i] >= 0) + fprintf (out, " %s", tags[ritem[i]]); + else + fprintf (out, " (rule %d)\n", -ritem[i] - 1); + fputs ("\n\n", out); +} + + +/*------------------------------------------. +| Return the size of the longest rule RHS. | +`------------------------------------------*/ + +size_t +ritem_longest_rhs (void) { + int length; + int max; + int i; + + length = 0; + max = 0; + for (i = 0; i < nritems; ++i) + if (ritem[i] >= 0) + { + length++; + } + else + { + if (length > max) + max = length; + length = 0; + } + + return max; }