doc: cite publication for LAC.

* doc/bison.texinfo (LAC): Here.
(cherry picked from commit 121c498280f96b31a1f90e2012751509e6358a64)

diff --git a/ChangeLog b/ChangeLog
index e1bfcc6684e936e3383d0d1eae0cc0545240ef0d..5c25fa28468fb67d648d5a103e79d5116c2ddda0 100644 (file)
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,8 @@
+2011-03-06  Joel E. Denny  <joeldenny@joeldenny.org>
+
+       doc: cite publication for LAC.
+       * doc/bison.texinfo (LAC): Here.
+

 2011-03-06  Joel E. Denny  <joeldenny@joeldenny.org>
 
        doc: clean up terminology for mysterious conflicts.
 2011-03-06  Joel E. Denny  <joeldenny@joeldenny.org>
 
        doc: clean up terminology for mysterious conflicts.

diff --git a/doc/bison.texinfo b/doc/bison.texinfo
index a965753a15492dbc7093528b8bd32524476c04b8..915c8111329ff06edfde84973c7da381ea0bd05d 100644 (file)
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -7562,6 +7562,11 @@ never physically copied.  In our experience, the performance penalty of LAC
 has proven insignificant for practical grammars.
 @end itemize
 
 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}.
+

 @node Unreachable States
 @subsection Unreachable States
 @findex %define lr.keep-unreachable-states
 @node Unreachable States
 @subsection Unreachable States
 @findex %define lr.keep-unreachable-states