Re: eliminating GOTOs

furukawa@is.s.u-tokyo.ac.jp (FURUKAWA Hiroshi)
Fri, 28 May 1993 19:22:57 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: furukawa@is.s.u-tokyo.ac.jp (FURUKAWA Hiroshi)
Keywords: theory
Organization: Department of Information Science, The University of Tokyo.
References: 93-05-135
Date: Fri, 28 May 1993 19:22:57 GMT

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


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


I guess the paper will help you.


    author = "Zahira Ammarguellat",
    title = "A Control-Flow Normalization Algorithm and Its Complexity",
    journal = "IEEE Trans. Softw. Eng.",
    year = "1992",
    volume = "18",
    number = "3",
    pages = "237-251"


The algorithm in the paper can normalize any flow graphs and requires
code copying when the graphs are irreducible.
--
furukawa@is.s.u-tokyo.ac.jp
--

Post a followup to this message

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