Newsgroups: alt.cad.autocad,comp.cad.autocad,comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.mathworks.com!newsfeed.internetmci.com!torn!watserv3.uwaterloo.ca!news
From: "Carl Laurence Gonsalves" <clgonsal@undergrad.math.uwaterloo.ca>
Subject: AutoLISP and tail recursion??
Message-ID: <01bb97f0$43227ee0$16706181@xiaoxiao.uwaterloo.ca>
Sender: news@watserv3.uwaterloo.ca
Nntp-Posting-Host: cnts1p22.uwaterloo.ca
Organization: University of Waterloo
X-Newsreader: Microsoft Internet News 4.70.1155
Date: Sun, 1 Sep 1996 10:26:25 GMT
Lines: 14
Xref: glinda.oz.cs.cmu.edu comp.cad.autocad:42191 comp.lang.lisp:22472

I was wondering if AutoLISP does tail recursion elimination (like Scheme
does). I've got experience programming in Scheme, and recently I started
doing some programming in AutoLISP. My Scheme programming style uses a lot
of tail recursion... I'm wondering if in AutoLISP I should be using an
iterative style instead?

Thanks...

-- 
        Carl Laurence Gonsalves - clgonsal@undergrad.math.uwaterloo.ca
                   Computer Science, University of Waterloo
               http://www.undergrad.math.uwaterloo.ca/~clgonsal/
                   http://www.csclub.uwaterloo.ca/~clgonsal/

