Symbolic Assembly Program
The Symbolic Assembly Program (SAP) is an assembler program for the IBM 704 computer. It was written by Roy Nutt at United Aircraft Corporation, and was distributed by the SHARE user's group beginning in 1956 as the Share Assembly Program. SAP succeeded an earlier program called NYAP1 (New York Assembly Program 1), which it closely resembled,[1] and became the standard assembler for 704 users.[2] It "set the external form of an assembly language that was to be a model for all its successors and which persists almost unchanged to the present day."[3]
Description
SAP is a two-pass assembler. It is capable of running on a 704 with a minimum of 4 K 36-bit words of core storage. This configuration allows up to 1097 entries in the symbol table. Additional core memory beyond 4 KW can be used to allow for additional symbol table entries.[4]
Input and output for SAP are via punched cards. Input is in fixed format.[2]
| Card columns | Description |
|---|---|
| 1-6 | label or blank |
| 7 | blank |
| 8-10 | operation code (3 characters) or blank |
| 11 | blank |
| 12-72 | variable field |
| 73-80 | not used by the assembler. May contain identification and sequence information |
Sample Program
The following is a listing of a sample self-loading bootstrap program.[5]
References
- ^ Orchard-Hays, William. "Adaptability of the Linear Programming Codes" (PDF). Defense Technical Information Center. Retrieved May 31, 2019.
- ^ a b Helwig, F.; et al. "CODING for the MIT-IBM 704 COMPUTER" (PDF). bitsavers.org. Retrieved Apr 8, 2018.
- ^ Padua, David A. "CS321: I. Programming Languages" (PDF). Polaris Research Group. Retrieved May 31. 2019.
{{cite web}}: Check date values in:|accessdate=(help) - ^ Nutt, Roy. "United Aircraft Corporation SHARE Assembler". Retrieved Apr 9, 2018.
- ^ Zurlinden, Donald H. "IBM MODEL-704 GUIDEBOOK" (PDF). eScholarship.org. Lawrence Berkeley National Laboratory. Retrieved May 31, 2019.
External links
.svg?lang=en){kind=logo} | This free and open-source software article is a stub. You can help Wikipedia by expanding it. |