LispForum

So this problem is designed to step through one list and at each atom check if it exists in the other. This problem is asking you to make two recursive tasks, one based on L and one on L2. I suggest you start with L as it defines your order. L's function: If null, return nil else If L2 contains car ...

A simple way is to first step through the list for the first element. If found return the new list from that point. Next search the new sublist for the second element. (defun verify (lst a b) (labels ((is-found (lst x) (cond ((null lst) nil) ((equal x (car lst)) lst) (t (is-found (cdr lst) x))))) (l...

I'm new to Lisp, still trying to grasp the full usage of macros so bare with me if I'm doing this wrong. I want to create a class (lets call it foo) that has a method that allows you to create a method using a passed in name, and object to manipulate contained in the instance of the class. For examp...