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: | mitchell@mdd.comm.mot.com (Bill Mitchell) |
Keywords: | theory, bibliography |
Organization: | Motorola, Mobile Data Division - Seattle, WA |
References: | 93-05-135 |
Date: | Sat, 29 May 1993 14:25:35 GMT |
P.G.Hamer@bnr.co.uk (Peter Hamer) said:
>Can anybody point me at algorithms for removing GOTOs from programs?
The following might help:
"Flow Diagrams, Turing Machines and Languages with Only Two Formation
Rules.", C. Bohm and G. Jacopini, Communications of the ACM, Vol 9, No. 5
(May 1966)
"The Translation of 'go to' Programs to 'while' Programs.", E. Ashcroft
and Z. Manna, Proceedings of the 1971 IFIP conference, Vol I (Amsterdam,
The Netherlands, North-Holland Publishing Co., 1972)
Both papers reprinted in "Classics in Software Engineering", Yourdon Press
(1979)
--
mitchell@mdd.comm.mot.com (Bill Mitchell)
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.