X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/2073d76939966ccfc00b29dc63d25b59741c0c93..c1d19e10c32844d17122b473840752003521d21b:/src/state.h?ds=inline diff --git a/src/state.h b/src/state.h index 1e49bb38..a2ae217f 100644 --- a/src/state.h +++ b/src/state.h @@ -1,7 +1,7 @@ /* Type definitions for nondeterministic finite state machine for Bison. - Copyright (C) 1984, 1989, 2000, 2001, 2002 Free Software - Foundation, Inc. + Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003, 2004 Free + Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -17,8 +17,8 @@ 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. */ + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ /* These type definitions are used to represent a nondeterministic @@ -94,8 +94,8 @@ | Numbering states. | `-------------------*/ -typedef short state_number; -# define STATE_NUMBER_MAXIMUM SHRT_MAX +typedef int state_number; +# define STATE_NUMBER_MAXIMUM INT_MAX /* Be ready to map a state_number to an int. */ static inline int @@ -113,7 +113,7 @@ typedef struct state state; typedef struct { - short num; + int num; state *states[1]; } transitions; @@ -160,9 +160,9 @@ typedef struct if (!TRANSITION_IS_DISABLED (Transitions, Iter)) -/* Return the state such SHIFTS contain a shift/goto to it on S. +/* Return the state such SHIFTS contain a shift/goto to it on SYM. Abort if none found. */ -struct state *transitions_to (transitions *shifts, symbol_number s); +struct state *transitions_to (transitions *shifts, symbol_number sym); /*-------. @@ -171,7 +171,7 @@ struct state *transitions_to (transitions *shifts, symbol_number s); typedef struct { - short num; + int num; symbol *symbols[1]; } errs; @@ -184,8 +184,8 @@ errs *errs_new (int num, symbol **tokens); typedef struct { - short num; - bitset *lookaheads; + int num; + bitset *lookahead_tokens; rule *rules[1]; } reductions; @@ -212,7 +212,7 @@ struct state /* Its items. Must be last, since ITEMS can be arbitrarily large. */ - unsigned short nitems; + size_t nitems; item_number items[1]; }; @@ -234,9 +234,9 @@ int state_reduction_find (state *s, rule *r); /* Set the errs of STATE. */ void state_errs_set (state *s, int num, symbol **errors); -/* Print on OUT all the lookaheads such that this STATE wants to +/* Print on OUT all the lookahead tokens such that this STATE wants to reduce R. */ -void state_rule_lookaheads_print (state *s, rule *r, FILE *out); +void state_rule_lookahead_tokens_print (state *s, rule *r, FILE *out); /* Create/destroy the states hash table. */ void state_hash_new (void);