Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Discrete Mathematics
The Rearranger - A New Assembler Utility
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Generalized structured programs and loop trees
Science of Computer Programming
| Hi-index | 0.00 |
Loop trees, which were very recently discovered, provide us with a new way of looking at structured programming. Using loop trees, there is a sense in which there is no such thing as spaghetti code; all code is structured. In order to understand this, however, students have to know about strongly connected components, which are not treated in every discrete structures book. We give here a sample presentation to students of strongly connected components, together with exercises and answers. We also show the basic idea of loop trees and cite a Web site where students can practice with them, if they have studied any one of five specific assembly languages.