The rule for IF
is pretty easy: evaluate the first expression. If it evaluates to non-NIL
, then evaluate the next expression and return its value. Otherwise, return the value of evaluating the third expression or NIL
if the third expression is omitted. In other words, the basic form of an IF
expression is as follows:
(if
The
An even simpler special operator is QUOTE
, which takes a single expression as its 'argument' and simply returns it, unevaluated. For instance, the following evaluates to the list (+ 1 2)
, not the value 3:
(quote (+ 1 2))
There's nothing special about this list; you can manipulate it just like any list you could create with the LIST
function.[49]
QUOTE
is used commonly enough that a special syntax for it is built into the reader. Instead of writing the following:
(quote (+ 1 2))
you can write this:
'(+ 1 2)
This syntax is a small extension of the s-expression syntax understood by the reader. From the point of view of the evaluator, both those expressions will look the same: a list whose first element is the symbol QUOTE
and whose second element is the list (+ 1 2)
.[50]
In general, the special operators implement features of the language that require some special processing by the evaluator. For instance, several special operators manipulate the environment in which other forms will be evaluated. One of these, which I'll discuss in detail in Chapter 6, is LET
, which is used to create new variable bindings. The following form evaluates to 10 because the second x
is evaluated in an environment where it's the name of a variable established by the LET
with the value 10:
(let ((x 10)) x)
While special operators extend the syntax of Common Lisp beyond what can be expressed with just function calls, the set of special operators is fixed by the language standard. Macros, on the other hand, give users of the language a way to extend its syntax. As you saw in Chapter 3, a macro is a function that takes s-expressions as arguments and returns a Lisp form that's then evaluated in place of the macro form. The evaluation of a macro form proceeds in two phases: First, the elements of the macro form are passed, unevaluated, to the macro function. Second, the form returned by the macro function—called its
It's important to keep the two phases of evaluating a macro form clear in your mind. It's easy to lose track when you're typing expressions at the REPL because the two phases happen one after another and the value of the second phase is immediately returned. But when Lisp code is compiled, the two phases happen at completely different times, so it's important to keep clear what's happening when. For instance, when you compile a whole file of source code with the function COMPILE-FILE
, all the macro forms in the file are recursively expanded until the code consists of nothing but function call forms and special forms. This macroless code is then compiled into a FASL file that the LOAD
function knows how to load. The compiled code, however, isn't executed until the file is loaded. Because macros generate their expansion at compile time, they can do relatively large amounts of work generating their expansion without having to pay for it when the file is loaded or the functions defined in the file are called.
Since the evaluator doesn't evaluate the elements of the macro form before passing them to the macro function, they don't need to be well-formed Lisp forms. Each macro assigns a meaning to the s-expressions in the macro form by virtue of how it uses them to generate its expansion. In other words, each macro defines its own local syntax. For instance, the backwards
macro from Chapter 3 defines a syntax in which an expression is a legal backwards
form if it's a list that's the reverse of a legal Lisp form.
I'll talk quite a bit more about macros throughout this book. For now the important thing for you to realize is that macros—while syntactically similar to function calls—serve quite a different purpose, providing a hook into the compiler.[51]
Two last bits of basic knowledge you need to get under your belt are Common Lisp's notion of truth and falsehood and what it means for two Lisp objects to be 'equal.' Truth and falsehood are—in this realm— straightforward: the symbol NIL
is the only false value, and everything else is true. The symbol T
is the canonical true value and can be used when you need to return a non-NIL
value and don't have anything else handy. The only tricky thing about NIL
is that it's the only object that's both an atom and a list: in addition to falsehood, it's also used to represent the empty list.[52] This equivalence between NIL
and the empty list is built into the reader: if the reader sees ()
, it reads it as the symbol NIL
. They're completely interchangeable. And because NIL
, as I mentioned previously, is the name of a constant variable with the symbol NIL
as its value, the expressions nil
, ()
, 'nil
, and '()
all evaluate to the same thing—the unquoted forms are evaluated as a reference to the constant variable whose value is the symbol NIL
, but in the quoted forms the QUOTE
special operator evaluates to the symbol directly. For the same reason, both t
and 't
will evaluate to the same thing: the symbol T
.
Using phrases such as 'the same thing' of course begs the question of what it means for two values to be 'the same.' As you'll see in future chapters, Common Lisp provides a number of type-specific equality predicates: =
is used to compare numbers, CHAR=
to compare characters, and so on. In this section I'll discuss the four 'generic' equality predicates—functions that can be passed any two Lisp objects and will return true if they're equivalent and false otherwise. They are, in order of discrimination, EQ
, EQL
, EQUAL
, and EQUALP
.
EQ
tests for 'object identity'—two objects are EQ
if they're identical. Unfortunately, the object identity of numbers and characters depends on how those data types are implemented in a particular Lisp. Thus, EQ
may consider two numbers or two characters with the same value to be equivalent, or it may not. Implementations have enough leeway that the expression (eq 3 3)
can legally evaluate to either true or false. More to the point, (eq x x)
can evaluate to either true or false if the value of x
happens to be a number or character.
Thus, you should never use EQ
to compare values that may be numbers or characters. It may seem to work in a predictable way for certain values in a particular implementation, but you have no guarantee that it will work the same way if you switch implementations. And switching implementations