|eliminating GOTOs P.G.Hamer@bnr.co.uk (1993-05-27)|
|Re: eliminating GOTOs firstname.lastname@example.org (1993-05-27)|
|Re: eliminating GOTOs email@example.com (1993-05-27)|
|Re: eliminating GOTOs firstname.lastname@example.org (1993-05-28)|
|Re: eliminating GOTOs email@example.com (1993-05-28)|
|Re: eliminating GOTOs firstname.lastname@example.org (1993-05-28)|
|Re: eliminating GOTOs email@example.com (1993-05-29)|
|Re: eliminating GOTOs firstname.lastname@example.org (Ms Cristina Cifuentes) (1993-06-01)|
|From:||email@example.com (David Whalley)|
|Organization:||Florida State University Computer Science Department|
|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
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.
Return to the
Search the comp.compilers archives again.