Re: eliminating GOTOs

oz@ursa.sis.yorku.ca writes:
> 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.


The author is Brenda Baker (1977, Bell Labs) (see attached bibliography for
complete reference).


The following is my bibliography on articles related to graph structuring.
Most algorithms attempt to remove all GOTOs, but there are limitations.


@ARTICLE{Coop67,
    author = "D.C.Cooper",
    title = "Bohm and Jacopini's Reduction of Flow Charts",
    journal = "Communications of the ACM",
    year = 1967,
    volume = 10,
    number = 8,
    month = aug,
    pages = "463,473",
    notes = "Letter to the editor"
}


@ARTICLE{Amma92,
    author = "Z.Ammarguellat",
    title = "A Control-Flow Normalization Algorithm and Its Complexity",
    journal = "IEEE Transactions on Software Engineering",
    year = 1992,
    volume = 18,
    number = 3,
    pages = "237-251",
    month = mar
}


@ARTICLE{Will83,
    author = "M.H.Williams",
    title = "Flowchart Schemata and the Problem of Nomenclature",
    journal = "The computer journal",
    year = 1983,
    volume = 26,
    number = 3,
    pages = "270-276"
}


@ARTICLE{Will78,
    author = "M.H.Williams and H.L.Ossher",
    title = "Conversion of unstructured flow diagrams to structured form",
    journal = "The Computer Journal",
    year = 1978,
    volume = 21,
    number = 2,
    pages = "161-167"
}


@ARTICLE{Will77,
    author = "M.H.Williams",
    title = "Generating structured flow diagrams: the nature of
     unstructuredness",
    journal = "The Computer Journal",
    year = 1977,
    volume = 20,
    number = 1,
    pages = "45-50"
}


@ARTICLE{Dijk68,
    author = "E.W.Dijkstra",
    title = "Go To Statement Considered Harmful",
    journal = "Communications of the ACM",
    year = 1968,
    volume = 11,
    number = 3,
    pages = "147-148",
    month = mar,
    note = "Letter to the editor"
}


@ARTICLE{Bohm66,
    author = "C.Bohm and G.Jacopini",
    title = "Flow Diagrams, Turing Machines and Languages with only two
     formation rules",
    journal = "Communications of the ACM",
    year = 1966,
    volume = 9,
    number = 5,
    pages = "366-371",
    month = may
}


@ARTICLE{Knut74,
    author = "D.E.Knuth",
    title = "Structured Programming with go to Statements",
    journal = "Computing Surveys",
    year = 1974,
    volume = 6,
    number = 4,
    pages = "261-301",
    month = dec
}


@ARTICLE{Knut71,
    author = "D.E.Knuth and R.W.Floyd",
    title = "Notes on avoiding go to Statements",
    journal = "Information Processing Letters",
    year = 1971,
    volume = 1,
    number = 1,
    pages = "23-31",
}


@ARTICLE{Will85,
    author = "M.H.Williams and G.Chen",
    title = "Restructuring Pascal Programs Containing Goto Statements",
    journal = "The Computer Journal",
    year = 1985,
    volume = 28,
    number = 2,
    pages = "134-137",
}


@ARTICLE{Rams88,
    author = "L.Ramshaw",
    title = "Eliminating go to's while preserving program structure",
    journal = "Journal of the ACM",
    year = 1988,
    volume = 35,
    number = 4,
    pages = "893-920",
    month = oct
}


@ARTICLE{Ouls82,
    author = "G.Oulsnam",
    title = "Unravelling Unstructured Programs",
    journal = "The Computer Journal",
    year = 1982,
    volume = 25,
    number = 3,
    pages = "379-387"
}


@ARTICLE{Bake77,
    author = "B.S.Baker",
    title = "An Algorithm for Structuring Flowgraphs",
    journal = jacm,
    year = 1977,
    volume = 24,
    number = 1,
    pages = "98-120",
    month = jan
}


-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Cristina Cifuentes AARnet: cifuente@fitmail.fit.qut.edu.au
Queensland University of Technology (QUT), Australia
--

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