doc: fix confusing citation of LAC publication.

Suggested by Akim Demaille.
* doc/bison.texinfo (LAC): Here.
(cherry picked from commit 56706c6167f1cbfde3f48ea63ce6eaa56369f971)

diff --git a/ChangeLog b/ChangeLog
index c27f2f6b4c1acd32c4e8aad03df9e9c1c6fed351..12def4defc059e8b4d1bffed612e35a7ad7954ba 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 5ad3e6678273c69b17522f7f8949dae22c5ce613..3fc29d45d9afb36ee1002f23f84763ff7d67089e 100644 (file)
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -7562,10 +7562,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