X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/2cec70b9f139dd207022c35fdbe8b49fd1cf230d..b408954b40e74d85ee90544ea7e296dbc99356c9:/src/state.h diff --git a/src/state.h b/src/state.h index 14017afe..95b716d8 100644 --- a/src/state.h +++ b/src/state.h @@ -41,10 +41,10 @@ the last thing accepted to reach that state. It is the accessing_symbol of the core. - Each core contains a vector of nitems items which are the indices + Each core contains a vector of NITEMS items which are the indices in the ritems vector of the items that are selected in this state. - The link field is used for chaining buckets that hash states by + The link field is used for chaining symbols that hash states by their itemsets. This is for recognizing equivalent states and combining them when the states are generated. @@ -107,7 +107,7 @@ shifts *shifts_new PARAMS ((int n)); case of gotos. */ #define SHIFT_SYMBOL(Shifts, Shift) \ - (state_table[Shifts->shifts[Shift]]->accessing_symbol) + (states[Shifts->shifts[Shift]]->accessing_symbol) /* Is the SHIFTS->shifts[Shift] a real shift? (as opposed to gotos.) */ @@ -122,7 +122,7 @@ shifts *shifts_new PARAMS ((int n)); /* Is the SHIFTS->shifts[Shift] then handling of the error token?. */ #define SHIFT_IS_ERROR(Shifts, Shift) \ - (SHIFT_SYMBOL (Shifts, Shift) == error_token_number) + (SHIFT_SYMBOL (Shifts, Shift) == errtoken->number) /* When resolving a SR conflicts, if the reduction wins, the shift is disabled. */ @@ -158,10 +158,7 @@ typedef struct reductions short rules[1]; } reductions; -#define REDUCTIONS_ALLOC(Nreductions) \ - (reductions *) xcalloc ((unsigned) (sizeof (reductions) \ - + (Nreductions - 1) * sizeof (short)), 1) - +reductions *reductions_new PARAMS ((int n)); /*----------. @@ -174,7 +171,7 @@ typedef struct state_s struct state_s *link; short number; - short accessing_symbol; + symbol_number_t accessing_symbol; shifts *shifts; reductions *reductions; errs *errs; @@ -187,13 +184,18 @@ typedef struct state_s short lookaheadsp; int nlookaheads; - /* Its items. */ - short nitems; - short items[1]; + /* 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. + */ + unsigned short nitems; + item_number_t items[1]; } state_t; #define STATE_ALLOC(Nitems) \ (state_t *) xcalloc ((unsigned) (sizeof (state_t) \ - + (Nitems - 1) * sizeof (short)), 1) + + (Nitems - 1) * sizeof (item_number_t)), 1) #endif /* !STATE_H_ */