From: ··············@gmail.com
Subject: can anyone help me out??
Date: Wed, 21 Feb 2007 02:54:34 +0000
Message-ID: <1172026474.094397.197790@l53g2000cwa.googlegroups.com>

Can anyone help me out to write recursive LISP functions to reverse a
list within a list without using a built in function length..
eg:
(SREVERSE '(A B C))        returns  (C B A)
(SREVERSE '((A B) (C D)))  returns((D C) (B A))
(SREVERSE '(((A B C))))    returns(((C B A)))

From: ········@gmail.com
Subject: Re: can anyone help me out??
Date: Wed, 21 Feb 2007 03:44:48 +0000
Message-ID: <1172029488.176560.196050@a75g2000cwd.googlegroups.com>

On Feb 20, 6:54 pm, ··············@gmail.com wrote:
> Can anyone help me out to write recursive LISP functions to reverse a
> list within a list without using a built in function length..
> eg:
> (SREVERSE '(A B C))        returns  (C B A)
> (SREVERSE '((A B) (C D)))  returns((D C) (B A))
> (SREVERSE '(((A B C))))    returns(((C B A)))

(defun sreverse (l)
  (if (atom l)
      l
      (mapcar #'sreverse
	      (reverse l))))

do your own homework dude