X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/b09f4f48512c274a7574b6a22e4a1eac6a86fd61..728c4be2:/src/state.h diff --git a/src/state.h b/src/state.h index 28933e13..390ab8af 100644 --- a/src/state.h +++ b/src/state.h @@ -1,6 +1,6 @@ /* Type definitions for nondeterministic finite state machine for Bison. - Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003, 2004 Free + Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003, 2004, 2007 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -185,6 +185,7 @@ typedef struct { int num; bitset *lookahead_tokens; + /* Sorted ascendingly on rule number. */ rule *rules[1]; } reductions; @@ -202,15 +203,16 @@ struct state reductions *reductions; errs *errs; - /* Nonzero if no lookahead is needed to decide what to do in state S. */ + /* If non-zero, then no lookahead sets on reduce actions are needed to + decide what to do in state S. */ char consistent; /* If some conflicts were solved thanks to precedence/associativity, a human readable description of the resolution. */ const char *solved_conflicts; - /* Its items. Must be last, since ITEMS can be arbitrarily large. - */ + /* Its items. Must be last, since ITEMS can be arbitrarily large. Sorted + ascendingly on item index in RITEM, which is sorted on rule number. */ size_t nitems; item_number items[1]; }; @@ -248,9 +250,16 @@ state *state_hash_lookup (size_t core_size, item_number *core); /* Insert STATE in the state hash table. */ void state_hash_insert (state *s); +/* Remove unreachable states, renumber remaining states, update NSTATES, and + write to OLD_TO_NEW a mapping of old state numbers to new state numbers such + that the old value of NSTATES is written as the new state number for removed + states. The size of OLD_TO_NEW must be the old value of NSTATES. */ +void state_remove_unreachable_states (state_number old_to_new[]); + /* All the states, indexed by the state number. */ extern state **states; /* Free all the states. */ void states_free (void); + #endif /* !STATE_H_ */