Implications of structured programming for machine architecture
Andrew S. Tanenbaum · Communications of the ACM · 1978
Based on an empirical study of more than 10,000 lines of program text written in a GOTO-less language, a machine architecture specifically designed for structured programs is proposed. Since assignment, CALL, RETURN, and IF statements together account for 93 percent of all executable statements, special care is given to ensure that these statements can be implemented efficiently. A highly compact instruction encoding scheme is presented, which can reduce program size by a factor of 3. Unlike a Huffman code, which utilizes variable length fields, this method uses only fixed length (1-byte) opcode and address fields. The most frequent instructions consist of a single 1-byte field. As a consequence, instruction decoding time is minimized, and the machine is efficient with respect to both space and time.
Cited by 157 works. doi:10.1145/359361.359454 Open-access PDF
Authors
References
- A Method for the Construction of Minimum-Redundancy Codes
- An empirical study of FORTRAN programs
- BLISS
- Structured Programming with go to Statements
- BCPL
- Report on the Algorithmic Language
- Report on the Algorithmic Language ALGOL 68
- Static and Dynamic Characteristics of XPL Programs
- Conditional Interpretation of Operation Codes
- Design of the Burroughs B1700