doc: cite publication for LAC.

* doc/bison.texinfo (LAC): Here.

diff --git a/ChangeLog b/ChangeLog
index 361d2252bdb9f26d23863a15d0b4f29d14e160fb..69efad5b39fa62c916037db40b95d3cd96378d51 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.

diff --git a/doc/bison.texinfo b/doc/bison.texinfo
index a1889ec2f5ccde37bb4555a6a04e7cab21f327aa..ab6486a8fc5586a964bad4f2b34386fbd67fe136 100644 (file)
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -7256,6 +7256,11 @@ 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}.
+
 @node Unreachable States
 @subsection Unreachable States
 @findex %define lr.keep-unreachable-states