(BITSET_FOR_EACH, BITSET_FOR_EACH_REVERSE):

[bison.git] / src / lalr.h

diff --git a/src/lalr.h b/src/lalr.h
index c0abb2c7217031a8efd46167681cb7ae49d01650..7912a089d46b19316daf98609b2262104c514d26 100644 (file)
--- a/src/lalr.h
+++ b/src/lalr.h
@@ -1,5 +1,5 @@
 /* Compute look-ahead criteria for bison,
-   Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc.
+   Copyright (C) 1984, 1986, 1989, 2000, 2002 Free Software Foundation, Inc.
 
    This file is part of Bison, the GNU Compiler Compiler.
 
@@ -21,65 +21,45 @@
 #ifndef LALR_H_
 # define LALR_H_
 
+# include <bitset.h>
+# include <bitsetv.h>
 
-/* Import the definition of CORE, SHIFTS and REDUCTIONS. */
-# include "state.h"
+/* Import the definition of RULE_T. */
+# include "gram.h"
 
+/* Import the definition of CORE, TRANSITIONS and REDUCTIONS. */
+# include "state.h"
 
 /* Compute how to make the finite state machine deterministic; find
    which rules need lookahead in each state, and which lookahead
    tokens they accept.  */
 
-void lalr PARAMS ((void));
-
-
-/* lalr() builds these data structures. */
-
-/* goto_map, from_state and to_state --record each shift transition
-   which accepts a variable (a nonterminal).
+void lalr (void);
 
-   from_state[t] is the state number which a transition leads from and
-   to_state[t] is the state number it leads to.  All the transitions
-   that accept a particular variable are grouped together and
-   goto_map[i - ntokens] is the index in from_state and to_state of
-   the first of them.  */
+/* Release the information related to lookaheads.  Can be performed
+   once the action tables are computed.  */
 
-extern short *goto_map;
-extern short *from_state;
-extern short *to_state;
+void lalr_free (void);
 
-/* CONSISTENT[S] is nonzero if no lookahead is needed to decide what
-   to do in state S.  */
 
-extern char *consistent;
-
-
-/* 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;
+/* lalr() builds these data structures. */
 
-/* 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.  */
+/* GOTO_MAP, FROM_STATE and TO_STATE -- record each shift transition
+   which accepts a variable (a nonterminal).
 
-extern unsigned *LA;
+   FROM_STATE[T] -- state number which a transition leads from.
+   TO_STATE[T] -- state number it leads to.
 
+   All the transitions that accept a particular variable are grouped
+   together and GOTO_MAP[I - NTOKENS] is the index in FROM_STATE and
+   TO_STATE of the first of them.  */
 
-extern int tokensetsize;
-extern short *lookaheads;
-extern short *accessing_symbol;
-extern core **state_table;
-extern shifts **shift_table;
-extern reductions **reduction_table;
+typedef short goto_number;
+# define GOTO_NUMBER_MAXIMUM SHRT_MAX
 
+extern goto_number *goto_map;
+extern state_number *from_state;
+extern state_number *to_state;
 
 
 #endif /* !LALR_H_ */