From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.3 required=5.0 tests=BAYES_00,INVALID_MSGID,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3e08c98d7ce85399
X-Google-Attributes: gid103376,public
From: Ted Dennison <dennison@telepath.com>
Subject: Re: Eight Queens problem (was Re: Kindness)
Date: 1999/09/08
Message-ID: <7r5qr5$fpf$1@nnrp1.deja.com>#1/1
X-Deja-AN: 522518815
References: <37CC6844.AB898EEE@rational.com> <37CE93CD.799A225A@pwfl.com>
 <37CF0FE0.2B299477@acenet.com.au> <37CFF7DC.CFF9717C@pwfl.com>
 <1999Sep3.125818.1@eisner> <37D02CC0.BEF1BC69@mitre.org>
 <walke751-0409992215490001@ts001d42.nor-ct.concentric.net>
 <rt872lon8os47@corp.supernews.com> <7r1c4c$9an$1@nnrp1.deja.com>
 <7r2fc6$1sc$1@nnrp1.deja.com> <7r4edb$gg2$1@nnrp1.deja.com>
 <7r50tj$sp3$1@nnrp1.deja.com> <7r5mjn$c72$1@nnrp1.deja.com>
X-Http-Proxy: 1.0 x36.deja.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja.com - Share what you know. Learn what you don't.
X-Article-Creation-Date: Wed Sep 08 14:12:00 1999 GMT
X-MyDeja-Info: XMYDJUIDtedennison
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.6 [en] (WinNT; I)
Date: 1999-09-08T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <7r5mjn$c72$1@nnrp1.deja.com>,
  Robert Dewar <robert_dewar@my-deja.com> wrote:
> if the compiler does NOT do pretty clever tail recursion
> elimination. I would not expect ANY Ada compiler to be that
> clever, and in fact, it would not surprise me to find that
> many Ada compilers do no tail recursion elimination at all.

FYI: The GreenHills Ada 95 compiler does have an option for tail
recursion elimination. The description implies it won't try to transform
a routine into tail-recursive form, though.

When last I checked ObjectAda did not perform this optimization.

--
T.E.D.


Sent via Deja.com http://www.deja.com/
Share what you know. Learn what you don't.