Taming control flow: a structured approach to eliminating goto statements
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 229-240
- https://doi.org/10.1109/iccl.1994.288377
Abstract
This paper we present a straight forward algorithm to structure programs b eliminatingall goto statements. The method works directl on a high level abstract s ntax tree STrepresentation of the program and could easil be integrated into an compiler that uses an STbased intermediate representation. The actual algorithm proceeds b eliminating each goto brst appl ing a sequence of transformations followed b the appropriatetransformation.e have implemented the method in the Mc T McGill ompiler ...Keywords
This publication has 12 references indexed in Scilit:
- A control-flow normalization algorithm and its complexityIEEE Transactions on Software Engineering, 1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Conversion of Unstructured Flow Diagrams to Structured FormThe Computer Journal, 1978
- Generating structured flow diagrams: the nature of unstructurednessThe Computer Journal, 1977
- An Algorithm for Structuring FlowgraphsJournal of the ACM, 1977
- Programming Languages—The First 25 YearsIEEE Transactions on Computers, 1976
- Translating Program Schemas to While-SchemasSIAM Journal on Computing, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- On the capabilities of while, repeat, and exit statementsCommunications of the ACM, 1973
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966