Premium
Optimization of structured programs
Author(s) -
Zelkowitz Marvin V.,
Bail William G.
Publication year - 1974
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380040106
Subject(s) - programming language , computer science , program optimization , class (philosophy) , code (set theory) , object (grammar) , goto , conjecture , theoretical computer science , mathematics , set (abstract data type) , discrete mathematics , artificial intelligence , compiler
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.