Do not document subr-x.el in the manuals

[gnu-emacs] / doc / lispref / control.texi

diff --git a/doc/lispref/control.texi b/doc/lispref/control.texi
index f5cdd3dc80feddedee89e1aca272d4ce2b79f736..0d6aaff81c5619f53c1d44711293f32d21aec2be 100644 (file)
--- a/doc/lispref/control.texi
+++ b/doc/lispref/control.texi
@@ -1,6 +1,6 @@
 @c -*-texinfo-*-
 @c This is part of the GNU Emacs Lisp Reference Manual.
-@c Copyright (C) 1990-1995, 1998-1999, 2001-2013 Free Software
+@c Copyright (C) 1990-1995, 1998-1999, 2001-2014 Free Software
 @c Foundation, Inc.
 @c See the file elisp.texi for copying conditions.
 @node Control Structures
@@ -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