A Programming Language
A Programming Language
Kenneth E. Iverson
Chapter 2 Microprogramming
2.1 Instruction preparation
• Additive indexing
• Indirect addressing
• Dynamic relocation
• Branching, interruption, and trapping
• Complete instruction fetch
2.2 Instruction execution
• Load and store
• Branch instructions
• Logical instructions
• Arithmetic instructions
• Shift instructions
• Convert instructions
• Input-output instructions
2.3 Detailed logical design
References
Exercises
Chapter 4 Search Techniques
4.1 Scanning methods for ranking
• Directed scan
• Controlled scan
4.2 Key transformations
• Nonunique key transformations
4.3 Multiple keys
References
Exercises
Chapter 5 Metaprograms
5.1 Compound statements
5.2 Lukasiewicz notation
5.3 The minimax form of an L-formula
5.4 Translation from complete parenthesis to Lukasiewicz notation
5.5 Translation from Lukasiewicz to complete parenthesis notation
References
Exercises
Chapter 6 Sorting
6.1 Serial sorting methods
• Copy operations
• Simple classification and merge
• Classification and simple merge
• Partial pass methods
6.2 Evaluation of serial sorting methods
• Simple classification and merge
• Classification and simple merge
• Partial pass methods
6.3 Aids to serial sorting processes
6.4 Internal sorting methods
• Simple classification and merge
• Classification and simple merge
• Special internal sorting methods
6.5 Evaluation of internal sorting methods
• Expected number of transpositions
• Bubble sort
• Ranking sort
• Odd-even transposition sort
• Repeated selection sort
• Sorting with replacement
• Comparison of internal sorting methods
Appendix to Chapter 6
References
Notes
Exercises
Chapter 7 The Logical Calculus
7.1 Elementary identities
7.2 Canonical forms
• Intrinsic vector
• Characteristic vectors
7.3 Decomposition
• Disjunctive canonical form
• Other canonical forms
References
Exercises