Re: Extended Optimization using Peephole strategy

alcino@mundau.dcc.ufal.br (Alcino Dall Igna Junior)
10 Nov 1996 15:50:27 -0500

          From comp.compilers
Related articles
Extended Optimization using Peephole strategy bear@sonic.net (Ray S. Dillinger) (1996-11-05)
Re: Extended Optimization using Peephole strategy zs@munta.cs.mu.OZ.AU (1996-11-06)
Re: Extended Optimization using Peephole strategy alcino@mundau.dcc.ufal.br (1996-11-10)
Re: Extended Optimization using Peephole strategy jgm@CS.Cornell.EDU (Greg Morrisett) (1996-11-12)
| List of all articles for this month |
From: alcino@mundau.dcc.ufal.br (Alcino Dall Igna Junior)
Newsgroups: comp.compilers
Date: 10 Nov 1996 15:50:27 -0500
Organization: Compilers Central
References: 96-11-041
Keywords: optimize

> free" using a provably correct methodology. In particular, my
> compiler figured out for itself that it didn't need to allocate extra
> stack frames in the case of tail recursion -- which surprised me; I
> went to add a feature and found that it didn't change the generated
> code at all.


I'm not sure if the point is the same, but Brian Harvey
<bh@CS.Berkeley.EDU>, implement a tail recursion (in fact every
recursion that is the "last" command) in a way he called tail call in
ucblogo. I don't hear nothing about a paper in this subject, and I'm
interested in the implementation details (I'm starting a logo
implementation).


Regards,


Alcino.


--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.