* doc/lispref/control.texi (Pattern matching case statement): Brevity.

2 files changed, 6 insertions, 6 deletions

diff --git a/doc/lispref/ChangeLog b/doc/lispref/ChangeLog
index c4fdfb18a9b..b86ab722764 100644
--- a/doc/lispref/ChangeLog
+++ b/doc/lispref/ChangeLog
@@ -1,3 +1,7 @@
+2013-12-28  Glenn Morris  <rgm@gnu.org>
+
+        * control.texi (Pattern matching case statement): Brevity.
+
 2013-12-27  Chong Yidong  <cyd@gnu.org>
 
         * functions.texi (Function Cells):
diff --git a/doc/lispref/control.texi b/doc/lispref/control.texi
index f5cdd3dc80f..5bd2d7acdbe 100644
--- a/doc/lispref/control.texi
+++ b/doc/lispref/control.texi
@@ -322,7 +322,8 @@ In the last clause, @code{code} is a variable that gets bound to the value that
 was returned by @code{(get-return-code x)}.
 
 To give a more complex example, a simple interpreter for a little
-expression language could look like:
+expression language could look like (note that this example requires
+lexical-binding):
 
 @example
 (defun evaluate (exp env)
@@ -342,11 +343,6 @@ third elements and binds them to the variables @code{x} and @code{y}.
 @code{(pred numberp)} is a pattern that simply checks that @code{exp}
 is a number, and @code{_} is the catch-all pattern that matches anything.
 
-Note that the the lambda being the result of the @code{fn} clause is a
-closure (@pxref{Closures}), so the file defining @code{evaluate} must
-have lexical binding enabled (@pxref{Using Lexical Binding}, for how
-to enable it).
-
 Here are some sample programs including their evaluation results:
 
 @example