* data/bison.c++: Merge the two generated headers. Insert a copyright

[bison.git] / src / lalr.h

diff --git a/src/lalr.h b/src/lalr.h
index 8f031cdad4b39d64057119b57052ae207afc357f..77a5d9df7d4a461c1fb1e824cd3ebb8f2d84490e 100644 (file)
--- a/src/lalr.h
+++ b/src/lalr.h
@@ -49,12 +49,6 @@ extern short *goto_map;
 extern short *from_state;
 extern short *to_state;
 
 extern short *from_state;
 extern short *to_state;
 

-/* 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
 /* 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


@@ -72,15 +66,12 @@ extern short *LAruleno;
    it is a conflict.  */
 
 extern unsigned *LA;
    it is a conflict.  */
 
 extern unsigned *LA;

+#define LA(Rule) (LA + (Rule) * tokensetsize)

 
 
 
 

-extern int tokensetsize;
-extern short *lookaheads;
-extern short *accessing_symbol;
-extern core **state_table;
-extern shifts **shift_table;
-extern reductions **reduction_table;
-
+/* All the states, indexed by the state number.  */
+extern state_t **states;

 
 

+extern int tokensetsize;

 
 #endif /* !LALR_H_ */
 
 #endif /* !LALR_H_ */