LISP : Practice Questions and Answers

The process of expressing an ordinary expression in terms of bits is called datum.

The unification matching procedure is a key element in a backward chaining.

None.

The two procedures available to filter lists are remove-if and remove-if-not.

Mapcar forms offer an alternative to the recursive transformation cliche.

The procedure mapcar uses is not restricted to be procedure of one parameter.

Mapcar primitive makes the data to transform lists.

Macro deserve their own file for compiling them.

Macros exploit the fact that lisp forms are just expressions meant to be evaluated.

Lisp forms can be constructed with the same primitives that generally manipulate lisp expressions.

The only difference between the appearance of macro and ordinary definition is that one uses defmacro and other uses defun.

Macros do not evaluate their arguments.

Defmacro can be used to define procedure called macro procedure.

Macro use their arguments to build intermediate forms and it evaluate the intermediate form to produce a value.

Cons builds new lists by depositing pointers in free boxes.

Boxes and pointers both can be represented in bytes. But lists and LISP can be represented in bytes.

Lisp maintains a list of spare boxes, linked by their right pointers for constructing new lists.

The box is called as atoms and two-pointer entities, in which the boxes can tie together.

A list in box and pointer notation is a string of boxes linked by arrow like pointers.

Template describes what should appear in the position occupied.