Re: eliminating GOTOs

whalley@fork.cs.fsu.edu (David Whalley)
Fri, 28 May 1993 11:07:53 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: whalley@fork.cs.fsu.edu (David Whalley)
Keywords: theory, design
Organization: Florida State University Computer Science Department
References: 93-05-135 93-05-139
Date: Fri, 28 May 1993 11:07:53 GMT

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


>David Whalley's (currently at florida state univ) master`s thesis (if I
>remember right) was about eliminating GOTOs from any program. (ofcourse,
>it will get too tedious at lower levels but should be good for high level
>source.


This is not quite right. The thesis was by Frank Mueller. I was his
advisor. We present an algorithm to eliminate unconditional jumps
from any function. This is done at an intermediate level (RTLs).
See "Avoiding Unconditional Jumps by Code Replication" in SIGPLAN PLD&I '92.


Dave Whalley
--

Post a followup to this message

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