Taming control flow: a structured approach to eliminating goto statements

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 ...