Paper Info
Title
Structured programming in Macintosh assembly language (abstract)
Abstract
Ever since Dijkstra first pointed out the harmfulness of the Goto twenty years ago, programmers in high-level language have become more and more accustomed to writing structured programs. No such development has taken place in assembly language due to the lack of such constructs as the If-Then, If-Then-Else, While-Do, and Repeat-Until statements of Pascal.It is possible, however, to achieve the same effect by the exercise of programming discipline if all branching in the program is made to follow the rules of structured programming. For example, an If-Then statement such as If X = 0 Then Y := 1 Else Y := 2 EndIf may be implemented in Macintosh assembly language as If1 Tst.W X(A5) ;if X 0; Then Goto; Else1 Bne Else1 Move.W #1,Y(A5) ;Y := 1 Bra EndIf1 ;Goto Endif1 Else1 Move.W #2,Y(A5) ;Y :=2 EndIf1While such programs may appear somewhat strange at first, consistent application of the discipline makes it very easy to convert any algorithm expressed as a structured high-level language program to Macintosh assembly language completely mechanically and, therefore, correctly.A textbook on Macintosh assembly language incorporating these principles is under development by the author.
Year
DOI
Venue
1990
10.1145/100348.100430
ACM Conference on Computer Science
Keywords
Field
DocType
w x,structured programming,goto twenty year,macintosh assembly language,structured program,structured high-level language program,assembly language,high-level language,else1 bne else1,goto endif1 else1,high level language
Programming language,Software engineering,Computer science,Assembly language,Very high-level programming language,Structured programming,High-level programming language,First-generation programming language,Low-level programming language,Branching (version control),Goto
Conference
ISBN
Citations 
PageRank 
0-89791-348-5
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Clint Foulk100.34