Answers are grounded in this paper and cite their sources.
The class of programs which do not contain goto statements has a structure which lends itself to optimization by an optimizer that is fast, efficient and relatively easy to program. The design of such an optimizer is described, along with some of the results obtained using this optimizer—one such result being that very little code optimization is achieved. The conjecture is made that this is true because gotoless programming languages lend themselves to more compact and concise object code at the source language level.
No takes yet. Share an insight, caveat, or question.
Zelkowitz et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: