doc: fix confusing citation of LAC publication.

Suggested by Akim Demaille.
* doc/bison.texinfo (LAC): Here.

diff --git a/ChangeLog b/ChangeLog
index bcbc9eaef7296359b7f80f0965b04662827ad380..53dfb150f88bfb0e5125ef70de787874d18a75bb 100644 (file)
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,9 @@
+2011-03-20  Joel E. Denny  <joeldenny@joeldenny.org>
+
+       doc: fix confusing citation of LAC publication.
+       Suggested by Akim Demaille.
+       * doc/bison.texinfo (LAC): Here.
+
 2011-03-20  Joel E. Denny  <joeldenny@joeldenny.org>
 
        lr.default-reductions: rename "full" value to "most".

diff --git a/doc/bison.texinfo b/doc/bison.texinfo
index 9e366da4d9bccf5d017851d80fa986715f9db864..8ecb5fb08debed6c93f2421b2f6764b2b111ade3 100644 (file)
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -7256,10 +7256,9 @@ never physically copied.  In our experience, the performance penalty of LAC
 has proven insignificant for practical grammars.
 @end itemize
 
-While the basic premise behind LAC has been recognized in the parser
-community for years, for the first publication that uses the term LAC and
-that discusses Bison's LAC implementation, @pxref{Bibliography,,Denny 2010
-May}.
+While the LAC algorithm shares techniques that have been recognized in the
+parser community for years, for the publication that introduces LAC,
+@pxref{Bibliography,,Denny 2010 May}.
 
 @node Unreachable States
 @subsection Unreachable States