mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 20:33:03 +00:00
62a3e4f0c5
RITEM. Note that it must be able to code symbol numbers as positive number, and the negation of rule numbers as negative numbers. Adjust all dependencies (pretty many). * src/reduce.c (rule): Remove this `short *' pointer: use item_number_t. * src/system.h (MINSHORT, MAXSHORT): Remove. Include `limits.h'. Adjust dependencies to using SHRT_MAX and SHRT_MIN. (shortcpy): Remove. (MAXTABLE): Move to... * src/output.c (MAXTABLE): here. (prepare_rules): Use output_int_table to output rhs. * data/bison.simple, data/bison.c++: Adjust. * tests/torture.at (Big triangle): Move the limit from 254 to 500. * tests/regression.at (Web2c Actions): Ajust. Trying with bigger grammars shows various phenomena: at 3000 (28Mb of grammar file) bison is killed by my system, at 2000 (12Mb) bison passes, but produces negative #line number, once fixed, GCC is killed while compiling 14Mb, at 1500 (6.7 Mb of grammar, 8.2Mb of C), it passes. * src/state.h (state_h): Code input lines on ints, not shorts.
84 lines
2.2 KiB
C
84 lines
2.2 KiB
C
/* Type definitions for nondeterministic finite state machine for bison,
|
|
Copyright (C) 2001, 2002 Free Software Foundation, Inc.
|
|
|
|
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 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. */
|
|
|
|
|
|
#include "system.h"
|
|
#include "gram.h"
|
|
#include "state.h"
|
|
|
|
/*---------------------------------.
|
|
| Create a new array of N shitfs. |
|
|
`---------------------------------*/
|
|
|
|
#define SHIFTS_ALLOC(Nshifts) \
|
|
(shifts *) xcalloc ((unsigned) (sizeof (shifts) \
|
|
+ (Nshifts - 1) * sizeof (short)), 1)
|
|
|
|
shifts *
|
|
shifts_new (int n)
|
|
{
|
|
shifts *res = SHIFTS_ALLOC (n);
|
|
res->nshifts = n;
|
|
return res;
|
|
}
|
|
|
|
|
|
/*-------------------------------.
|
|
| Create a new array of N errs. |
|
|
`-------------------------------*/
|
|
|
|
#define ERRS_ALLOC(Nerrs) \
|
|
(errs *) xcalloc ((unsigned) (sizeof (errs) \
|
|
+ (Nerrs - 1) * sizeof (short)), 1)
|
|
|
|
|
|
errs *
|
|
errs_new (int n)
|
|
{
|
|
errs *res = ERRS_ALLOC (n);
|
|
res->nerrs = n;
|
|
return res;
|
|
}
|
|
|
|
|
|
errs *
|
|
errs_dup (errs *src)
|
|
{
|
|
errs *res = errs_new (src->nerrs);
|
|
memcpy (res->errs, src->errs, src->nerrs * sizeof (src->errs[0]));
|
|
return res;
|
|
}
|
|
|
|
/*-------------------------------------.
|
|
| Create a new array of N reductions. |
|
|
`-------------------------------------*/
|
|
|
|
#define REDUCTIONS_ALLOC(Nreductions) \
|
|
(reductions *) xcalloc ((unsigned) (sizeof (reductions) \
|
|
+ (Nreductions - 1) * sizeof (short)), 1)
|
|
|
|
reductions *
|
|
reductions_new (int n)
|
|
{
|
|
reductions *res = REDUCTIONS_ALLOC (n);
|
|
res->nreds = n;
|
|
return res;
|
|
}
|