An edition of Systems programming (1972)

Systems programming

  • 22 Want to read
  • 3 Currently reading
  • 2 Have read

My Reading Lists:

Create a new list

  • 22 Want to read
  • 3 Currently reading
  • 2 Have read

Buy this book

Last edited by Drini
September 15, 2025 | History
An edition of Systems programming (1972)

Systems programming

  • 22 Want to read
  • 3 Currently reading
  • 2 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
McGraw-Hill
Language
English
Pages
488

Buy this book

Previews available in: English

Edition Availability
Cover of: Systems programming
Systems programming
1972, McGraw-Hill
in English

Add another edition?

Book Details


Table of Contents

Preface
Page xiii
Acknowledgements
Page xvi
Note to the Student
Page xviii
1. Background
Page 1
1. Machine Structure
Page 2
2. Evolution of the Components of a Programming System
Page 4
1. Assemblers
Page 4
2. Loaders
Page 4
3. Macros
Page 6
4. Compilers
Page 7
5. Formal Systems
Page 7
3. Evolution of Operating Systems
Page 8
4. Operating System User Viewpoint: Functions
Page 10
5. Operating System User Viewpoint: Batch Control Language
Page 11
6. Operating System User Viewpoint: Facilities
Page 14
7. Summary
Page 14
Questions
Page 16
2. Machine Structure, Machine Language, and Assembly Language
Page 21
1. General Machine Structure
Page 21
1. General Approach to a New Machine
Page 23
2. Machine Structure—360 and 370
Page 25
1. Memory
Page 25
2. Registers
Page 25
3. Data
Page 27
4. Instructions
Page 29
5. Special Features
Page 35
2. Machine Language
Page 35
1. Long Way, No Looping
Page 36
2. Address Modification Using Instructions as Data
Page 38
3. Address Modification Using Index Registers
Page 40
4. Looping
Page 41
3. Assembly Language
Page 43
1. An Assembly Language Program
Page 43
2. Example Using Literals
Page 45
4. Summary
Page 47
Questions
Page 48
3. Assemblers
Page 59
1. General Design Procedure
Page 60
2. Design of Assembler
Page 60
1. Statement of Problem
Page 60
2. Data Structure
Page 62
3. Format of Data Bases
Page 65
4. Algorithm
Page 73
5. Look for Modularity
Page 77
3. Table Processing: Searching and Sorting
Page 80
1. Linear Search
Page 81
2. Binary Search
Page 82
3. Sorting
Page 84
1. Interchange Sort
Page 84
2. Shell Sort
Page 86
3. Bucket Sort
Page 86
4. Radix Exchange Sort
Page 88
5. Address Calculation Sort
Page 88
6. Comparison of Sorts
Page 90
4. Hash or Random Entry Searching
Page 91
4. Summary
Page 95
5. Epilog
Page 95
Questions
Page 98
4. Macro Language and the Macro Processor
Page 111
1. Macro Instructions
Page 112
2. Features of a Macro Facility
Page 114
1. Macro Instruction Arguments
Page 114
2. Conditional Macro Expansion
Page 117
3. Macro Calls within Macros
Page 119
4. Macro Instructions Defining Macros
Page 121
3. Implementation
Page 122
1. Implementation of a Restricted Facility: A Two-Pass Algorithm
Page 123
2. A Single-Pass Algorithm
Page 127
3. Implementation of Macro Calls within Macros
Page 133
4. Implementation within an Assembler
Page 136
4. Summary
Page 142
Questions
Page 143
5. Loaders
Page 149
1. Loader Schemes
Page 150
1. "Compile-and-Go" Loaders
Page 150
2. General Loader Scheme
Page 151
3. Absolute Loaders
Page 152
4. Subroutine Linkages
Page 154
5. Relocating Loaders
Page 156
6. Direct-Linking Loaders
Page 160
7. Other Loader Schemes: Binders, Linking Loaders, Overlays, Dynamic Binders
Page 164
2. Design of an Absolute Loader
Page 167
3. Design of a Direct-Linking Loader
Page 168
1. Specification of Problem
Page 169
2. Specification of Data Structures
Page 176
3. Format of Data Bases
Page 178
4. Algorithm
Page 181
4. Summary
Page 186
Questions
Page 188
6. Programming Languages
Page 199
1. Importance of High Level Languages
Page 200
2. Features of a High Level Language
Page 201
3. Data Types and Data Structures
Page 202
1. Character String
Page 203
2. Bit String — Boolean
Page 204
3. Data Structures
Page 205
4. Storage Allocation and Scope of Names
Page 206
1. Storage Classes
Page 206
2. Block Structure
Page 206
5. Accessing Flexibility
Page 207
1. Pointers
Page 208
2. Label Variables and Label Arrays
Page 208
6. Functional Modularity
Page 210
1. Procedures
Page 211
2. Recursion
Page 212
7. Asynchronous Operation
Page 212
1. Conditions
Page 212
2. Signals
Page 213
3. Multitasking
Page 215
8. Extensibility and Compile-Time Macros
Page 215
9. Miscellaneous
Page 216
10. Summary
Page 216
Questions
Page 217
7. Formal Systems and Programming Languages: An Introduction
Page 227
1. Uses of Formal Systems in Programming Languages
Page 227
1. Language Specification
Page 228
2. Syntax-Directed Compilers
Page 228
3. Complexity Structure Studies
Page 229
4. Structure Analysis
Page 229
2. Formal Specification
Page 230
1. Approaching a Formalism
Page 230
2. Development of Formal Specification
Page 231
3. Formal Grammars
Page 233
1. Examples of Formal Grammars
Page 235
2. The Derivation of Sentences
Page 236
3. Sentential Forms and Sentences
Page 236
4. Hierarchy of Languages
Page 237
5. Backus-Naur Form — Backus Normal Form (BNF)
Page 239
6. Canonic Systems
Page 240
1. Example: Syntax Specification
Page 244
2. Specification of Translation
Page 246
3. Recognition and Translation Algorithm
Page 247
7. Canonic Systems and Formal Systems
Page 251
8. Summary
Page 256
Questions
Page 258
8. Compilers
Page 265
Part 1
Page 265
1. Statement of Problem
Page 265
1. Problem No. 1 — Recognizing Basic Elements
Page 266
2. Problem No. 2 — Recognizing Syntactic Units and Interpreting Meaning
Page 268
3. Intermediate Form
Page 269
1. Arithmetic Statements
Page 269
2. Nonarithmetic Statements
Page 270
3. Nonexecutable Statements
Page 271
4. Problem No. 3 — Storage Allocation
Page 271
5. Problem No. 4 — Code Generation
Page 273
1. Optimization (Machine-Independent)
Page 275
2. Optimization (Machine-Dependent)
Page 275
3. Assembly Phase
Page 277
6. General Model of Compiler
Page 277
Part 2
Page 279
2. Phases of the Compiler
Page 279
1. Lexical Phase
Page 279
1. Tasks
Page 279
2. Data Bases
Page 279
3. Algorithm
Page 282
4. Example
Page 283
2. Syntax Phase
Page 283
1. Data Bases
Page 285
2. Algorithm
Page 286
3. Example
Page 286
3. Interpretation Phase
Page 287
1. Data Bases
Page 288
2. Algorithm
Page 289
3. Example
Page 290
4. Optimization
Page 293
1. Data Bases
Page 293
2. Algorithm
Page 298
5. Storage Assignment
Page 301
1. Data Bases
Page 301
2. Algorithm
Page 302
3. Example
Page 304
6. Code Generation
Page 306
1. Data Bases
Page 306
2. Algorithm
Page 307
7. Assembly Phase
Page 313
1. Data Bases
Page 313
2. Algorithm
Page 313
8. Passes of a Compiler
Page 314
9. Preview
Page 314
Part 3
Page 316
3. Data Structures
Page 316
1. Statement of Problem
Page 316
2. Implementation
Page 320
4. Recursion, Call, and Return Statements
Page 321
5. Storage Classes — Use
Page 326
1. Static Storage
Page 326
2. Automatic Storage
Page 327
3. Internal Controlled Storage
Page 327
4. External Controlled Storage
Page 328
5. Based Storage
Page 328
6. Implementation
Page 328
1. Static Storage
Page 328
2. Automatic Storage
Page 330
3. Controlled and Based Storage
Page 330
7. Block Structure
Page 331
1. Accessing Information for Block Structure
Page 333
2. Storage Allocation for Block Structure
Page 335
8. Nonlocal Go To's
Page 338
9. Interrupts
Page 339
10. Pointers
Page 339
11. Summary
Page 341
Questions
Page 342
9. Operating Systems
Page 349
Part 1
Page 350
1. I/O Programming: Multiple Processors and Interrupt Mechanisms
Page 350
1. Evolution of Multiple Processor System
Page 350
2. I/O Programming
Page 352
3. I/O Processor Structure
Page 353
4. Examples of I/O Programs
Page 355
5. Communications between the CPU and the Channel
Page 357
6. Interrupt Structure and Processing
Page 359
7. Example of I/O Interrupt Processing
Page 362
8. Multiple Processors
Page 365
Part 2
Page 366
2. Memory Management
Page 366
1. Single Contiguous Allocations
Page 367
2. Partitioned Allocation
Page 367
3. Relocatable Partitioned Allocation
Page 370
4. Paged Allocation
Page 373
5. Demand Paged Allocation
Page 376
6. Segmented Allocation
Page 378
7. Segmented-Paged Allocation
Page 386
Part 3
Page 388
3. Processor Management
Page 388
1. Scheduler
Page 389
2. Traffic Controller
Page 392
3. Race Condition
Page 392
4. Stalemates
Page 393
5. Multiprocessor Systems
Page 395
Part 4
Page 401
4. Device Management
Page 401
1. Device Characteristics
Page 401
2. Device Management Techniques
Page 405
Part 5
Page 407
5. Information Management
Page 407
1. Development of File Systems
Page 408
2. Structure of a General File System
Page 409
3. Example of a File System
Page 409
4. Features of a General File System
Page 413
5. General File System Model Revisited
Page 421
6. Segmentation
Page 424
7. MULTICS File System and the General Model
Page 430
6. Summary
Page 430
Questions
Page 433
10. Bibliography and Suggestions for Further Reading
Page 441
Appendix A. 360 Specification
Page 451
Appendix B. Linkage Conventions
Page 465
Index
Page 471

Edition Notes

Bibliography: p. 441-450.

Published in
New York
Series
McGraw-Hill computer science series

Classifications

Dewey Decimal Class
001.6/42
Library of Congress
QA76.6 .D65

The Physical Object

Pagination
xviii, 488 p.
Number of pages
488

Edition Identifiers

Open Library
OL4469004M
Internet Archive
systemsprogrammi00don_xk6
ISBN 10
0070176035
LCCN
79172263
OCLC/WorldCat
298763
LibraryThing
532953

Work Identifiers

Work ID
OL2634352W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
September 15, 2025 Edited by Drini Add TOC from Tocky
July 24, 2024 Edited by MARC Bot import existing book
December 11, 2023 Edited by MARC Bot import existing book
February 24, 2022 Edited by Michel T. Talbot //covers.openlibrary.org/b/id/12646626-S.jpg
April 1, 2008 Created by an anonymous user Imported from Scriblio MARC record