procyberian/emacs
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

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

Browse source
This commit is contained in:
Glenn Morris 2013-12-27 16:47:15 -08:00
parent ad15bd74e4
commit c04d52fbc9
2 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
doc/lispref/ChangeLog
View file

@ -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):

8
doc/lispref/control.texi
View file

@ -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