Related articles |
---|
eliminating GOTOs P.G.Hamer@bnr.co.uk (1993-05-27) |
Re: eliminating GOTOs nandu@cs.clemson.edu (1993-05-27) |
Re: eliminating GOTOs preston@dawn.cs.rice.edu (1993-05-27) |
Re: eliminating GOTOs whalley@fork.cs.fsu.edu (1993-05-28) |
Re: eliminating GOTOs oz@ursa.sis.yorku.ca (1993-05-28) |
Re: eliminating GOTOs furukawa@is.s.u-tokyo.ac.jp (1993-05-28) |
Re: eliminating GOTOs mitchell@mdd.comm.mot.com (1993-05-29) |
Re: eliminating GOTOs cifuente@fitmail.fit.qut.edu.au (Ms Cristina Cifuentes) (1993-06-01) |
Newsgroups: | comp.compilers |
From: | preston@dawn.cs.rice.edu (Preston Briggs) |
Keywords: | theory, bibliography |
Organization: | Rice University, Houston |
References: | 93-05-135 |
Date: | Thu, 27 May 1993 19:22:27 GMT |
P.G.Hamer@bnr.co.uk (Peter Hamer) writes:
>Can anybody point me at algorithms for removing GOTOs from programs?
See if you can get hold of the paper
title="Structural Analysis: A New Approach to
Flow Analysis in Optimizing Compilers",
author="Micha Sharir",
journal="Computer Languages",
volume=5,
year=1980,
pages="141--153"
It's a form of interval analysis for use in optimization.
However, you ought to be able to adapt it to your purposes.
Preston Briggs
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.