X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/07f68b1168d0df044bbd9cf53e27cffe07a5f31a..f74b6f91f65436df4ddf87a810cfd9e5672c5fcd:/REFERENCES diff --git a/REFERENCES b/REFERENCES index b02eb18c..075d9b9a 100644 --- a/REFERENCES +++ b/REFERENCES @@ -19,12 +19,15 @@ kludges that Johnson had to perpetrate to make Yacc fit in a PDP-11. 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. -(See "Efficient Construction of LALR(1) Lookahead Sets" by F. DeRemer -and A. Pennello, in ACM TOPLS Vol 4 No 4, October 1982. Their +85/251), and more modern technique for generating the look-ahead sets. +(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.) paul rubin free software foundation +[DeRemer-Pennello reference corrected by Paul Eggert , + 2004-06-21.]