Функция должна возвращать список, содержащий элементы исходного списка, перечисленные в обратном порядке

(defun rev-all (lst &optional (r nil))
  (cond ((null lst) r)
        ((atom (car lst)) (rev-all (cdr lst) (cons (car lst) r)))
        (t (rev-all (cdr lst) (cons (rev-all (car lst)) r)))))
 
==> REV-ALL
 
(rev-all '(1 2 (3 4) 5 6))
 
==> (6 5 (4 3) 2 1)
 
(rev-all '(a (b c (d)) e))
 
==> (E ((D) C B) A)

(defun deep-reverse (w) 
  (loop for a in (reverse w)
        collect (if (atom a) a (deep-reverse a))))
 
> (deep-reverse '(a (b c (1 d 2)) e))
(E ((2 D 1) C B) A)
> (deep-reverse '(e ((2 d 1) c b) a))                       
(A (B C (1 D 2)) E)

(defun deep-reverse (w &optional ac &aux (a (car w)) (d (cdr w))) 
  (cond ((null w) ac)
        ((atom a) (deep-reverse d (cons a ac)))
        ((deep-reverse d (cons (deep-reverse a) ac)))))
 
> (deep-reverse '(a (b c (1 d 2)) e))
(E ((2 D 1) C B) A)
> (deep-reverse '(e ((2 d 1) c b) a))
(A (B C (1 D 2)) E)

(defun deep-reverse (w &optional ac &aux (a (car w)) (d (cdr w))) 
  (if w (deep-reverse d (cons (if (atom a) a (deep-reverse a)) ac)) ac))
 
> (deep-reverse '(a (b c (1 d 2)) e))
(E ((2 D 1) C B) A)
> (deep-reverse '(e ((2 d 1) c b) a))
(A (B C (1 D 2)) E)

(defun deep-reverse (w &optional ac &aux (a (car w))) 
  (if w (deep-reverse (cdr w)
                      (cons (if (atom a) a
                                (deep-reverse a))
                            ac))
      ac))
 
> (deep-reverse '(a (b c (1 d 2)) e))
(E ((2 D 1) C B) A)
> (deep-reverse '(e ((2 d 1) c b) a))
(A (B C (1 D 2)) E)

(defun deep-reverse (w) 
  (mapcar #'(lambda (a) (if (atom a) a
                            (deep-reverse a)))
          (reverse w)))
 
> (deep-reverse '(a (b c (1 d 2)) e))
(E ((2 D 1) C B) A)
> (deep-reverse '(e ((2 d 1) c b) a))
(A (B C (1 D 2)) E)