X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/41d7a5f24d5e69bdf6ce10c012d50b89ce1e3957..a17c70f876111f81e2968acfef936b7127660acd:/src/state.h diff --git a/src/state.h b/src/state.h index 4afc1f00..37cd9bf9 100644 --- a/src/state.h +++ b/src/state.h @@ -1,7 +1,7 @@ -/* Type definitions for nondeterministic finite state machine for Bison. +/* Type definitions for the finite state machine for Bison. - Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003, 2004, 2007 Free - Software Foundation, Inc. + Copyright (C) 1984, 1989, 2000-2004, 2007, 2009-2013 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -119,41 +119,41 @@ typedef struct TRANSITIONS->states[Num]? Can be a token (amongst which the error token), or non terminals in case of gotos. */ -#define TRANSITION_SYMBOL(Transitions, Num) \ +# define TRANSITION_SYMBOL(Transitions, Num) \ (Transitions->states[Num]->accessing_symbol) /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */ -#define TRANSITION_IS_SHIFT(Transitions, Num) \ +# define TRANSITION_IS_SHIFT(Transitions, Num) \ (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num))) /* Is the TRANSITIONS->states[Num] a goto?. */ -#define TRANSITION_IS_GOTO(Transitions, Num) \ +# define TRANSITION_IS_GOTO(Transitions, Num) \ (!TRANSITION_IS_SHIFT (Transitions, Num)) /* Is the TRANSITIONS->states[Num] labelled by the error token? */ -#define TRANSITION_IS_ERROR(Transitions, Num) \ +# define TRANSITION_IS_ERROR(Transitions, Num) \ (TRANSITION_SYMBOL (Transitions, Num) == errtoken->number) /* When resolving a SR conflicts, if the reduction wins, the shift is disabled. */ -#define TRANSITION_DISABLE(Transitions, Num) \ +# define TRANSITION_DISABLE(Transitions, Num) \ (Transitions->states[Num] = NULL) -#define TRANSITION_IS_DISABLED(Transitions, Num) \ +# define TRANSITION_IS_DISABLED(Transitions, Num) \ (Transitions->states[Num] == NULL) /* Iterate over each transition over a token (shifts). */ -#define FOR_EACH_SHIFT(Transitions, Iter) \ - for (Iter = 0; \ - Iter < Transitions->num \ - && (TRANSITION_IS_DISABLED (Transitions, Iter) \ - || TRANSITION_IS_SHIFT (Transitions, Iter)); \ - ++Iter) \ +# define FOR_EACH_SHIFT(Transitions, Iter) \ + for (Iter = 0; \ + Iter < Transitions->num \ + && (TRANSITION_IS_DISABLED (Transitions, Iter) \ + || TRANSITION_IS_SHIFT (Transitions, Iter)); \ + ++Iter) \ if (!TRANSITION_IS_DISABLED (Transitions, Iter)) @@ -193,6 +193,8 @@ typedef struct | states. | `---------*/ +struct state_list; + struct state { state_number number; @@ -201,6 +203,11 @@ struct state reductions *reductions; errs *errs; + /* When an includer (such as ielr.c) needs to store states in a list, the + includer can define struct state_list as the list node structure and can + store in this member a reference to the node containing each state. */ + struct state_list *state_list; + /* If non-zero, then no lookahead sets on reduce actions are needed to decide what to do in state S. */ char consistent; @@ -221,7 +228,8 @@ extern state *final_state; /* Create a new state with ACCESSING_SYMBOL for those items. */ state *state_new (symbol_number accessing_symbol, - size_t core_size, item_number *core); + size_t core_size, item_number *core); +state *state_new_isocore (state const *s); /* Set the transitions of STATE. */ void state_transitions_set (state *s, int num, state **trans); @@ -238,7 +246,7 @@ void state_errs_set (state *s, int num, symbol **errors); reduce R. */ void state_rule_lookahead_tokens_print (state *s, rule *r, FILE *out); void state_rule_lookahead_tokens_print_xml (state *s, rule *r, - FILE *out, int level); + FILE *out, int level); /* Create/destroy the states hash table. */ void state_hash_new (void);