Regen.

[bison.git] / src / lalr.h

diff --git a/src/lalr.h b/src/lalr.h
index 609310527230c4a35934bb6df2cc24b96d11f89b..3bece77cc0a8f315458d3bf907c16db60c1858e6 100644 (file)
--- a/src/lalr.h
+++ b/src/lalr.h
@@ -24,7 +24,7 @@
 #include "bitset.h"
 #include "bitsetv.h"
 
-/* Import the definition of CORE, SHIFTS and REDUCTIONS. */
+/* Import the definition of CORE, TRANSITIONS and REDUCTIONS. */
 # include "state.h"
 
 /* Import the definition of RULE_T. */
@@ -50,8 +50,8 @@ void lalr PARAMS ((void));
    TO_STATE of the first of them.  */
 
 extern short *goto_map;
-extern short *from_state;
-extern short *to_state;
+extern state_number_t *from_state;
+extern state_number_t *to_state;
 
 /* LARULE is a vector which records the rules that need lookahead in
    various states.  The elements of LARULE that apply to state S are
@@ -63,7 +63,7 @@ extern short *to_state;
 
 extern rule_t **LArule;
 
-/* LA is a lr by ntokens matrix of bits.  LA[l, i] is 1 if the rule
+/* 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.  */
@@ -71,7 +71,4 @@ extern rule_t **LArule;
 extern bitsetv LA;
 
 
-/* All the states, indexed by the state number.  */
-extern state_t **states;
-
 #endif /* !LALR_H_ */