removing the old "look-ahead" spelling.
Update previous look-ahead/lookahead change reports.
* REFERENCES: look-ahead -> lookahead (since that's
what he actually wrote).
* doc/refcard.tex: look ahead -> lookahead,
look-ahead -> lookahead
+2006-06-11 Paul Eggert <eggert@cs.ucla.edu>
+
+ * NEWS: Reword the post-2.3 change to not be so optimistic about
+ removing the old "look-ahead" spelling.
+ Update previous look-ahead/lookahead change reports.
+ * REFERENCES: look-ahead -> lookahead (since that's
+ what he actually wrote).
+ * doc/refcard.tex: look ahead -> lookahead,
+ look-ahead -> lookahead
+
2006-06-09 Joel E. Denny <jdenny@ces.clemson.edu>
For consistency, use `lookahead' instead of `look-ahead' or
Changes in version 2.3+:
* The option `--report=look-ahead' has been changed to `--report=lookahead'.
- The old spelling still works but is not documented and will be removed.
+ The old spelling still works, but is not documented and may be removed
+ in a future release.
Changes in version 2.3, 2006-06-05:
This is a GNU extension.
- The option `--report=lookahead' was changed to `--report=look-ahead'.
- The old spelling still works, but is not documented and will be
- removed.
+ [However, this was changed back after 2.3.]
- Experimental %destructor support has been added to lalr1.cc.
produces additional information:
- itemset
complete the core item sets with their closure
- - lookahead [changed to `look-ahead' in 1.875e and later]
- explicitly associate look-ahead tokens to items
+ - lookahead [changed to `look-ahead' in 1.875e through 2.3, but changed back]
+ explicitly associate lookahead tokens to items
- solved
describe shift/reduce conflicts solving.
Bison used to systematically output this information on top of
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
\section {Variables and Types}
%*****************************
-\key{Current look ahead token.} {yychar}
+\key{Current lookahead token.} {yychar}
\key{Debug mode flag.} {yydebug}
\key{Data associated with the current token.} {yylval}
\key{Source position of current token.} {yylloc}
\key{Quit parsing immediately. Return 1.} {YYABORT}
\key{Quit parsing immediately. Return 0.} {YYACCEPT}
\key{Pretend a syntax error occurred.} {YYERROR}
-\key{Value in {\tt yychar} if no look-ahead token.} {YYEMPTY}
-\key{Clear previous look ahead token.} {yyclearin}
+\key{Value in {\tt yychar} if no lookahead token.} {YYEMPTY}
+\key{Clear previous lookahead token.} {yyclearin}
\key{Recover normally from an error.} {yyerrok}
% **************