Taming Control Flow: A Structured Approach to Eliminating Goto Statements (1994)
Cached
Download Links
- [www.sable.mcgill.ca]
- [www-acaps.cs.mcgill.ca]
- [ftp.capsl.udel.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of 1994 IEEE International Conference on Computer Languages |
| Citations: | 41 - 7 self |
BibTeX
@INPROCEEDINGS{Erosa94tamingcontrol,
author = {Ana Erosa and Laurie J. Hendren},
title = {Taming Control Flow: A Structured Approach to Eliminating Goto Statements},
booktitle = {In Proceedings of 1994 IEEE International Conference on Computer Languages},
year = {1994},
pages = {229--240},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In designing optimizing and parallelizing compilers, it is often simpler and more efficient to deal with programs that have structured control flow. Although most programmers naturally program in a structured fashion, there remain many important programs and benchmarks that include some number of goto statements, thus rendering the entire program unstructured. Such unstructured programs cannot be handled with compilers built with analyses and transformations for structured programs. In this paper we present a straight-forward algorithm to structure C programs by eliminating all goto statements. The method works directly on a highlevel abstract syntax tree (AST) representation of the program and could easily be integrated into any compiler that uses an AST-based intermediate representation. The actual algorithm proceeds by eliminating each goto by first applying a sequence of gotomovement transformations followed by the appropriate goto-elimination transformation. We have implemented...
