From: Carl Laurence Gonsalves
Subject: AutoLISP and tail recursion??
Date: Sun, 01 Sep 1996 00:00:00 +0000
Message-ID: <01bb97f0$43227ee0$16706181@xiaoxiao.uwaterloo.ca>

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 - ········@undergrad.math.uwaterloo.ca
                   Computer Science, University of Waterloo
               http://www.undergrad.math.uwaterloo.ca/~clgonsal/
                   http://www.csclub.uwaterloo.ca/~clgonsal/

From: Tony Tanzillo
Subject: Re: AutoLISP and tail recursion??
Date: Mon, 02 Sep 1996 00:00:00 +0000
Message-ID: <01bb987f$c43692c0$aa2d46c7@pentiumpro>

Carl - No AutoLISP is NOT properly tail-recursive, and you can easily
exhaust the stack with recursion.  There are some limited circumstances
where it is appropriate (mainly where you can be sure the depth of
recursion will not exhaust the stack), but for the most part, you should
use iterative constructs (like while, repeat, foreach, mapcar).

-- 
/*******************************************************/ 
/*   Tony Tanzillo     Design Automation Consulting    */
/*    Expert AutoCAD Programming and Customization     */
/* --------------------------------------------------- */
/*      Co-Author of Maximizing AutoCAD R13 and        */
/*        Maximizing AutoLISP for AutoCAD R13          */
/* --------------------------------------------------- */
/*       Contributing Author  CADENCE Magazine         */
/* --------------------------------------------------- */
/*             ··········@compuserve.com               */
/*           ·············@worldnet.att.net            */
/*   http://ourworld.compuserve.com/homepages/tonyt    */
/*******************************************************/


Carl Laurence Gonsalves <········@undergrad.math.uwaterloo.ca> wrote in
article <··························@xiaoxiao.uwaterloo.ca>...
> 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 - ········@undergrad.math.uwaterloo.ca
>                    Computer Science, University of Waterloo
>                http://www.undergrad.math.uwaterloo.ca/~clgonsal/
>                    http://www.csclub.uwaterloo.ca/~clgonsal/
> 
>