X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/8dd162d3ff10fd7fb6f748a885f8055232691c48..026816664ff8283a55f91915843a8ff0ac5cf86c:/REFERENCES diff --git a/REFERENCES b/REFERENCES index 075d9b9a..9af36731 100644 --- 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. -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. @@ -19,14 +19,14 @@ 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 look-ahead sets. +85/251), and more modern technique for generating the lookahead 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 + paul rubin + free software foundation [DeRemer-Pennello reference corrected by Paul Eggert ,