Re: eliminating GOTOs

oz@ursa.sis.yorku.ca (Ozan S. Yigit)
Fri, 28 May 1993 16:47:39 GMT

          From comp.compilers
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)
| List of all articles for this month |
Newsgroups: comp.compilers
From: oz@ursa.sis.yorku.ca (Ozan S. Yigit)
Keywords: theory
Organization: York U. Student Information Systems Project
References: 93-05-135
Date: Fri, 28 May 1993 16:47:39 GMT

P.G.Hamer@bnr.co.uk (Peter Hamer) writes:


      Can anybody point me at algorithms for removing GOTOs from programs?


If I recall correctly, one of the earliest attempts was by someone
[Lorinda Cherry?] at Bell Labs, and the result was a program called
struct, that took goto-full fortran programs and produced ratfor.


I think either TOPLAS or JACM (around early 80s or late 70s) has an
article on struct that details its algorithms.


If you cannot locate it, send me e-mail, and I will dig the article up
from the library.


oz
--

Post a followup to this message

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