bison: pacify Sun C 5.12

[bison.git] / REFERENCES

diff --git a/REFERENCES b/REFERENCES
index b02eb18c52a425422ee9c0ebe8e2b3fd4a0525a3..9af367312cef358cc5517a1e52b72d00ada7d7f6 100644 (file)
--- a/REFERENCES
+++ b/REFERENCES
@@ -9,7 +9,7 @@ Bison supports the @N construction, which gives you access to
 the starting and ending line number and character number associated
 with any of the symbols in the current rule.
 
 the starting and ending line number and character number associated
 with any of the symbols in the current rule.
 

-Also, Bison supports the command `%expect N' which says not to mention
+Also, Bison supports the command '%expect N' which says not to mention

 the conflicts if there are N shift/reduce conflicts and no reduce/reduce
 conflicts.
 
 the conflicts if there are N shift/reduce conflicts and no reduce/reduce
 conflicts.
 


@@ -20,11 +20,14 @@ Also, Bison uses a faster but less space-efficient encoding for the
 parse tables (see Corbett's PhD thesis from Berkeley, "Static
 Semantics in Compiler Error Recovery", June 1985, Report No. UCB/CSD
 85/251), and more modern technique for generating the lookahead sets.
 parse tables (see Corbett's PhD thesis from Berkeley, "Static
 Semantics in Compiler Error Recovery", June 1985, Report No. UCB/CSD
 85/251), and more modern technique for generating the lookahead sets.

-(See "Efficient Construction of LALR(1) Lookahead Sets" by F. DeRemer
-and A. Pennello, in ACM TOPLS Vol 4 No 4, October 1982.  Their
+(See Frank DeRemer and Thomas Pennello, "Efficient Computation of
+LALR(1) Look-Ahead Sets", ACM Transactions on Programming Languages
+and Systems (TOPLAS) 4, 4 (October 1982), 615-649.  Their

 technique is the standard one now.)
 
 technique is the standard one now.)
 

-       paul rubin
-       free software foundation
+        paul rubin
+        free software foundation

 
 
 
 

+[DeRemer-Pennello reference corrected by Paul Eggert <eggert@cs.ucla.edu>,
+ 2004-06-21.]