Subject:
|
RE: Would-be hacker queries.
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Tue, 11 May 1999 21:41:31 GMT
|
Original-From:
|
John A. Tamplin <jat@liveonthenet.SPAMCAKEcom>
|
Viewed:
|
999 times
|
| |
|
|
On Tue, 11 May 1999, Todd Lehman wrote:
> Don't modern implementations of Lisp/Scheme/Logo automatically convert tail-
> recursion into iteration?
Yes, as do decent implementations of traditional compiled languages. For
example, GCC converts the following:
int f(int v) {
if(v<2) return v;
return f(v-1);
}
into
int f(int v) {
while(v>1) {
v--;
}
return v;
}
Not terribly useful, but illustrates what the compiler does. This
optimization has been present in GCC for as long as I have been using it,
and was widely discussed in compiler literature at least 12 years ago.
John A. Tamplin Traveller Information Services
jat@LiveOnTheNet.COM 2104 West Ferry Way
256/705-7007 - FAX 256/705-7100 Huntsville, AL 35801
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message is in Reply To:
21 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
Active threads in Robotics
|
|
|
|
|
|
