Lines Matching refs:Num
65 num rules. lookahead_tokens is an array of bitsets, one per rule.
113 int num;
119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
122 #define TRANSITION_SYMBOL(Transitions, Num) \
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
127 #define TRANSITION_IS_SHIFT(Transitions, Num) \
128 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
130 /* Is the TRANSITIONS->states[Num] a goto?. */
132 #define TRANSITION_IS_GOTO(Transitions, Num) \
133 (!TRANSITION_IS_SHIFT (Transitions, Num))
135 /* Is the TRANSITIONS->states[Num] labelled by the error token? */
137 #define TRANSITION_IS_ERROR(Transitions, Num) \
138 (TRANSITION_SYMBOL (Transitions, Num) == errtoken->number)
143 #define TRANSITION_DISABLE(Transitions, Num) \
144 (Transitions->states[Num] = NULL)
146 #define TRANSITION_IS_DISABLED(Transitions, Num) \
147 (Transitions->states[Num] == NULL)
153 Iter < Transitions->num \
171 int num;
175 errs *errs_new (int num, symbol **tokens);
184 int num;
235 void state_transitions_set (state *s, int num, state **trans);
238 void state_reductions_set (state *s, int num, rule **reds);
243 void state_errs_set (state *s, int num, symbol **errors);
