-extern short *goto_map;
-extern short *from_state;
-extern short *to_state;
-
-/* LARULENO is a vector which records the rules that need lookahead in
- various states. The elements of LARULENO that apply to state S are
- those from LOOKAHEADS[S] through LOOKAHEADS[S+1]-1. Each element
- of LARULENO is a rule number.
-
- If LR is the length of LAruleno, then a number from 0 to LR-1 can
- specify both a rule and a state where the rule might be applied.
- */
-
-extern short *LAruleno;
-
-/* LA is a lr by ntokens matrix of bits. LA[l, i] is 1 if the rule
- LAruleno[l] is applicable in the appropriate state when the next
- token is symbol i. If LA[l, i] and LA[l, j] are both 1 for i != j,
- it is a conflict. */
-
-extern unsigned *LA;
-#define LA(Rule) (LA + (Rule) * tokensetsize)
-
-
-/* A structure decorating a state, with additional information. */
-typedef struct state_s
-{
- /* A state. */
- core *state;
-
- /* Its accessing symbol. */
- short accessing_symbol;
-
- shifts *shifts;
- reductions *reductions;
- errs *errs;
-
- /* Nonzero if no lookahead is needed to decide what to do in state
- S. */
- char consistent;
-
- short lookaheads;
-} state_t;