Реверс произвольного списка, включая подсписки (XLisp)

(defun ddin (h n)
 (cond
  ((null n) nil)
 ((> h 0) (ddin (- h 1) (reverse n)))
  ( (not(atom (car n))) ( cons (ddin (+ h 1) (car n)) (ddin h (cdr n))) )
  (t (cons (car n) (ddin h (cdr n))))
  )
)
(defun din (n)
  (ddin 1 n)
)

(defun deep-reverse (w &optional acс &aux (a (car w)))
  (if w
      (deep-reverse (cdr w)
                    (push (if (atom a) a (deep-reverse a)) acс))
      acс))
 
> (deep-reverse '(1 (((2 3) 4) 5) (6 (7)))) 
(((7) 6) (5 (4 (3 2))) 1)

(defun deep-reverse (w &optional acc)
  (if w
      (deep-reverse (cdr w)
                    (cons (if (atom (car w))
                              (car w)
                              (deep-reverse (car w)))
                          acc))
      acc))
 
> (deep-reverse '(1 (((2 3) 4) 5) (6 (7)))) 
(((7) 6) (5 (4 (3 2))) 1)

(defun deep-reverse (w &aux ac)
  (loop for a in w do
        (if (atom a)
            (setf ac (cons a ac))
            (setf ac (cons (deep-reverse a) ac)))
            finally (return ac)))
 
> (deep-reverse '(0 1 (((2 3) 4) 5) 7 (8 (9 10) 11)))
((11 (10 9) 8) 7 (5 (4 (3 2))) 1 0)

(defun rev-list (lst &aux r)
  (dolist (i lst r)
    (push (if (atom i) i (rev-list i)) r)))
 
==> rev-list
 
(rev-list '(1 2 3 4))
 
==> (4 3 2 1)
 
(rev-list '(1 (2 3) 4))
 
==> (4 (3 2) 1)

(defun deep-reverse (w &aux ac)
  (loop for a in w do
        (setf ac (cons (if (atom a) a (deep-reverse a)) ac))
        finally (return ac)))
 
> (deep-reverse '(0 1 (((2 3) 4) 5) 7 (8 (9 10) 11)))
((11 (10 9) 8) 7 (5 (4 (3 2))) 1 0)

(defun tree-reverse (tree)
  (mapcar '(lambda (x) (if (atom x) x (tree-reverse x))) (reverse tree)))