I ■ 
 
 ■ 
 
 ■ I 
 
 91a 
 
 In 
 ■ 
 
 Dna 
 
 ■ 
 n 
 
 NBA 
 
LIBRARY OF THE 
 
 UNIVERSITY OF ILLINOIS 
 
 AT URBANA-CHAMPAICN 
 
 
Digitized by the Internet Archive 
 in 2013 
 
 http://archive.org/details/ibalmanualilliac469schw 
 
Report No. U69 
 
 coo-2118-0017 
 
 IBAL MANUAL 
 The Illiac III Basic Assembler Language 
 
 by 
 John C. Schwebel 
 
 revised by 
 
 Ahmad E. Masumi 
 
 July, 1971 
 
 DEPARTMENT OF COMPUTER SCIENCE 
 UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN 
 
 URBANA, ILLINOIS 
 
 DIVERSITY QF ILLINOIS 
 CAMPAIGN 
 
-9 
 

 COO-2118-0017 
 
 Report No. U69 
 
 IBAL MANUAL* 
 
 The Illiac III Basic Assembler Language 
 
 by 
 John C. Schwebel 
 
 revised by 
 Ahmad E. Masuml 
 
 July, 1971 
 
 Department of Computer Science 
 University of Illinois 
 Urbana, Illinois 6l801 
 
 ^Supported in part by Contract AT ( 11-1 ) -2118 with the United States 
 Atomic Energy Commission. 
 
% 
 
 C*# 
 
 IBAL MANUAL 
 Table of Contents 
 
 1. Introduction 
 
 2. Definition of the Language 
 
 2.1 Terminal Symbols 
 
 2.2 Basic Elements 
 
 2.3 Program Structure 
 2.k Declarations 
 
 2.5 Instructions 
 
 2.6 Commands 
 
 2.7 Directives 
 
 3. Segmentation 
 
 3.1 Procedure Segments 
 
 3.2 Data Segments 
 
 3.3 Storage Attributes 
 
 3.k Intersegment Communication 
 h. Pointer Register Allocation 
 
 Appendix 1 - The 60 Character Set 
 Appendix 2 - Reserved Words 
 Appendix 3 - Complete IBAL Syntax 
 Appendix k - Sample Program Segment 
 Appendix 5 - Instruction Mnemonic Code 
 
 Date: 8/1+/71 
 
 Section: Table of Contents 
 
 Page 1 of 1 
 
 Revision: 
 
 IBAL MANUAL 
 
2. Definition of the Language 
 Contents 
 
 2.1 Terminal Symbols 
 
 2.1.1 Basic Characters 
 
 2.1.2 Compound Punctuations 
 
 2.1.3 Reserved Words 
 
 2.2 Basic Elements 
 
 2.2.1 Comments and Blanks 
 
 2.2.2 Identifiers 
 
 2.2.3 Unsigned Integers 
 2.2.U Constants 
 
 2.2.5 Literals 
 
 2.2.6 Self-Defining Values 
 
 2.2.7 Expressions 
 
 2.3 Program Strucutre 
 
 2.3.1 Blocks 
 
 2.3.2 Procedures 
 
 2.3.3 Scope 
 
 2.3.1+ Storage Allocation 
 2.1+ Declarations 
 
 2.14.1 Attributes 
 
 2.1+.2 Conditional Format Item 
 
 2.1+.3 Structure Declaration and the LIKE Attribute 
 2.5 Instructions 
 
 2.5.1 Pointer 
 
 2.5.2 Operand 
 
 2.5.3 Data Transfer 
 
 2.5.1+ Stack Utility, Logical and Shift 
 
 2.5.5 Decision 
 
 2.5.6 Utility 
 
 2.5.7 List Processing 
 
 Date: 8/1+/71 
 Section: 2 Outline 
 Page : 1 of 2 
 Revision: 
 
 IBAL MANUAL 
 
2.5.8 Imprimitive Instruction 
 2.5.8.1 Asynchronous Information 
 
 2.5.9 System Instructions 
 
 2.5.9.1 Supervisory 
 
 2.5.9.2 Interrupt 
 
 2.5.9.3 Input /Output 
 2.5.9.U Coordinating 
 2.5.9.5 Timing 
 
 2.5.10 Arithmetic 
 
 2.5.11 Pattern Articulation 
 2.5.11.1 Boole Function 
 
 2.6 Input /Output 
 
 2.6.1 Interrupt Command 
 
 2.6.2 Device Dependent Command 
 
 2.6.3 Device Independent Command 
 
 2.7 Directives 
 
 2.7.1 Control Directive 
 
 2.7.2 Assignment Directive 
 
 2.7.3 Source Format Directive 
 2.7. ^ Assembler Directive 
 
 Date: 8 A/71 
 
 
 Section: 2 Outline 
 
 
 Page: 2 of 2 
 
 
 Revision: 
 
 
 IBAL MANUAL 
 
 
1. Introduction 
 
 This manual describes IBAL, the Illiac III Basic Assembler 
 Language. It is intended that IBAL will be the lowest level language used 
 for Illiac III programs. With suitable constraints upon the naming of operands, 
 each primitive operation in IBAL directly corresponds to ""-pne Illiac III 
 machine instruction. The reader should be familiar with ,the Illiac III 
 machine instructions and their formats as given in the Illiac III Reference 
 Manual [ 1 ] . 
 
 It is possible to specify information structures more general than 
 those of the machine instructions. A statement in IBAL may be a block, 
 declaration, instruction or directive. Blocks permit the specification of 
 nested structures of statements. Declarations allow specification of 
 generalized tree-structured data sets whose irreducible constituents are 
 the smallest addressable basic elements of the machine. The block structure 
 of IBAL corresponds to the block structure of ALGOL 60 [2] and PL/l [3]. 
 The declarations of IBAL are based on those given in [U] . 
 
 In comparison to other programming languages usually classified as 
 "assembler languages", IBAL allows very general data declarations. It is 
 believed that this capability is essential to any 'programming language 
 adequate to provide a target language for the translation of procedure- 
 oriented languages having the complexity of PL/1. 
 
 Date: 3/26/71 
 Section: Introduction 
 Page: 1 of 1 
 Revision: 
 
 IBAL MANUAL 
 
2. Definition of the Language 
 
 Syntax is described in this report by metalinguistic formulae with 
 a metalinguistic variable on the left-hand side of the symbol ": :=" and a 
 concatenation of metalinguistic variables, symbols or operators on the 
 right-hand side. 
 
 A metalinguistic variable has the form: <any character string>. 
 Its values are finite sequences of symbols. The metalinguistic operators 
 used and their meaning follows: 
 
 Operator Meaning 
 
 Logical OR; the element on the left 
 or the right of the vertical stroke 
 is selected. 
 
 { } Only one of the elements within the 
 
 brackets is to be selected. 
 
 [ ] The element within the bracket may 
 
 occur once or not at all. 
 
 The element within the brackets may 
 occur any finite number of times. 
 
 |_L _JJ The element within the brackets may 
 
 occur any finite non-zero number of 
 times . 
 
 Any character in a formula which is not a metalinguistic variable or 
 operator denotes itself. 
 
 A syntactically correct program is generated from the basic 
 variable <program> by replacing it with the right-hand side of any 
 formula in which this variable appears as a left-hand member. Then by 
 continued replacement of variables, a string of symbols, all of which 
 denote themselves is obtained. 
 
 Date: 2/9/68 
 Section: 2 
 Page: 1 of 2 
 Revision: 
 
 IBAL MANUAL 
 
Examples: 
 
 <var 1> 
 
 <var 1> 
 
 <var 1> 
 
 <var 1> 
 
 = <var 2> | <var 3> 
 
 generates <var 2> or <var 3> 
 = <var 2> [<var 3>] 
 
 generates <var 2>, or <var 2> 
 
 concatenated with <var 3>« 
 •-= <var 2> J _ <var 3> _[ 
 
 generates <var 2> concatenated with an 
 
 arbitrary number of <var 3>« 
 = <var 2> JJ_ <var 3> Jl 
 
 generates <var 2> <var 3^ concatenated with 
 
 an arbitrary number of <var 3>- 
 
 Date: 2/26/68 
 Section: 2 
 Page: 2 of 2 
 .Revision: 
 
 IBAL MANUAL 
 
2-1 Terminal Symbols 
 
 The terminal symbols in IBAL are all those elements which denote 
 themselves in a syntax formula(and occur only on the right of such formulae) 
 These symbols are thus terminal elements in the language. A terminal 
 symbol may be a basic character, a compound punctuation, or a reserved word 
 
 Date: 2/9/68 
 Section: 2.1 
 Page: 1 of h 
 Revision: 
 
 IBAL MANUAL 
 
2.1.1 Basic Characters 
 
 <alphabetic> : := $|#| @| a|b| c|d|e|f|g|h|i|j|k|l 
 
 |m|n|o|p|q|r|s|t|u|v|w|x|y|z 
 
 <digit> : := 0|l|2|3|U|5|6|T|8|9 
 
 <special character> ::= |=| + |-|*|/|(|)|,|.|'|^ 
 
 U|:H&ltl>l<Lh 
 
 <blank> ::= single space 
 
 <alphamiiaerlc > ::= alphabet ic> | <digit> 
 
 <basic character> : := < alphanumeric> -special character> <blank> 
 
 The character set is the same as the 60 character set of PL/l 
 and is given in Appendix 1. There are 29 characters defined as alphabetic 
 characters : Letters A through Z and the three characters $, @, and #. 
 Decimal digits constitute the ten numeric characters . Finally, the 
 character set is supplemented by 21 special characters . 
 
 The language character * |' is denoted by 'f' in the syntactic 
 formulae to distinguish it from the metalanguage character ' | ' . 
 
 Date: 7/26/71 
 Section: 2.1 
 Page 2 of h 
 Revision: IrAL MANUAL 
 
2.1.2 Compound Punctuations 
 
 A compound punctuation is a predefined pair of special characters 
 appearing immediately adjacent to each other. All the compound punctuations 
 are listed below: 
 
 comment delimiters: /* 
 
 V 
 
 PR allocation operator: -> 
 relational operators: : <= 
 
 >= 
 
 -?= 
 
 ~i< 
 
 -|> 
 
 Date: 
 
 8A/70 
 
 Section 
 
 : 2.1 
 
 Page: 
 
 3 of h 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
2.1.3 Reserved Words 
 
 Reserved words are predefined strings of immediately adjacent alpha- 
 numeric characters. A reserved word may only be used in those places in the pro- 
 gram where it is explicitly permitted by a syntactic formula. All the reserved 
 words in IBAL are listed in Appendix 2. 
 
 Examples: 
 
 BEGIN PROCEDURE PUSH END 
 
 Date: 8 A/70 
 Section: 2.1 
 Page: U of U 
 Revision : 
 
 IBAL MANUAL 
 
2 .2 Basic Elements 
 
 2.2.1 Comments and Blanks 
 
 <comment> ::= /* <any basic character string not containing */> */ 
 
 A comment is a string of basic characters not including */ which is 
 delimited by /* and */. Comments are reproduced on the listing but otherwise 
 have no effect on the program. 
 
 For simplicity, the syntactic formulae in this manual do not specify 
 where comments or blanks may occur. The syntactic rules concerning the use of 
 comments and blanks are given below. These rules apply to all places in a pro- 
 gram except within a character constant. 
 
 IBAL is a free format language. This means that wherever one blank 
 is allowed, any number of blanks may be used. A comment may be used wherever 
 a blank is permitted. 
 
 A blank is not permitted within a compound punctuation, an identifier 
 or within a construct made up of alphanumeric characters. 
 
 A blank is required to separate two alphanumeric constructs. 
 
 A blank is permitted in all other places. 
 
 Date: 8 A/70 
 Section: 2.2 
 Page: 1 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2.2.2 Identifiers 
 
 <identifier> : : - <alphabetic> j {<alphanumeric>[-] 
 
 An identifier is a string cf maximum length 31 over the set of alpha- 
 numeric characters and the "break character. The first character must be alpha- 
 betic. The syntactic class, identifier, includes the following language ele- 
 ments: 
 
 label 
 name 
 
 reserved word 
 symbol 
 parameter 
 event name 
 task name 
 entry name 
 
 Date: 3/26/71 
 Section: 2.2 
 Page: 2 of 10 
 Revision : 
 
 IBAL MANUAL 
 
2.2.3 Unsigned Integers 
 
 <unsigned integer> ::= | <digit> 
 
 An unsigned integer is a string of decimal digits of maximum length 5 
 in the range to 65,535 (2-1). 
 
 Examples: 
 
 Identifiers: BA13D #5B 
 ABC is one identifier 
 AB C are two identifiers 
 X+Y is equivalent to X + Y 
 /* is a compound punctuation 
 / * are two operators 
 26A is not an identifier 
 26 is an unsigned integer 
 
 ABC 
 
 Date: 2/9/68 
 Section: 2.2 
 Page: 3 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2.2.U Constants 
 
 <nuiriber type> ::= S | L |F | D 
 
 <hexadigit> : : ---■ <digit> |a|b|c|d|e|f 
 
 <bit> : := o|l 
 
 <sign> . : -- +| ■ 
 
 • exponent> ::- E [<sign>] <unsigned integer> 
 
 <scale field> ::- S [<sign>] <unsigned integer> 
 
 <decimal num"ber> ::- [<sign>] {^unsigned integer> [.] 
 
 [<unsigned integer>] | Xunsigned integer>} 
 
 [<exponent>] 
 <binary number> : . - I <bit> J [<scale f ield>] 
 <hex number> : : - |[ <hexadigit> J [<scale f ield>] 
 
 <character string> ::- <string of basic characters with ' occuring 
 
 only in adjacent pairs> 
 
 - '<character string> ' 
 '<binary number> | , <binary number> J 'B 
 '<hex nu;nber> i , <hex number> J 'X 
 
 | <decimal number > <number type> 
 
 - ' j| <bit> J[ 'F 
 <constant data bits> [<constant flag bits>] 
 
 i distant flag bits> 
 
 <constant data bits> 
 
 n tant flag t 
 coristant> : 
 
 ft sons tant specifics a character string or a hexadecimal, binary, or 
 Lmal number to be c bed to the Illiac III internal representation. The 
 number of bytes used for any constant is determined and the binary representa- 
 tion of the constant is i in the data bits of the bytes. The constant flag 
 bits which s> e specified are placed in the flag bits of the bytes. If the 
 specification of either the constant data bits or the constant flag bits are 
 omitted, then tlierse bits are set to zero. 
 
 Th' Lstant flag bits which are specified are used repeatedly from 
 left to right, to set the flags in all the bytes used by the immediately pre- 
 
 seclmg cons 
 
 tant da J 
 
 :a 
 
 bits . 
 
 Date: 2 
 
 /9/68 
 
 
 
 Section: 
 
 2.2 
 
 
 
 Page : h 
 
 of 10 
 
 
 
 Revision 
 
 
 
 
 IBAL 
 
 viANUAL 
 
 
 
Examples : 
 
 constant bytes used flag bits 
 
 'ABC '101' F 3 10 1 
 
 «98AO'X *01» F 2 1 
 
 'AJKGLSP' '10' F 7 1010101 
 
 '0A1F2VX 3 
 
 A character string constant consists of a string of basic characters, 
 with quotation marks occuring only in adjacent pairs, delimited by a quotation 
 mark on the left and on the right. Each pair of quotation marks is interpreted 
 as one quotation mark to be placed in the store. A single quotation mark is 
 interpreted as the delimiter terminating the character string. The eight bit 
 code for each character, including blanks, is placed in each byte in the store. 
 A comment that is inserted within a character string will not be recognized as 
 a comment but will be considered to be part of the character string data. 
 
 A binary constant or a hexadecimal constant consists of a string 
 of binary numbers or hexadecimal numbers separated by commas , enclosed in quota- 
 tion marks, and followed by B or X respectively. A binary number is a string 
 of bits followed by an optional scale field. A hexadecimal number is a string 
 of hexadigits followed by an optional scale field. The scale field specifies 
 a decimal integer. A positive integer adds binary or hexadecimal zeros to the 
 right of the number, and a negative integer adds binary or hexadecimal zeros to 
 the left of the number. The number is transformed to an unsealed number before 
 the binary representation is placed in the store. If an unsealed binary number 
 does not consist of a multiple of 8 bits, then zeros are inserted to the left 
 of the number until it does. Two hexadigits in a hexadecimal number correspond 
 to one byte in the store. If an unsealed hexadecimal number consists of an odd 
 number of hexadigits, an additional zero hexadigit is added to the left end. 
 The U-bit code for each hexadigit is placed in the store. 
 
 A decimal constant consists of a decimal number followed by a letter 
 indicating the number type. A decimal number may contain a decimal point, and 
 may be preceded by a sign. Decimal numbers may be followed by an exponent 
 which represents a decimal integral power of 10 by which the number is multi- 
 plied before conversion. 
 
 Date 
 
 : 8/U/T0 
 
 Sect 
 
 ion: 
 
 2.2 
 
 Page 
 
 : 5 
 
 of 10 
 
 Revi 
 
 sion 
 
 
 
 IBAL 
 
 MANUAL 
 
Number type D specifies that the decimal number is to be converted to 
 the double-word decimal representation. The decimal point and exponent are ig- 
 nored* The leftmost byte contains the U-bit sign code. Then up to ik most 
 significant digits are right justified within the double word and padded with 
 zeros on the left, if necessary, to fill seven bytes. 
 
 Number types S or L specify the short (half-word) or long (full-word) 
 fixed point binary representation. The decimal number is converted to a decimal 
 integer by rounding and truncating if any fractional part remains after adjust- 
 ment by the exponent. Then the decimal integer is converted to the 2-byte or 
 U-byte binary integer representation. 
 
 Number type F specifies the double-word floating point binary represen- 
 tation. The decimal number is converted to a normalized binary fraction. If 
 necessary, rounding and truncation are performed on the rightmost portion of the 
 fraction. Then the normalized double-word floating point form is placed in the 
 store. 
 
 Examples: 
 
 Character string constants: 'ABD' 'E?+' '* ' ' ' 
 
 binary constants: '101'B '11001S3'B ' 00,01,10,11' B 
 
 hexadecimal constants: '1A3,4FB'X 'ACB S-1'X ' 12 ' X 
 
 decimal constants: 253. 9I+ D .2|?E2 S 
 
 -U.3E-6F 68 s 
 
 1000 L 
 
 Date: 2/9/68 
 Section: 2,2 
 Page: 6 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2.2.5 Literals 
 
 <literal> ::= =<constant> 
 
 A literal specifies a program constant in a decimal, binary, hexadeci- 
 mal, or character form. When a literal is used as operand, the constant is as- 
 sembled in an area of fast storage called the literal pool and a pointer to the 
 literal replaces the literal in the program. If identical literals are defined 
 within the same program, the pointers are the same. The literal pool is con- 
 sidered as data which is global to the program. The method of specifying a lit- 
 eral is by an equal sign preceding a constant. 
 
 Date: 2/9/68 
 Section: 2.2 
 Page: 7 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2.2.6 Self -Defining Values 
 
 <self-defining value> ::= <unsigned integer> 
 
 '<binary number>' B 
 '<hex number>' X 
 '<character string>' C 
 
 A self-defining value is used alone or in an expression to denote a 
 positive integer value. An unsigned integer expresses a decimal value. A bi- 
 nary number expresses a binary value. A hexadecimal number expresses a hexa- 
 decimal value. A character string expresses the binary value obtained by con- 
 
 "16 
 verting each character to its 8-bit code. The value is evaluated modulo 2 
 
 l6 
 
 Thus the integer value is in the range to 2 -1. 
 
 Examples: 
 
 self-defining value binary equivalent 
 
 9 1001 
 
 1 11011 ' B 11011 
 
 'AlB'X 101000011011 
 
 Date: 2/9/68 
 Section: 2.2 
 Page: 8 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2.2.7 Expressions 
 
 <label> ::= <identifier> 
 <symbol> ::= <identifier> 
 
 | <register symbol> 
 <register symbol> ::= pS |PRO |PR1 |PR2 |PR3 |prU |PR5 |pr6 |PR7 |PR8 |PR9 
 
 |PR10|PR11 |PR12 |PR13 |PRlU 
 <primary> ::= <self-defining value> 
 | <symbol> 
 | <label> 
 
 (<constant expression>) 
 <term> ::= [ <term> {*|/) ] <primary> 
 
 <constant expression> ::= [ [ <constant expression> ]{ + !-}] <term> 
 <integer expression> ::= <constant expression> 
 
 | <operand> 
 
 A symbol is an identifier which is assigned a value by the EQU direc- 
 tive or is a predefined register symbol. A label is an identifier whose value 
 is determined by its position within the program segment. 
 
 Expressions in IBAL are used only to obtain an integral value. The 
 value of a constant expression can be determined at compile time. The absolute 
 value of a constant expression will be evaluated modulo 2 . Thus a value in 
 the range - (2 -l) to (2 -l) can be represented. In a constant expression the 
 predefined pointer register symbols PRO, PR1, ..., PRl4 have the integral values 
 0, 1, ..., lU respectively. 
 
 The operations performed in evaluating an expression are unary nega- 
 tion and binary addition, subtraction, multiplication, and division. These op- 
 erations are performed on the long fixed point binary representation of the val- 
 ues of the primaries in the expression. The precedence of operators is: first 
 unary + and - , second binary * and / , third binary + and - . Expressions with- 
 in parenthesis have the highest precedence. In the case of equal precedence op- 
 erators on the same parenthesis level, the leftmost operation is performed 
 first. 
 
 Date : 
 
 2/9/68 
 
 Section: 2.2 
 
 Page : 
 
 9 of 10 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
An integer expression is a constant expression or is itself an operand 
 (operands are defined in Section 2. 5 .2). If an integer expression is an operand, 
 then the value specified is the 16-bit positive integer at the operand address. 
 If the operand as an integer expression is itself a constant expression, then 
 the constant expression must contain one of the predefined pointer register 
 symbols; otherwise, the value of the integer expression will be interpreted as 
 the value of the constant expression. For example, 2 specifies the integer value 2, 
 while PR2 specifies the integer value at the location pointed to by the pointer 
 register named 2. 
 
 Examples : 
 
 symbols : 
 
 constant expressions 
 
 integer expressions: 
 
 A, SI, PR3 , PR12 
 
 A+'2B'X, (A-Sl)/3 , PR3 + PR12 
 
 A + 2, PR3, F.M(2,3) 
 
 Date: 3/6/68 
 Section: 2.2 
 Page: 10 of 10 
 Revision: 
 
 IBAL MANUAL 
 
2. 3 Program Structure 
 
 < parameter > : 
 
 < statement> : 
 
 := < identifier> 
 := < declaration> 
 
 < instruction> 
 
 < directive> 
 
 < block> 
 
 < boole function> 
 
 < label> : < statement> 
 
 <block> ::= BEGIN ; _[_<statement> ; J_ END 
 
 | PROCEDURE [SEGMENTj_< storage attribute> Jj 
 [ ( <parameter>_|_, <parameter>J_) ] ; 
 J_<statement>; __ END 
 | <label> : <block> <label> 
 
 <program> ::= <block>; 
 
 Da-e: 7/30/71 
 Section 2.3 
 Page: 1 of 5 
 Revision: 
 
 IBAL MANUAL 
 
2.3.1 Blocks 
 
 An IBAL program is a block . A block is a series of statements sepa- 
 rated by semicolons and delimited by BEGIN and END or by PROCEDURE and END. A 
 statement is a declaration, an instruction, a directive, or is itself a block. 
 Thus, in general, a program is a nested structure of blocks. The outermost 
 block will be said to be at level one* Any block which is a statement in a 
 block at level n is at level n + 1. 
 
 Any statement may be named by preceding it by a label and a colon. 
 For clarity, the same label placed before a block may be placed directly after 
 the block END. The label following a block END will cause the labeled block as 
 well as all blocks within the labeled block to be terminated. For example, if 
 block A surrounds block B, then "END A" is equivalent to "END B; END A" . The 
 label of the block at level one is called the program name . Labels on a block 
 delimited by BEGIN and END are block names , or if delimited by PROCEDURE and END 
 procedure name s . Labels on an ENTRY directive are entry names and labels on 
 the ZQJ directive are symbols . All other statement labels are undifferentiated. 
 
 Blocks delimited on the left by BEGIN are executed in their order of 
 appearance. 
 
 
 
 
 Date: 
 
 2, 
 
 '9/68 
 
 Section: 
 
 2.3 
 
 Page : 
 
 2 
 
 of 5 
 
 Re vi si 
 
 on 
 
 
 IBAL 
 
 MANUAL 
 
2.3.2 Procedures 
 
 Blocks delimited on the left by PROCEDURE are called procedures and 
 are executed as subroutines upon execution of the CALL operator. 
 
 A procedure is a subroutine which receives special treatment by the 
 system since it has been explicitly declared by the delimiters PROCEDURE and 
 ENDo It is a block, and is executed only where the CALL operator appears. 
 Operands following the CALL operator may be used to specify procedure operands. 
 
 A list of parameters may appear after the word PROCEDURE. Parameters 
 within the procedure block will be assigned to pointer registers as determined 
 by their order of appearance within the parameter list. 
 
 A procedure must be named by a label. The first label is the pro- 
 cedure name and specifies the primary entry point. Other labels specify addi- 
 tional entry names for the procedure. 
 
 Date: 8 A/70 
 Section: 2.3 
 Page: 3 of 5 
 Revision: 
 
 IBAL MANUAL 
 
2.3-3 Scope 
 
 All- labels and names used in a block must be declared either in the 
 block or in a surrounding block. A label is declared implicitly by its position 
 in front of an item. A name which is not a label is declared explicitly in a 
 declaration. The scope of a label or name is that region of program over which 
 it is defined. A label or name is local to the block in which it is declared, 
 and its scope is this entire block, excluding any contained blocks where the 
 same name or label is declared. The label or name is global to all other con- 
 tained blocks. For further explanation and examples see Section 8 of [5]. 
 
 Date: 
 
 2/9/68 
 
 Section: 2,3 
 
 Page : 
 
 k of 5 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
2.3.1* Storage Allocation 
 
 Block structure facilitates dynamic storage allocation . At any one 
 instance in the execution of the program, storage is allocated only for data 
 items which are local or global to the block being executed. Thus, in their 
 allocation, data items correspond to variables of ALGOL 60 and to the automatic 
 storage class of PL/l. 
 
 Date: 2/9/68 
 Section: 2.3 
 Page: 5 of 5 
 Revision: 
 
 IBAL MANUAL 
 
2.U Declarations 
 
 < declaration :: = { DECLARE [SEGMENT j_ < storage attribute>_|_] | STRUCTURE} 
 
 < format item> J_{ , f } < format item> 
 
 < simple format item> : := [ < level> ] [ [ * ]< name> ] [ < attributes>] 
 
 < level> ::=< unsigned integer> 
 
 < name> ::=< identifier> 
 
 < format item> ::=< simple format item>| < conditional format item> 
 
 A declaration, prefixed by DECLARE, is the general means to define a 
 collection of data sets. Each data set may have a general tree structure. The 
 tree is declared in a top down manner. That is, the first identifier declared 
 is a unique name and is said to be at level one. Branches leading from this top 
 node lead to nodes at level two. Additional branching increases the level until 
 a terminal node is reached. 
 
 Each format item in the declaration specifies a node in the structure. 
 The level number is either specified explicitly by a positive integer or may be 
 omitted if the node is at level one. A series of format items separated by com- 
 mas specify a complete access structure for a data set. The format items must 
 be given in the order that would be obtained if the tree structure were followed 
 in a top down manner, always taking the leftmost branch until a terminal node is 
 reached. Alternate access structures for the same data may be specified by sep- 
 arating two adjacent specifications by an OR ' ' . The unique level one name 
 will determine which access structure is used in any one reference. 
 
 Following the level number, each format item contains an optional name 
 followed by the node attributes. The name specifies the node name. It must be 
 present for all nodes at level one and it must be present if the dimension attri- 
 bute is used. If an asterisk precedes a node name, the named item is optional 
 and need be provided only if a reference is made to the name. 
 
 Date: 
 
 7/26/71 
 
 Section: 2.U 
 
 Page: 
 
 1 of .11 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
2.4.1 Attributes 
 
 <attributes> ::= <nonterminal node attrit>utes> 
 
 | <terminal node attrit>ute> 
 <nonterminal node attributes> : := [ (<bounds>_|_, <bounds>_[_) ] 
 
 [{STRING | VECTOR}] 
 <terminal node attribute> ::= <cell size> | INITIAL (< const ant list>) 
 
 I LIKE <name> 
 
 <cell size> : := B|H|W|D 
 <bounds> ::= [<lower bound> 
 > <bound> 
 < <bound> 
 I * 
 
 ] <upper bound> 
 
 <bound> 
 < lower bound> 
 <upper bound> 
 <constant list> 
 
 <cspec> 
 
 = <integer expression> 
 
 := < integer expression> 
 := <integer expression> 
 ::= [(<unsigned integer> ) ]<cspec> 
 
 J_, [(<unsigned integer> ) ] <cspec>_[_ 
 
 = <constant>|* 
 
 The nonterminal node attributes are the dimension attribute , the 
 vector attribute and the string attribute. 
 
 The dimension attribute specifies that this node is an array of 
 elements of the type specified by the substructure of this node. The 
 dimension attribute must immediately follow the node name. The size of each 
 dimension of the array is specified by bounds separated by commas and 
 enclosed in parentheses. The bounds may specify a lower bound and an upper 
 bound on the index to be used in referencing the array. If the lower bound 
 is omitted, it is assumed to be one. The bounds may also specify that the 
 exact size of this dimension of the array cannot be determined until 
 execution. In some cases, the array is dynamic within the block in which 
 it is declared. The following three cases specify dynamic bounds: 
 > <bound> bound specifies minimum size 
 < <bound> bound specifies maximum size 
 * no estimates on the size 
 
 Date: 8/5/10 
 Section: 2.4 
 Page: 2 of 11 
 Revision: IBAL MANUAL 
 
Each bound is an integer expression. If a variable integer expression is 
 used, the expression is calculated at the time that storage allocation is 
 done for the block. Accordingly, a variable in an integer expression of 
 a declaration must be global to the block in which it occurs. 
 
 The attributes VECTOR or STRING specify the way in which the elements 
 at the next higher level are linked, i.e. whether the present node is a 
 vector or a string of the nodes immediately under it. If neither VECTOR or 
 STRING is specified, VECTOR is assumed. Referencing an ordered list of 
 itmes will be more efficient if they are declared as vector elements, 
 while additions and deletions of information can be performed more efficiently 
 for lists declared as strings. Note that any node in the file may be a 
 string or a vector. Consequently any item in a string or vector can subsume 
 other vectors or strings. 
 
 The terminal node attribute specifies the cell size of the data 
 element at this location in the file, or constants to initially occupy 
 locations in the file, or the LIKE attribute. The cell sizes are 1, 2, k, 
 or 8 bytes specified by B, H, W, or D respectively. The LIKE attribute is 
 explained in section 2.U.3. The INITIAL attribute specifies constant values 
 to be assigned to data elements when storage is allocated for the file. 
 An element which is not a member of an array must have only one constant in 
 the constant list. Constants in the constant list for an array are 
 assigned in a row-major order to the array elements. An unsigned integer, 
 i, preceding a constant is equivalent to repeating the constant in the 
 list i times. An asterisk specifies that no initialization is done for 
 this element. 
 
 Date: 
 
 8/5/TO 
 
 Section 
 
 : 2.k 
 
 Page: 
 
 3 of 11 
 
 Revision: 
 
 IBAI 
 
 MANUAL 
 
2.U.2 Conditional Format Item 
 
 < conditional format item> ::= < if clause> < simple format item> 
 
 ELSE < simple format item> 
 <if clause> ::= IF <Boolean expression> THEN 
 
 < Boolean expression> ::= < Boolean term>J_| < Boolean term>J_ 
 
 < Boolean term> ::= < Boolean factor> &< Boolean factor>J_ 
 
 < Boolean factor> : :=^< ReIation>J | < Logical value | 
 
 [*"T 1 (< Boolean expression>) 
 
 < Logical value> ::= FALSE | TRUE 
 
 <relation> ::=<integer express ion><relational operator> 
 
 <integer expression> 
 <relational operator>= > |-|> | >= | = |-| = | <= | < |-|< 
 
 A conditional format item is a format item with the form given 
 above. At the time when storage is allocated, the Boolean expression is 
 evaluated. If the value of the expression is T, true, then the first format 
 item is chosen for this element in the data set, otherwise the second format 
 item is chosen. 
 
 A Boolean expression is made up of the logical operators: NOT "— — m 
 AND "&" , and OR "J"; and the relations : Less than <, Less than or equal <= , . : 
 Equal =, Greater than >, Greater than or equal >= , unequa2— j = , not less than ; 
 — 1<, and not greater than — j >between integer expressions. The relations are 1 
 primaries in the Boolean expression and yield a value T, true or F, false. 
 The meaning of the unary and binary logical operators is given in the 
 following table: 
 
 Date: 7/26/71 
 
 Section: 2 
 
 .h 
 
 Page: k of 
 
 11 
 
 Revision: 
 
 
 IBAL MANUAL 
 
 ■ 
 
 bl 
 
 F F T T 
 
 b2 
 
 F T F T 
 
 —J hi 
 
 T T F F 
 
 bl & b2 
 
 F F F T 
 
 bl 1 b2 
 
 F T T T 
 
The order of evaluation of the Boolean expression is from left to 
 right with items within parenthesis being evaluated first. The 
 precedence of Boolean operations is: 
 
 First: 
 Second: 
 Third: 
 Fourth : 
 
 Integer expressions and 
 Relational operators 
 & 
 
 These precedences are consistent with the operators of PL/1. 
 
 Date: 3/30/73 
 Section: 2.h 
 Page 5 of 11 
 Revision: 
 
 IBAL MANUAL 
 
2 . k . 3 Structure Declaration and the LIKE Attribute 
 
 The STRUCTURE declaration is syntactically equivalent to the DECLARE 
 declaration (apart from tche replacement of the reserved word DECLARE by the re- 
 served word STRUCTURE), but causes no storage to be allocated. The structure 
 defined by the structure declaration may be symbolically inserted into any dec- 
 laration within its scope. This is done by using the name of the top node of 
 the STRUCTURE declaration following the LIKE terminal node attribute in a DE- 
 CLARE declaration. 
 
 Examples : 
 
 The declaration of Example 1, given below, defines a static data set. 
 Although storage is allocated for the data each time the block which contains 
 the declaration is entered, the amount of storage necessary for the data never 
 changes. All the elements are vector elements. 
 
 Example 2 defines a dynamic data set of all vector elements. N and L 
 
 may vary each time the block containing the declaration is entered. 
 
 The data set of Example 3 consists of both vector and string elements, 
 Branches leading to string items are dotted. The contents of the strings, in 
 this example, are all character constants. 
 
 Date: 2/9/68 
 Section: 2.k 
 Page: 6 of 11 
 Revision: 
 
 IBAL MANUAL 
 
Example 1 - Static Data 
 
 Data declaration: 
 
 DECLARE 1 F, 2 W, 2, 3 Al, k B, h H, 3 B, 3 A2, U H, k B, 
 U W, 3 D, 2 B 
 
 Data structure: 
 
 CONSECUTIVE 
 BYTES 
 
 — 2 
 
 ■integer" specifies the level 
 
 Date: 
 
 2/9/68 
 
 Section: 2.1+ 
 
 Page : 
 
 7 of ii 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
Example 2 - Dynamic Data 
 
 Data declaration: 
 
 DECLARE 1 F, 2 Al(N), 3 B, 3 H, 2 W, 2 A2(L), 3 H, 3 B, 3 W 
 
 Data structure: 
 
 --3 
 
 U4J--2 
 
 __ 4 
 
 •K-N-H- 
 
 K-LH 
 
 Date: 
 
 2/9/68 
 
 Section: 2,k 
 
 Page : 
 
 8 of 11 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
Example 3 - Usage of a Structure 
 
 1 S, 
 
 2 T, 
 3 U B, 
 3 V B, 
 
 2 W H; 
 
 DECLARE 1 A, 
 
 2 B H, 
 
 2 C, 
 
 3 DISLIKES, 
 3 E H, 
 
 2 F W; 
 
 Declare must be in the scope of STRUCTURE DEFINITION 
 
 Date 
 
 : 
 
 8/2/71 
 
 Beet 
 
 ion 2.1+ 
 
 Page 
 
 9 
 
 of 11 
 
 Revii 
 
 sion: 
 
 
 
 IBAL MANUAL 
 
Example, 1+ 
 
 Data declaration: 
 
 DECLARE 1 A, 2 C STRING, 
 
 3 INITIAL ('B'), 
 
 3D, k W, k W, 
 
 3 E STRING, k INITIAL ('IS'), U INITIAL ('=PQ' ), 
 
 3 INITIAL ('A' ), 
 
 2 W 
 
 Data structure: 
 
 'B' 
 
 w 'is' '=pq' 
 
 Date: 7/30/71 
 Section: 2.U 
 Page: 10 of 11 
 Revision: 
 
 IBAL MANUAL 
 
 
Example 5 
 
 DECLARE 1 A (M:N) STRING, 2 V (P), 3 W ; 
 
 A is a string of N-M+l components, each one of which is a vector of P 
 elements, each of which is a word. 
 
 Example 6 
 
 DECLARE 1 S (>M) STRING, 2 INITIAL (' • ') • 
 
 S is a string of at least M components, each of which is ini- 
 tially the 'blank character. 
 
 Example 7 
 
 DECLARE 1 STACK(*), IF RUN=1 THEN 2 W ELSE 2 H ; 
 
 STACK is a vector with an arbitrary number of components, each one of 
 which is a word or a half word. 
 
 Exampi e 8 
 
 DECLARE 1 A(M, N), 2 D | 1 AA (M, 2*N), 2 W ; 
 
 One array is defined with two access structures. A is a M by N double 
 word matrix structure. AA is a M by 2*N word matrix structure. 
 
 Date: 
 
 8/5/70 
 
 Section: 2,4 
 
 Page: 
 
 11 of 11 
 
 Revision: l 
 
 IBAL 
 
 MANUAL 
 
2.5 Instructions 
 
 <instruction> ::= <imprimitive instruction 
 
 <basic data transfer> 
 <logical> 
 
 <string and list processing> 
 <segment administration> 
 <arithmetic> 
 <decision> 
 <system> 
 
 <input /output> 
 <pattern articulation> 
 N0P 
 
 The instructions in IBAL correspond to the Illiac III machine instruc- 
 tions. The form of an instruction is a mnemonic specifying the operation, fol- 
 lowed by operand specifications separated by commas. In most cases all the in- 
 formation preceding the first comma is assembled into one mnemonic byte, and 
 each operand specification is assembled into one byte (short) or three bytes 
 (long). 
 
 Date: 3/30/71 
 Section: 2.5 
 Page : 1 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.5.1 Pointer 
 
 <subscript> ::= <integer expression> 
 <pointer> ::= <name> [ (<subscript>J_, <subscript>J_)] 
 J_.<name>[ (<subscript>J_,<subscript>J_)]_[ 
 
 A pointer is the means of referencing data sets declared in a DECLARE 
 declaration. A pointer may occur as an operator or as an operand in an instruc- 
 tion. 
 
 A pointer specifies one node in a tree structured data set. The first 
 name must be the unique file name. If subscripts follow the name, the name is 
 called a subscripted name . The first subscript specifies the index of the branch 
 leaving the named node going to a node at the next lower level. Additional sub- 
 scripts specify branches leading to nodes at lower levels. If other names (sep- 
 arated by periods) follow the first name, the pointer is called a qualified 
 name . The name following a period must be unique within the substructure of the 
 file pointed to by the preceding name. This name with its subscripts (if any) 
 may lead to a lower level node. Subscripts or names may be continued in this 
 manner until a terminal node is reached. Since node names are optional except 
 at level one, subscripts may be used to select branches at any level within the 
 structure, not just within arrays. Subscripts however must be present to select 
 branches within an array. Subscripts are used from left to right. When an ar- 
 ray of K dimensions is reached, the next K subscripts are used for that array, 
 regardless of whether the K subscripts are properly within one subscript list, 
 exactly one subscript list, or one or more subscript lists (i.e. interleaved be- 
 tween names). Thus a pointer may be denoted by a concatenation of names with 
 subscripts. Any one name may not be unique, but the complete subscripted quali - 
 fied name must uniquely specify a node in a declared data set. 
 
 A pointer is transformed into an operator or operand by identifying a 
 pointer register which points to the leftmost byte of the named node. This 
 pointer register allocation algorithm is discussed in Section h. 
 
 Date : 
 
 2/9/68 
 
 Section: 2.5 
 
 Page : 
 
 2 of i 7 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
A pointer used as a procedure operand may specify a nonterminal 
 node in the data set. This indicates that the data subset subsumed by the 
 node must be available for access as a procedure operand. In this case 
 the pointer register associated with the operand may vary over the entire 
 subset. 
 
 In example 1 of Section 2.U, F(2,3,l) or F(2).A2(l) are pointers to 
 the ninth byte of F. Since a subscript may be an operand, pointers may be 
 used recursively. Thus, in Example 2 of Section 2.U, F(3,F.A1 (1,2), 2) points 
 to the second element of the element of A2 given by the value of the l6 bit 
 positive integer at the second byte of Al. 
 
 Examples : 
 
 A(1).B.C 
 
 A(l,2) 
 
 B 
 
 D . E 
 
 Date: 3/7/68 
 Section: 2,5 
 Page: 3 of iy 
 Revision: 
 
 IBAL MANUAL 
 
2.5.2 Operand 
 
 <modifier> ::= <constant expression> 
 <modification operator> ::= + - | = 
 <tag> ::= <symbol> <self-defining value> 
 <pointer specif ication> ::= <tag> [*] 
 
 <tag> <modifi cation operator> <modifier> 
 
 <pointer> 
 <operand> ::= L*J <pointer specification> [*] 
 <literal> 
 
 An operand may explicitly identify a pointer register name and opera- 
 tions on the named pointer register, or it may identify a pointer, or be a 
 literal. The machine form of an operand will always contain a pointer 
 register name. 
 
 A tag is a symbol or a self defining value, evaluated modulo 2 , 
 specifying a U-bit pointer register name. 
 
 An asterisk following the tag specifies indirect replacement if 
 no modifier is present. 
 
 A modifier is a constant expression specifying a l6-bit pointer 
 value. If the constant expression contains no register symbols, it is a direct 
 modifier and will be evaluated modulo 2 . If the constant expression con- 
 tains a register symbol, it is an indirect modifier and will be evaluated 
 modulo 2 . The value of the predefined register symbol 0S, which specifies 
 the operand stack, is '1111' B when it is used in a modifier expression. 
 
 The modification operator specifies one of the following three 
 possible operations on the named pointer register: 
 
 + addition 
 
 conditional subtraction 
 = replacement 
 
 Date: 
 
 T/30/T1 
 
 Section: 2.5 
 
 Page : 
 
 h of yj 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
Pushing or popping of the named pointer register is indicated by a 
 slash before or after the pointer specification respectively. 
 
 When a literal is used as an operand, a pointer register is allocated 
 from those assigned to the base field of the literal pool. 
 
 Date: 2/26/68 
 Section: 2.5 
 Page: 5 of 17 
 
 Revision: 
 
 IBAL MANUAL 
 
2.5.3 Data Transfer 
 
 <register variant> ::= f|l|v|r 
 
 <field designator> ::= <cell size> | <register variant> 
 
 <basic data transfer> ::= <type 1> [<field designator>] , [.] <operand> 
 
 | <type 2> [<field designator>] 
 , [ . ] <operand>, [ . ] <operand> 
 
 <type 1> ::= PUSH | P/5P | LD | ST | SET | RESET [ TEST] TESTM 
 
 <type 2> : : = ASSIGN 
 
 The basic data transfer instructions (single cycle) operate on either a cell 
 
 size in core or a full word register. An operand specifies a cell in core by naming a 
 pointer register. If a period precedes the operand it is an immediate operand 
 which indicates that the contents of the named pointer register is the operand. 
 field designator specifies the actual cell size in core or the part of the 
 I'egister to be operated on, as given below: 
 
 field designator meaning 
 
 B 1 byte (Byte) 
 
 2 bytes (Half word) 
 
 W k bytes (Word) 
 
 D 8 bytes (Doubleword) 
 
 F k flag bits (Flags) 
 
 L left 16 data bits (Link) 
 
 V right 16 data bits (Value) 
 
 R all 36 bits (Register) 
 
 The cell size or register variant may only be omitted if the instruction is 
 . the scope of a SETCS or SETRV directive respectively. 
 
 7/30/Tl 
 
 Section: 2.5 
 Page: 6 of yj 
 Revision; 
 
 IBAL MANUAL 
 
 i 
 
2. 5. J* Stack Utility, Logical and Shift 
 
 <count> : : = <operand> 
 
 <logical> ::= <type 3> [<cell size>] 
 
 | <type k> [<cell size>], <count> 
 
 | <type 5> [<cell size>] [, <count>], <operand> 
 
 <type 3> ::= £>NE ] ZER0 | N0T | c/UNT|BIT|AND |0R \xfiR |EQV |CPRL |XCH |DUP | SLUFF 
 
 <type k> : := LS|RS 
 
 <type 5> : : = SCAN | SCANM 
 
 Logical instructions of type 3 include stack utility instructions; 
 
 Exchange, Duplicate and Sluff. 
 
 Type h are shift instructions. 
 
 Type 5 are field comparison instructions. 
 
 Date: 7/26/71 
 Section: 2.5 
 Page: 7 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.5«5 Decision 
 
 <decision> ::» <type 12> J^cfcnditioi^ J..1 labfel* 
 <type 12> ::= IF|'OT 
 <condition> ::= <|= |>|FM|j&v|CS 
 
 Each condition specified in a decision instruction sets the corre- 
 sponding bit in the mask byte of the instruction. 
 
 CS = Conditional Subtraction 
 OV = Overflow 
 FM = Flag Match 
 
 
 Date: 7/26/71 
 Section: 2.5 
 Page: 8 of 17 
 Revision: 
 IBAL MAMJAL 
 
 
2.5.6 Utility 
 
 <segment administration> : 
 
 <type 9> : : = LBR | SBR 
 <type 10> : : = LAR | SAR | L0C 
 
 = <type 9>, <operand>, <operand> 
 | <type 10> 
 
 A base register points to the "beginning address of a segment and works 
 as a data "base for that segment. 
 
 Date: 7/27/71 
 Section: 2.5 
 Page: o, of yj 
 Revision: 
 
 IBAL MANUAL 
 
2.5.7 List .Processing 
 
 <string and list processing> ::= <type 6> [,<count> ],<operand> 
 
 | <type 7 > » < operand> 
 I <type 8> [ , < count > ] , <operand> , <operand> 
 
 <type 6> 
 <type 7> 
 <type 8> 
 
 = PUSHF | P0PF | PUSHFR | P0PFR | PACK | UNPACK 
 = SL | SR | GETC | PUTC | INCL | INCR | DECL | DECR 
 = EDIT I TRANS I M0VE 
 
 Type 6 is part of an instruction set used in MULTIPLE cycle data 
 transfers. The first k are operand stack field transfer instructions and 
 the last 2 are binary conversion instructions. 
 
 Type 7 are list processing instructions and Type 8 are string manipulation 
 instructions. 
 
 Date: 
 
 3/7/68 
 
 
 Section: 2.5 
 
 
 Page : 
 
 10 of 
 
 17 
 
 Revision: 
 
 
 IBAL 
 
 MANUAL 
 
 
2 c *q Imprimitive Instruction 
 
 <entry name> ::= <label> 
 
 <operator mnemonio ::= G0 T0 CALL | EXECUTE 
 <operator> ::= <operator mnemonio <pointer specification> 
 G0 T0 <label> 
 
 CALL <entry name> <asynchronous information> 
 | EXECUTE <label> 
 | SPECIFY 
 <imprimitive instruction> : := <operator> J_, <operand> | EXIT 
 
 An imprimitive instruction causes operations on pointer registers 
 and usually a transfer of control. The operator mnemonics correspond to the 
 similarly named machine instructions. The operator pointer specification 
 may be a label in the G0 T0 and EXECUTE operator, and may be an entry name 
 in the CALL operator. 
 
 Date: 8/5/71 
 Section: 2.5 
 
 Page: 11 of 17 
 Revision: 
 
 IBAL MAMJAL 
 
2.5.8«1 Asynchronous Information 
 
 Asynchronous information> ::= [TASK [ (<task name>}] ] 
 
 J_EVENT (<event name>) 
 [PRIVITY (<integer expression^ ] 
 
 <task narae> ::= <identifier> 
 
 <event name> ::= <identifier> 
 
 The occurrence of any asynchronous information with the CALL operator 
 will inform the execution time system that the calling program and the called 
 procedure may be executed concurrently. Programs or parts of programs which may 
 be executed simultaneously are called tasks . These three types of information 
 are called the task , event , and priority options. 
 
 The event option defines an event name which may be used to test 
 whether or not the called task is completed. The event name is a pointer to a 
 binary value which is set to 'O'B on execution of the call and set to ' l'B on 
 completion of the called task. With the above definition, we can have differei 
 event completion in different stages of Task being processed. 
 
 The priority option sets the priority of the procedure, relative 
 to the calling task, as the value of the integer expression relative to one. 
 A negative value inverts the ratio. 
 
 The task option need not be given if the event or priority options 
 are given unless a task name is desired. 
 
 Date: 8/5/71 
 Section: 2.5 
 p age 12 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.5.9 System Instructions 
 
 < system> : := < supervisory> | < interrupt> | < input-output> 
 < coordinating> | < timing> 
 
 2.5.9.1 Supervisory 
 
 < supervisory> : 
 
 = { S VC I S VR I ACTP I LTR | STR } 
 I SLEEP, < operand> 
 I {RNAM|rESU}, < operand>,< operand> 
 
 2.5.9.2 Interrupt 
 
 < interrupt> ::= INRT| SIM, < operand> 
 
 2.5.9.3 Input /Output 
 
 < input /out put > : 
 
 = SIOlHIOlLIBR}, < operand> 
 
 2.5.9.U Coordinating 
 
 < coordinating> : := WHO|INCK,< operand> 
 
 LINK, < operand> , < operand> 
 
 2.5.9.5 Timing 
 
 timing> : : = RDCLK | STTIM | RDTIM 
 
 Date : 8/5/71 
 Section: 2.5 
 Page: 13 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.5.10 Arithmetic 
 
 <number type> ::= S|l|f|d 
 
 <arithmetic> : : = <type 11> [<number type>] 
 
 <type 11> ::= NEG| ABS |MNS | TA |ADD | SIB|mULT|dIV|CPRA|Pj0LY|CVD|CVF |CVL 
 
 The arithmetic instructions specify arithmetic operations on one of 
 four possible number types: 
 
 number type meaning 
 
 S Short Fixed point (halfword) 
 
 L Long Fixed point (word) 
 
 F Floating point (doubleword) 
 
 D Decimal (doubleword) 
 
 The number type may be omitted only if the instruction is within the scope of a 
 SETNT directive. 
 
 The TP is capable of doing some of these arithmetic operations with 
 certain data types. 
 
 Date: 2/26/68 
 Section: 2.5. 
 p ag e: Ik of 17 
 
 Revision: 
 
 IBAL MANUAL 
 
2. 5 •!! Pattern Articulation 
 
 <pattern articulation> : : 
 
 = <0-plane> 
 | <l-plane> 
 | <2-plane> 
 | <3-plane> 
 | <multi-plane> 
 < border> 
 
 <0-plane> 
 <l-plane> 
 
 = T0P0Lj6GY [ {RECTANGULAR | HE XAG0NAL}] 
 
 [{ PLANAR | T^R^I DAL]] | RESUME | RESTART | SETORG , < operand> 
 
 = {CLEARP|SETP},_[<ID variant>J_,<plane name> 
 {TESTP 1 TESTB |LISTI |ERASEP) ,<plane name> 
 SHIFT, <plane name>,<displacement> 
 {TALLY | TALL YHj£>] ,<plane name>,<direction list> 
 {AREA |LIST|LISTSZ IlISTLZ] ,<plane name>[ ,<count>] 
 {PLpT|PL0TSZ|PLj6TLZ|PL0TI],<plane name>,<string name> 
 READLZ | RDERLZ ,<plane name> 
 {WRITLZ IWRERLZ] ,<plane name> 
 
 = p|e|w|n|s|ne|nw|se|sw 
 
 = <operand> 
 <displacement> ::= <operand> 
 <direction list> ::= <operand> 
 <string name> : : = <operand> 
 
 <2-plane> : : = (COPY | COPYC | PLAND | PLOR | PLNAND | PLNOR | PLEXOR | PLEOV} ,< plane name> , 
 <3-plane> :: = CONNECT, <plane name>,<plane name> < plane name> 
 
 [,<plane name>] ,<direction list> 
 <multi~plane> ::= REPLICATE |GATEIA,< IAWORD word> 
 
 Bj6/)LE,<ava liability list>,<operand> 
 <availability list> ::= <constant>|<symbol> 
 
 <ID variant> 
 <plane name> 
 
 Date : 8/5/71 
 Section: 2.5 
 Page: 15 of 17 
 Revision: 
 
 IBAL MANUAL 
 
<border> ::= {L0ADB| ST0REB |PUSHB|P0PB} , <gbw> ,<string name> 
 
 M0VEB,<gbw> ,<plane name>,<plane name> 
 <gbw>::= <ccnstant> | <symbcl> 
 
 The pattern articulation instructions specify operations performed 
 by the pattern articulation unit of the Illiac III. 
 
 The default options in the T0P0L0GY instruction are RECTANGULAR 
 and PLANAR. 
 
 Plane names, displacements, direction lists, and string names 
 are specified by general operands- Availability lists, gatewords , and 
 gbwords are constants. These constants may be specified directly in the 
 instruction or by a symbol which is assigned a value by an assignment 
 
 directive . 
 
 The availability list tells what planes in the Iterative Array 
 may be used as scratch planes in the evaluation. 
 
 Date: 7/26/71 
 Section: 2-5 
 Page: 16 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.5.11.1 Boole Function 
 
 < Boole function> ::= BOOFUN [#] <dentifier> =< character string> 
 An operant phrase in BOOLE instruction is the address of a 
 
 variable length field which describes in Polish notation, the Boolean 
 function to be executed. 
 
 The PAU expects the following form for general boolean function: 
 
 < function> ::= < term string>; 
 
 < term string> ::= < term> | < term>; < term string> 
 
 < term >::= < elementary function> < elementary function> < operator 
 
 string> 
 
 < operator string> ::= < secondary operator> | < secondary operator> 
 
 < operator string> 
 
 Here an elementary function is defined as any function meeting 
 both of the following criteria: 
 
 1) The domain of the function is restricted either to (a) any one 
 plane, or (b) the vertical column passing through bit position 0. 
 
 2) The function is a simple Boolean sum (OR) or a simple Boolean 
 product (AND) of the individual (true and/or complemented) 
 variables. 
 
 If is not specified before < identifier> then the character string 
 is in the form of familiar Boolean expression as defined in this manual (2.U.2). 
 For details about implementation see Illiac III Reference Manual VOL. II, 
 Example 1. Boolean Expression 
 
 BOOFUN P6 =-i(-|(10)&(12)&(i6)|(20))|(3U)&(38); 
 
 Example 2. Canonical form 
 
 BOOFUN #P6 = [-r(l0)&(l2)&(l6)];[20]|-, ;[(3U)&(38)]|; 
 
 Date: 7/30_/7_l 
 Section: 2.5 
 Page 17 of 17 
 Revision: 
 
 IBAL MANUAL 
 
2.6 Input /Output 
 
 < command> ::= < interrupt command> | < device dependent command> 
 
 | < device independent command> 
 
 Input/output commands are used to control the transmission 
 of data between the main store and peripheral devices. Commands are 
 interpreted by input /output processor (lOP) of the Illiac III. 
 
 I/O commands are subdivided into three main classes. 
 
 2.6.1 Interrupt Command 
 
 < interrupt command> ::= SIO,< channel name> , < pointer value> 
 
 J_, < channel name>J_ 
 |HIO,< program tag> 
 |LIBR S < BR tag>,<base register contents> 
 
 < channel name> ::= < constant expression> 
 < pointer value> : := < constant expression> 
 
 < program tag >::= < symbol> | < self defining value> 
 
 < BR tag >::= < symbol> | < self defining value > 
 
 < base register contents >::= < constant expression> 
 
 Channel name specifies one of 8 channels in an IOP, and it is 
 evaluated modulo 8. 
 
 A pointer value is a constant expression specifying -^ command pointer 
 and it is evaluated modulo 2 
 
 Program tag specifies a program register name and is evaluated modulo 8, 
 
 BR tag specifies one of two base registers in an IOP, namely Command 
 Base Register (CBR) or Descriptor Base Register (DBR). By convention the 
 first channel name in SIO is also the program name. 
 
 SIO command can be followed by at most two other channel names. 
 
 Date: 8/U/T1 
 
 Section: 2*6 
 
 Page: 1 of 3 
 
 Revision: 
 
 IBAL MANUAL 
 
2.6.2 Device Dependent Command 
 
 < device dependent command> ::= < DDC mnemonic>J_< DDC tag>J_, 
 
 < extended device address> 
 
 < DDC mnemonio ::= READ | READR | SENSE | WRITE | CONTROL | TESTDS | POLL 
 
 < DDC tag> ::= RD|DEI |p.|PO|R 
 
 < extended device address> ::=< rate code>,< channel name> , 
 
 < device address> 
 
 < rate code> ::= < constant expression> 
 
 < device address> ::=< constant expression> 
 
 The mnemonic part of the device dependent command is followed by any- 
 permissible combination of DDC tags: RD, DEI, P, PO, R which specify 
 
 RELEASE DEVICE, DEVICE END INTERRUPT, PROCEED, PARITY OVERRIDE and RESTART 
 respectively. For details see Illiac III Reference Manual III [l]. 
 
 The rate code is related to actual device rate and is evaluated 
 modulo 8. 
 
 As the channel name specifies, one of 16 channels in Illiac III is 
 evaluated modulo 16 in a DDC. Device address is evaluated modulo 28. 
 In this way symbolic representation of channels and devices can be used. 
 
 Date 
 
 : 8A/71 
 
 Sect 
 
 ion : 
 
 2.6 
 
 Page 
 
 : 2 
 
 of 3 
 
 Revi 
 
 sion 
 
 
 
 IBAL 
 
 MANUAL 
 
2.6.3 Device Independent Command 
 
 < device independent command> ::= < DIC mnemonio < field designator> , 
 
 < DIC tag> < modification operator> 
 
 < modifier> 
 
 < DIC mnemonio : : = LOAD | STORE | SETM | RESETM | TESTANY | TESTALL | MODIFY | STOP 
 
 < DIC tag> ::=< program or channel> , < name>,< register address> 
 
 < program or channel> ::=pjc 
 
 < name >::= < identifier>| < self defining value> 
 
 < register address >::= < identifier> | < self defining value> 
 
 These commands are usually used for bookkeeping operations, e.g. 
 address modification, loading and storing the contents of a program or 
 channel register. 
 
 The mnemonic part consists of the command mnemonic followed by the 
 field designator for the register to be operated on. This field designator 
 is interpreted as for the taxicrinic processor. 
 
 A register specification containing a tag part and an operational 
 modifier part follows the mnemonic byte. 
 
 P and C specify Program and Channel module respectively. The name 
 of the module is given by the name which is evaluated modulo 8. 
 
 Register address specifies the register to be modified and is 
 evaluated module 16. Programmers are not allowed to access registers 
 SDR, CBR, and CSBR. 
 
 The modification part is interpreted the same way as in TP and must 
 always be specified. 
 
 Date: 8/9/71 
 Section: 2.6 
 Page 3 of 3 
 Revision: IBAL MANUAL 
 
2.7 Directives 
 
 <directive> ::= <control directive> 
 
 | <assignment directive> 
 | <source format directive> 
 | <assembler directive> 
 
 A directive is a statement which may result only in action by the as- 
 sembler at translation time or may cause code to be executed at run time or both, 
 
 2 . 7. 1 Control Directive 
 
 <control directive> ::= ENTRY 
 
 | RETURN 
 
 | WAIT <event name> 
 
 An ENTRY or RETURN directive may appear only within a procedure. An 
 ENTRY directive specifies an entry point to the procedure in which it occurs. 
 That is, the scope of the label of the entry statement is the same as the scope 
 of the procedure name. An entry name is either an entry label or a procedure 
 name. An unlabeled ENTRY is a dummy item. When a procedure CALL is executed, 
 instruction execution begins at the entry point specified by the entry name and 
 terminates when the procedure END or a RETURN directive is encountered. These 
 are the only valid returns since only they will free the local variables of the 
 procedure block. In all other respects the return is equivalent to an EXIT in- 
 struction. 
 
 For coordination of tasks, the WAIT directive is provided. Execution 
 of the statement containing the WAIT directive causes the task in which it is 
 located to be halted until the value of the event name equals 'l'B. 
 
 Date: 
 
 8A/71 
 
 Section: 2.7 
 
 Page: 
 
 1 of 5 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
2.7.2 Assignment Directive 
 
 <assignment directive> ::= ALLOCATE ][_, <pointer> -> <tag> 
 
 EQU , <constant expression> 
 
 The ALLOCATE directive is provided for the user to optimize allocation 
 of p Lnt> v registers to symbolic pointers. For each pointer named, the pointer 
 value and "base are determined and loaded into the pointer register specified by 
 
 tai xecution of any subsequent statements. This tag may then 
 
 be used subsequently as a pointer specification to point to the desired data 
 element . In this way the complicated allocation and transformation operations 
 from pointer to tag can be avoided for subsequent references to the same element. 
 
 The EQU directive defines a compile time symbol. A label on the EQU 
 statement is defined as a symbol whose value is equated to the value of the con- 
 stant expression. Symbols may be used as primaries in constant expressions. 
 
 Da: 
 
 
 Section: 2.7 
 
 Page: 
 
 2 of 5 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
2,7.3 Source Format Directive 
 
 <column> :: = <unsigned integer> 
 
 <source format directive> ::= LINE [<column>, <column>, <column>] 
 
 | LINE FREE 
 
 The source format directive defines a line format for the source lan- 
 guage. The defined format will be used for all lines following the present LINE 
 directive, up to and including the next LINE directive. Free format is assumed 
 up to the first LINE directive. 
 
 The line format is specified by three integers: i, j, k where i, j, k 
 < 80. , Each line is interpreted as one statement. Only columns i through k in- 
 clusive on a line are assumed to be characters in the program, although the 
 whole line is listed. If column k is blank, it is interpreted as the semicolon 
 ending the statement; otherwise, the next line continues the same statement. 
 
 A statement label may appear in column i through j-2. No colon is 
 necessary following the statement label in this position. 
 
 Columns j through k-1 are interpreted exectly as in format-free IBAL 
 and may be considered as the operation field of the statement. 
 
 If an asterisk appears in column i of a line, then the line is listed 
 but is otherwise ignored by the assembler. 
 
 Format: 
 
 Column 
 
 label 
 
 t 
 
 statement 
 
 blank 
 
 U 
 
 lank or specifies 
 continuation 
 
 The LINE directive may occur outside of the program, since it is ig 
 nored after the first scan. For example, it may appear on the line preceding 
 the first program line. 
 
 Date: 8 A/71 
 Section:2.7 
 Page: 3 of 5 
 Revision: 
 
 IBAL MANUAL 
 
Example : 
 
 1 
 
 
 10 
 
 72 
 
 
 
 
 LINE 1, 10, 72 
 
 
 
 A 
 
 
 BEGIN 
 
 
 
 * 
 
 
 SAMPLE PROGRAM 
 
 END A 
 
 
 
 Two additional variations on the LINE directive are provided. The 
 ■standard line format for IBAL will be defined as the format specified by the 
 directive: LINE 1, 10, 72. Therefore, the occurrence of LINE with no numbers 
 following it will be equivalent to LINE 1, 10, 72. Also, LINE FREE will specify- 
 free -format . 
 
 Date : 
 
 8/4/71 
 
 Section: 
 
 2.7 
 
 Page : h 
 
 of 5 
 
 Revision: 
 
 
 IBAL MANUAL 
 
2 7.1+ Assembler Directive 
 
 <assembler directive> ::= DC J[_, [ (<unsigned integer>)] <constant> 
 
 SETCS <cell size> 
 SETNT <number type> 
 SETRV <register variant> 
 FILNUL <cell size> 
 FILN0P <cell size> 
 
 The assembler directives cause action only at translation time 
 
 The DC, define constant , directive is for the insertion of data into a 
 program. The binary representation of each constant is determined, as stated in 
 Section 2.2.U, and placed into store by the assembler at the location assigned 
 to the position in the program where the directive appears. The optional integer 
 preceding the constant is a duplication factor which specifies the number of 
 times that the entire constant will be placed sequentially in the store. 
 
 The SETCS, SETNT, and SETRV directives define a cell size, number 
 type, or register variant respectively for all the basic data transfer or arith- 
 metic instructions within their scope which do not have the optional field des- 
 ! ignator or number type specified. The scope of a SETxx directive is all in- 
 structions following the SETxx directive up to the next SETxx directive. 
 
 The FILNUL or FILN0P directives position the object code pointer on a 
 boundary which is a multiple of the specified cell size by filling the next n 
 bes (where n < cell size) with zeroes or NjfrP instructions respectively, and 
 incrementing the object code pointer as each byte is filled. 
 
 Date: 8 A/71 
 Section: 2.7 
 Page: 5 of 5 
 Revision: 
 
 IBAL MANUAL 
 
3. Segmentation 
 
 An important aspect of the storage allocation performed by the IBAL 
 translator is segmentation . Segmentation is desirable when operating in a time- 
 sharing or multi-programming environment . A segment is a group of consecutively - 
 addressed words in storage with a fixed maximum length. Segments are the basic 
 units handled in allocation between primary and secondary storage devices. 
 During the execution of a block B, only those segments whose scope includes B 
 will need to be available in primary storage. 
 
 3.1 Procedure Segments 
 
 A program will be segmented according to block structure. The user 
 may specify that a procedure block is to be a separate segment by including the 
 reserved word SEGMENT after the reserved word PROCEDURE at the beginning of the 
 block. Compare Wirth [6] . 
 
 In addition, the translator will segment a program even when the user 
 does not specify it, if the program is too large. The user will be informed of 
 the action taken. All the executable instructions of one block will always be 
 contained in the same segment. Consequently no program will be compiled if the 
 storage required by one block exceeds the maximum segment size. 
 
 Date: 2/9/68 
 Section: 3.1 
 Page: 1 of 1 
 Revision: 
 
 IBAL MANUAL 
 
3.2 Data Segments 
 
 Data sets declared within a block may also be segmented. The collec- 
 tion of data declared by one DECLARE statement will always be contained in the 
 same segment. The user may specify that a new data segment is to be started by 
 including the reserved word SEGMENT after the reserved word DECLARE in the dec- 
 laration. 
 
 Example : 
 
 A: BEGIN ; 
 
 DECLARE Fl (N), 2 W ; 
 DECLARE SEGMENT F2 D, J H ; 
 
 END A 
 
 In this example F2 and J will be in the same segment, but Fl will be 
 located in another segment. 
 
 Date: 
 
 2/9/68 
 
 Section: 3.2 
 
 Page: 
 
 1 of 1 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
3. 3 Storage Attributes 
 
 <storage attribute> : := RD0NLY 
 
 [•WR0NLY 
 
 | c/ntigu^us 
 
 Storage attributes may be specified for procedures or data seg- 
 ments by additional reserved words following the reserved word SEGMENT. 
 
 The access rights to the segment may be restricted to read only or 
 write only by the inclusion of the reserved words RD0NLY or WR0NLY respectively 
 
 The attribute C0NTIGU0US specifies that the segment must occupy 
 contiguous locations in storage. Thus the Illiac III partioned storage mode 
 may not be used, and the segment specified by the user may not be further 
 segmented. 
 
 Date: 
 
 3/7/68 
 
 Section: 3.3 
 
 Page : 
 
 1 of 1 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
3.U Intersegment Communication 
 
 Each program translated by the IBAL translator will be a task 
 in the system. A task is the smallest piece of work which can be scheduled 
 to run in the system. Every task is run as an independent unit of work 
 but it can invoke other tasks which may run simultaneously in the system. 
 Synchronization between tasks is done with asynchronous information which 
 is specified by the caller to the operating system. 
 
 Each task in the system has a segment table which contains all 
 information necessary to run the task successfully. Among this information 
 is an entry for each segment known to the task. 
 
 Each segment is assigned an internal number which is its index 
 of entry in the segment table. Generally a shared segment has different 
 internal names within tasks which are communicating with it simultaneously. 
 
 The IBAL translator generates a segment table with an entry for 
 all internal segments which are known to the program at translation time. 
 
 Internal segments are generated by user (specifying SEGMENT 
 attribute) or by translator at compile time. There can be Data, BEGIN, or 
 Procedure Segments. A procedure segment is made of three distinguished parts: 
 
 1) External reference list: placed at the beginning of the segment 
 
 2) Prologue: placed before Procedure Code 
 
 3) Code 
 
 All internal segments are made known to the program at the compilation 
 
 time (but not necessarily all loaded into core memory) and external segments 
 
 are only made known when they are referenced at run time. For details 
 
 of dynamic intersegment linking, see Illiac III Reference Manual, Vol. IV, 
 
 Supervisor Organization. 
 
 Date: 7/30/71 
 Section 3.k 
 Page: 1 of 1 
 Revision: 
 
 IBAL MANUAL 
 
h. Pointer Register Allocation 
 
 When a pointer is transformed into an operator or operand pointer 
 specification, the tag is initially unknown and the assembler must therefore as- 
 sign a pointer register to be used. Before execution of the instruction which 
 contains the pointer, the correct pointer value is loaded into the assigned 
 pointer register and the pointer register base name is set to correspond with 
 the base field of the data file. Depending on the complexity of the data file 
 and pointer, the transformation from pointer to primitive phrase may produce a 
 long execution-time access routine. 
 
 Pointer register allocation is performed by the IBAL system in the 
 following manner: 
 
 1. The number of base fields used by the program data items is deter- 
 mined. 
 
 2„ Pointer registers 7 through 12 are allocated in a cyclic order to 
 the base fields. 
 
 3. Pointer registers assigned to one base field are assigned in a 
 cyclic order to pointers of this base field which appear in the 
 program. 
 
 h. If a control operation intervenes between uses of the same pointer, 
 the pointer value will be reloaded into the allocated register. 
 
 Eras, the file system uses pointer registers 7 through 12. If the user has 
 pointers to data elements in his program, he must be careful about the use of 
 these registers „ 
 
 Example : 
 
 Program 
 
 P: BEGIN ; 
 
 DECLARE A W, B W, C W ; 
 
 SETCS W : 
 
 Date : 
 
 2/9/68 
 
 Section: h 
 
 Page : 
 
 1 of 2 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
PUSH 
 PUSH 
 
 8 
 
 11 
 
 BEGIN 
 
 DECLARE D W, E W, F W 
 
 PUSH 
 
 , D 
 
 PUSH 
 
 , B 
 
 TEST 
 
 , D 
 
 POP 
 
 , F 
 
 9 
 
 8 
 
 9 
 
 12 
 
 END 
 END 
 
 If A, B, C are assigned to base field 1, and D, E, F are assigned to base field 
 ..-. , and if the following assignments of pointer registers to these base fields is 
 
 
 BR1 
 BR2 
 
 PR8 
 PR9 
 
 PR11 
 PR12 
 
 '.:•. n the pointer register assignment to pointers is shown in the right hand col- 
 
 Date: 2/9/68 
 , ec.tion: h 
 Page: 2 of 2 
 Revision: 
 
 IBAL MANUAL 
 
BIBLIOGRAPHY 
 
 1. McCormick, B. H. , Nordmann, B. J., Jr., (ed.) "Illiac III Reference 
 Manual, Volume I: The Computer System, Department of Computer Science 
 Report No. U33, February IT, 1971. 
 
 2. McCormick, B. H. , Nordmann B. J., Jr., (ed.) "Illiac III Reference 
 Manual, Volume II: Instruction Repertoire", Department of Computer 
 Science Report No. 1+3 1 *, February 26, 1971. 
 
 3. McCormick, B. H. , Nordmann, B. J., Jr., (ed.) "Illiac III Reference 
 Manual, Volume III: Input /Output" , Department of Computer Science 
 Report (in progress). 
 
 k. McCormick, B. H. , Nordmann, B. J., Jr., (ed.) "Illiac III Reference 
 Manual, Volume IV: Supervisor Organization", Department of Computer 
 Science Report (in progress). 
 
 5. Naur, P. (ed.), Revised Report on the Algorithmic Language ALGOL 60. 
 Communications of the ACM 6 (Jan. 1963), 1-17. 
 
 6. IBM System/360 Operating System, PL/l (F), Language Reference Manual, 
 IBM Systems Reference Library, File NO. S360-29, Form C28-8201-2. 
 
 7. Wilbur, J. A., "A Language for Describing Digital Computers", Department 
 
 of Computer Science, University of Illinois, Report No. 197, February, 1966, 
 
 8. Bottenbruch, H. , "Structure and Use of ALGOL 60." Journal of the ACM9 
 (April 1962), 161-221. 
 
 9. Wirth, N. , "A Programming Language for the 360 Computers." Journal of the 
 ACM 1$ (Jan. 1968), 31-lh. 
 
 Date 
 
 : 7/26/71 
 
 
 Sect 
 
 Lon: Bibliography 
 
 Page 
 
 : 1 of 1 
 
 
 Revi 
 
 3 ion: 
 IBAL MANUAL 
 
 
APPENDIX 1. THE 60 CHARACTER SET 
 
 A2 o 1 Alphabetic Characters 
 
 Letters A, B, C, D, E, F, G, H, I, J, K, L, M, N, 0, P, 
 
 Q, R, S, T, U, V, W, X, Y, Z 
 
 Currency Symbol $ 
 
 Commercial At-sign @ 
 
 Number Sign # 
 
 A2 . 2 Numeric Characters 
 
 Digits 0, 1, 2, 3, k, 5, 6, 7, 8, 9 
 
 A2 .3 Special Characters 
 
 Blank 
 
 Equal or Assignment = 
 
 Plus + 
 
 Minus 
 
 Asterisk or Multiply * 
 
 Slash or Divide / 
 
 Left Parenthesis ( 
 
 Paght Parenthesis ) 
 
 Comma 3 
 
 Decimal Point or 
 Period 
 
 Quotation Mark ' 
 
 Percent % 
 
 Semicolon ; 
 
 Colon : 
 
 Not -1 
 
 And S~ 
 
 Or J 
 
 Greater Than > 
 
 Date: 2/9/68 
 Section: Appendix 1 
 Page: 1 of 2 
 Revision: 
 
 IBAL MANUAL 
 
Less Than 
 
 Break_Character 
 (Used as shown) 
 
 Question Mark 
 
 ! Date: 2/9/68 
 
 Section: Appendix 1 
 Page: 2 of 2 
 
 Revision: 
 
 IBAL MANUAL 
 
Appendix 2. Reserved Words 
 
 ABS ACTP ADD ALL0CATE AND AREA ASSIGN 
 
 B BEGIN BIT BO"OLE 
 
 C CALL CLEARP CONNECT CONTIGUOUS CONTROL COPY COPYC COUNT CPRA CPRL CS CVD CVF CVL 
 
 D DC DECL DECLARE DECR DIV DUP 
 
 E EDIT ELSE END ENTRY EQU EQV ERASEP EVENT EXECUTE EXIT 
 
 F FILNOP FILNUL FM FREE 
 
 GATEIA GETC GO" GOTO* 
 
 H HEXAGONAL HIQf 
 
 IF IFN INCK INCL INCR INITIAL INRT IAWOPD 
 
 L LAR LBR LD LIBR LIKE LINE LINK LIST LISTI LISTLZ LISTSZ LOAD LOADB LOG LS LTR 
 
 MNS MODIFY MOVE MOVEB MULT 
 
 N NE NW NEG NOP NOT 
 
 ONE OR g(S OV 
 
 P PACK PLANAR PLAND PLEQV PLEXOPv PLNMD PLNOP PLOP PLOT PLOTI PLO"TLZ PLOTSZ 
 
 POLY POP POPB POPF POPFR PR? PR1 PR2 PR3 PRU PR5 PR6 PR7 PR8 PR9 PRIO PR11 
 
 PR12 PR13 PRlH PRIOPITY PROCEDURE PUSH PUSHB PUSHF PUSHFR PUTC 
 
 R RDCLK RDERLZ RDONLY RDTIM READ READLZ READR RECTANGULAR RENA REPLICATE 
 
 RESET RESETM RESTART RESU RESUME RETURN RS 
 
 S SAR SBR SCAN SCANM SE SEGMENT SENSE SET SETCS SETM SETNT SETOBG SETP SETRV 
 
 SHIFT SIBR SIO" SIM SL SLEEP SLUFF SPECIFY SR ST STOP 3 STOPE STOPEB STR STRING 
 
 STRUCTURE STTIM SUB SVC SVR SW 
 
 TA TALLY TALLYH0 TASK TEST TESTALL TESTANY TESTB TESTDS TESTM TESTP THEN TI0 
 
 T0P0L0GY T0R0IDAL TRANS 
 
 UNPACK 
 
 V VECTOR 
 
 W WAIT WHO 1 WRERLZ WRITE WRITLZ WRONGLY 
 
 X XCH X0R 
 
 ZER0 
 
 Date 
 
 : 7/26/71 
 
 Sect 
 
 ion: 
 
 Appendix 2 
 
 Page 
 
 : 1 
 
 of 1 
 
 Revi 
 
 sion 
 
 
 
 IBAL 
 
 MANUAL 
 
Appendix 3° Complete IBAL Syntax 
 
 |@|# 
 
 Basic; Elements 
 
 <alphabetic> ::=A|BiCJD|E|F|G|H|l|j|K|L|M|N|o|p|Q|R|s|T|u|v|w|x|Y|z 
 
 <digit> ::= jl |2 |3 |U | 5 |6 |? |8 |9 
 
 <special character> : := +|- | = |* |/ | ( | ) |, | . | ' \%\ ; \ \: H&K !>!<!_ I? 
 
 <alphanameric> ::= <alpha'betic>|<digit> 
 
 <basic character> : := <alphanumeric>j<special character> 
 
 <identifier> n- <&lphabetic> <alphanumeric> [-] 
 
 <unsigned integer> ::= J[<digit>|j 
 
 <eomment> ::- /*<any "basic character string not containing */> */ 
 
 <name> :: = <identifier> 
 
 <event name> ::- <identifier> 
 
 <task name> :;= <identifier> 
 
 <parameter> ::= <identifier> 
 
 <label> .:- <identifier> 
 
 <symbol> ::---■ <identifier> 
 
 |<register symbol> 
 <regi ster sytabol> : : = ps\ PRO j PR1 i PR2 | PR3 | PRU | PR5 | PR6 | PR7 | PR8 | PR9 | PR10 | PR11 1 PR12 
 
 |PR13|PR1'4 
 <cell size> ::= B|ri|WJD 
 
 gi s t e r var i a nt> : : - F j L | V | R 
 < number bype> : ° ■- S | L | F j D 
 <hexadigit> : . - <digit> j A |B j C | D j E |F 
 
 b j t> ■.■■-- 1 1 
 <sigr> ::= +|.. 
 
 <exponent> :.- E[<sign>] ^unsigned integer> 
 <scale field> ::- S[<sign>] <unsigned integer> 
 
 irria'J number> . :: -■- [<s.ign>] (<unsigned integer> [.] [<unsigned integer>] 
 | .<unsigned integer>} [<exponent>] 
 
 Date: 7/26/71 
 Section: Appendix 3 
 Page: 1 of 9 
 Revision: 
 
 IBAL MANUAL 
 
<binary number> : : = J <bit> j [<scale field>] 
 
 <nex number> ::= J[ <hexadigit> ][ [<scale field>] 
 
 <character string> ::= <string of basic characters with ' occuring only in 
 
 adjacent pairs> 
 <constant data bits> ::= ! <character string>' C 
 
 '<binary number> J , <binary number> J 'B 
 '<hex number> J , <hex number> J 'X 
 | <decimal number> <number type> 
 <constant flag bits> ::= * { <bit> J 'F 
 <constant> ::= <constant data bits> [<constant flag bits>] 
 
 | <constant flag bits> 
 <literal> ::= = <constant> 
 self -defining value> ::= <unsigned integer> 
 
 '<binary number>' B 
 '<hex number>' X 
 '<character string>' ^ 
 <pnmary> ::= <self -defining value> 
 | <symbol> 
 | <label> 
 
 (<constant expression>) 
 <term> : - [<term> {*|/}] <primary> 
 
 <cor.stant expression> ::- [ [<constant expression>] { + - } ] <term> 
 <integer expression^ ::= <constant expression> 
 
 | <operand> 
 
 Program 
 <statement> 
 
 <declaration> 
 | <instruction> 
 | <directive> 
 | <block> 
 I <label> : <statement> 
 
 Date: 2/ll+/68 
 Section: Appendix 3 
 Page: 2 of 9 
 Revision: 
 
 IBAL MANUAL 
 
c block > ::= BEGIN ; ]_^statement> ;]_ END 
 
 | PROCEDURE[ SEGMENT]/ storage attribute>J_] [( <parameter>]_, parameter >J_) ]; 
 ]_<statement>;]_ END 
 
 | <label> : <block> [<label> ] 
 <program> ::= <block> ; 
 ^storage attribute- : := RD0NLY | WR0NLY | C0NTIGU0US 
 
 Declaration 
 
 <declaration> : := {DECLARE [ SEGMENT^ storage attribute>]_ ] | STRUCTURE} 
 
 < format item> J_ { , | f ) <format item> J_ 
 < format item> ::=[<level>] [[ * 1 <name>] [<attributes> ] 
 <level> : := <unsigned mteger> 
 <attributes> ::= <nonterminal node attributes> 
 
 <terminal node attribute> 
 <nonterminal node attributes.-' : : =[ ( <bounds>J_, <bounds>J_)] 
 
 [{STRING | VECTOR}] 
 -terminal node attribute> ::=<cell size> | <constant> |LIKE<name> 
 <bounds> ::= [< lower bound> : J <upper bound> 
 j > <bcund> 
 < <bound> 
 1* 
 <bound:- : : - <integer expressions 
 <lower bound> : := «■- integer expression> 
 capper bound> ::= < integer expression> 
 
 <constant list> ::= [(<unsigned integer>) ]<cspec>J_, [(^unsigned integer>) ]<cspec>_|_ 
 <cspec> : :=<constant> | * 
 
 < conditional format item> ::= < if clause> < simple format item> 
 
 ELSE < simple format item> 
 <if clause> ::= IF <Boolean expression> THEN 
 
 < Boolean expression> ::= < Boolean term>_|_| < Boolean term>_|_ 
 
 < Boolean term> ::= < Boolean factor> &< Boolean factor>J_ 
 
 < Boolean factor> : :=(< Relation>) | < Logical value| 
 
 [*T ] ( < Boolean expression>) 
 
 < Logical value> ::= FALSE | TRUE 
 
 <relation> ::=<integer expression><relational operator> 
 
 <integer expression> 
 
 . | . , , | | Date: 8/5/70 
 
 <relational operator>= > \~\> \>= \ = h = <= < n< ~ . . . 
 
 Section: Appendix 3 
 
 Page: 3 of 9 
 
 Revision: 
 
 IBAL MANUAL 
 
Instruction 
 
 <instruction> ::= <imprimitive instruction> 
 
 <basic data transfer> 
 <logical> 
 
 <string and list processing> 
 <segment administration> 
 <arithmetic> 
 <decision> 
 <supervisory> 
 < i nput /out put > 
 <pattern articulation> 
 N0P 
 
 <modifier> ::= <constant expression> 
 <modification operator> ::= + - = * 
 <tag> ::= <symbol> <self— defining value> 
 <pointer specif ication> ::= <tag> [ *] 
 
 <tag> <modification operator> <modifier> 
 <pointer> 
 <operand> ::= [/]<pointer specification> [/] 
 
 <literal> 
 <entry name> ::= <label> 
 
 <operator mnemonio : := G0 T0 CALL | EXECUTE 
 <operator> ::= <operator mnemonio <pointer specif ication> 
 G0 T0 <label> 
 
 CALL <entry name> asynchronous information> 
 | EXECUTE <label> 
 | SPECIFY 
 <imprimitive instruction> ::= <operator> J_, <operand> EXIT 
 <subscript> ::= <integer expression> 
 <pointer> ::= <name> [ ( <subscript>_|_, <subscript>J_)] 
 
 . • name> [ ( <subscript>J_, < subscript >J_)~|J_ 
 
 Date: 
 
 3/7/68 
 
 Section: Appendix 3 
 
 Page: 
 
 h of 9 
 
 Revision: 
 
 IBAL 
 
 MANUAL 
 
Asynchronous information> ::= [TASK [ (<task name>)]] 
 
 J_EVENT (<event name>)j[ 
 .PRIORITY (<integer expression>)] 
 <field designator> ::= <cell size> | <register variant> 
 <basic data transfer> ::= <type 1> [<field designator>] , [.] <operand> 
 
 | <type 2> [<field designator>] 
 , [ . ] <operand>, [ . ] <operand> 
 <type 1> :: = PUSH |P0P | LD | ST | SET | RESET | TEST |TESTM 
 <type 2> : := ASSIGN 
 <count> ::= <operand> 
 <logical> ::= <type 3> [<cell size>] 
 
 | <type h> [<cell size>], <count> 
 | <type 5> [ < cell size>] [, <count> ], <operand> 
 <type 3> ::= 0NE |ZER0 |n0t|C0UNT|BIT|AND|0R |X0R |EQV|CPRL |XCH |DUP | SLUFF 
 <type h> :: = LSJRS 
 <type 5> : : = SCAN | SCANM 
 
 <string and list processing> ::= <type 6> [, <count> ], <operand> 
 
 | <type "J>, <operand> 
 
 | <type 8> [ , <count> ] , <operand>, <operand> 
 <type 6> ::= PJSHF |?0PF | PUSHFR | P0PFR | PACK | UNPACK 
 <type 7> ::-= SL| SR | GETC ( FUTC | INCLJ INCR |DECL|DECR 
 <type 8> ::= EDIT | TRANS |M0VE 
 <segment administration> ::- <type 9 > ? <operand>, <operand> 
 
 | <type 10> 
 <type 9> : : = LBR | SBR 
 <type 10> : : - LAR | SAR | Lf)C 
 <arithmetic> ::- <type 11> [< number type>] 
 
 <type 11> ::= NEG| A3S |MNS | TA |ADD | SUB|MULT|DIV |CPRA | P0LY | CVD | C VF | CVL 
 <decision> ::= <type 12> j_, <condition> J_ ,<label> 
 <type 12> : :-- IFJIFN 
 <condition> ::= < | = |>[FM |0v| CS 
 
 Date: 2/lU/68 
 Section: Appendix 3 
 Page: 5 of 9 
 
 Revision: 
 
 IBAL MANUAL 
 
< system> ::= < supervisory > | < interru.pt> | < input-output> 
 
 < coordinating> j < timing> 
 
 < supervisory > ::={ SVC |SVR |ACTP |LTR |STR} 
 
 | SLEEP, < operand> 
 | { RNAM|RESU}, < operand>, < operand> 
 
 < interrupt > : := INRT |SIM, < operand> 
 
 < input-output > ::= {SIO |HIO |LIBR}, < operand> 
 
 < coordinating> : := WHO|lNCK, < operand> 
 <timing> ::= RDCLK ISTTIMJRDTIM 
 
 Date: 
 
 8A/71 
 
 
 Section: Appendix 
 
 3 
 
 Page: 
 
 6 of 9 
 
 
 Revision : 
 
 
 
 IBAL MANUAL 
 
 
< command> ::= < interrupt coramard>| < device dependent command> 
 
 | < device independent command > 
 
 < interrupt command> ::= SIO,< channel name> ,< pointer value> 
 
 I , < channel name>_|_ 
 |HIO, < Program tag> 
 |LIBR, < BR tag> , < base register contents> 
 
 < channel name> : := < constant expression^, 
 
 < pointer value> ::=< constant expression> 
 
 < program tag> : := < symbol> | < self defining value> 
 
 < BR tag> ::= < symbol> I < self defining value> 
 
 < t>ase register contents> ::=< constant expression > 
 
 < device dependent command> : := < DDC mnemonic> I < DDC tag> I , 
 
 <e xtended device a ddress> 
 
 < DDC mnemonic> : : = READ | READR | SENSE | WRITE | CONTROL | TESTDS | POLL 
 
 < DDC tag> ::= RD|DEI |P|po|R 
 
 < extended device address> ::=< rate code> , < channel name> , 
 
 < device address> 
 
 < rate code> :: = < constant expression> 
 
 < device address> ::=< constant expression> 
 
 < device independent command> ::=<DIC mnemonic> < field designator> , 
 
 < DIC tag> < modification operator> 
 
 < modifier> 
 
 < DIC mnemonio ::« LOAD | STORE | SETM| RESETM| TESTANY| TESTALL| MODIFY | STOP 
 
 < DIC tag> :: = < program or channel> , < name> , < register address> 
 
 < program or channel> : := P I C 
 
 < name> :::-.< identifier> | < self defining value> 
 
 < register address> ::= < identifier I < self defining value> 
 
 Date: Ii/9/71 
 Section: Appendix 3 
 Page: 7 of 9 
 Revision :IBAL MANUAL 
 
<pattern articulation> : := <0-plane> 
 
 <l-plane> 
 <2-plane> 
 <3-plane> 
 <multi -plane > 
 | < border> 
 O-plane : : = T(fedlrfGY [ {RECTANGULAR | HEXAGONAL} ] [ {PLANAR | TOROIDAL} ] RESTART 
 | RESUME | SETORG , < operand> 
 <l-plane> : := {CLEARP |SETP}, J_<ID variant> J_,<plane name> 
 | {TESTP|TESTB|LIST|ERASEP},<plane name> 
 SHIFT, ^plane name> ,< displacement > 
 {TALLY |TALLYH0} ,^plane name> ,< direct ion list> 
 {AREA|LIST|LISTSZ|LISTLZ },<plane name^ [,< count > ] 
 {PL0T|PL0TSz|PL0TLZ|pL0Tl},<plane name> ,<string name> 
 READLZ | RDERLZ ,<plane name> 
 {WRITLZJWRERLZ),<plane name> 
 <ID variant- ::= P | E | W | N | S | NE | NW | SE | SW 
 •"•plane name - •= <operand> 
 <displacement -• ;:= --'operand 5, 
 <directicn list-' : := <operand N 
 -string name- ::= < operand - 
 
 <2-plane> ::= {C0PYJC0PYC |PLAND| PL0r|pLNAND|pLN0RJPLEX0r|pLEQV} 
 
 ' : 3-plane> : := C0NNECT , --plane name- ,<plane name> [,<plane name> ] ,<direction list : 
 
 <multi-plane> ::- REPLICATE 
 
 I B00LE, -availability list> ,<operand>| GATEIA, < IAWORD word> 
 <availability list" ::= '-constant - I -'symbol > 
 
 < IAWORD word> 
 
 = < const ant> < symbol> 
 
 <border> : := [ L0ADB \ ST0REB |PU3HB | P0PB } , <gbw>, <st ring name > 
 
 | M/VEB, <gbv>,<plai:e name>,<plane name> 
 <pbv~> :*= ''constant > I '-symbol > 
 
 Date: 7/26/71 
 Section: Appendix 3 
 Page: 8 of 9 
 Revision: 
 
 IBAL MANUAL. 
 
Directive 
 
 <directive> ::= <contrcl directive> 
 
 I -assignment direct ive> 
 
 <scurce format directive> 
 | -^assembler directive> 
 <'contrcl directive? ::= ENTRY 
 
 | RETURN 
 
 | WAIT <event name> 
 
 •^assignment directive> ::= ALL0CATEJJ , <pointer> -> <tag>_ 
 
 EQU , <constant expression> 
 :column> ::= -^unsigned mteger> 
 <source fcrmat directive? ::= LINE[<column> ,<column> ,<column> ] 
 
 | LINE FREE 
 <assembler directive> ::= DC [_, [(<unsigned integer> ) ]<constant>_ 
 
 j SETCS<cell size> 
 j SETNT<number type> 
 | SETRV-'-register variant> 
 j FILNUL<cell size> 
 I FILN0P<cell size> 
 
 Date: 3/ 8/68 
 Section: Appendix 3 
 Page: 9 of 9 
 Revision: 
 
 IBAL MANUAL 
 
Appendix k. Sample Program Segment 
 
 /* Sample IBAL Program Segment */ 
 PROG: BEGIN; 
 
 STRUCTURE 1 V(lO) , 2 W ; 
 
 DECLARE A LIKE V , 
 B LIKE V , 
 C LIKE V ; 
 
 CALL VECTORADD, A(l), B(l), C(l), PR6 = 10; 
 
 VECTORADD: PROCEDURE (X, Y, Z, CNT)> 
 
 /* PERF0RMS ADDITION Z = X + Y WHERE 
 
 Z, X, Y are vectors of CNT elements */ 
 
 SPECIFY , 
 LOOP: PUSH W , 
 PUSH W > 
 ADD L 
 POP W . 
 
 X - k, Y - k, Z 
 
 X + k ; 
 Y + h j 
 
 9 
 
 Z + h , 
 
 - 4 
 
 GO TO LOOP , CNT - 1 ; 
 
 EXIT j 
 
 END VECTORADD ; 
 
 END PROG ' 
 
 Date: 
 
 3/ 
 
 '8/68 
 
 
 Section: 
 
 Appendix 
 
 h 
 
 Page : 
 
 1 
 
 of 1 
 
 
 Revision: 
 
 
 
 IBAL 
 
 MANUAL 
 
 

 
 Zero Operand Instruction Codes 
 
 Fla G 
 
 m 1 
 
 MN 2 
 
 MNEMONIC BIT: 
 
 INSTRUC1 
 
 ION 
 
 MNEMONIC BIT: 
 
 INSTRUC 
 
 noil 
 
 3 *i 5 6 7 8 
 
 
 
 3 1+5678 
 
 
 
 
 
 ZERO 
 
 (B) 
 
 10 
 
 SLUFF 
 
 (B) 
 
 1 
 
 ZERO 
 
 (H) 
 
 10 1 
 
 SLUFF 
 
 (H) 
 
 10 
 
 ZERO 
 
 (w) 
 
 10 10 
 
 SLUFF 
 
 (w) 
 
 11 
 
 ZERO 
 
 (D) 
 
 10 11 
 
 SLUFF 
 
 (D) 
 
 10 
 
 ONE 
 
 (B) 
 
 10 10 
 
 DUP 
 
 (B) 
 
 1 1 
 
 ONE 
 
 (H) 
 
 10 10 1 
 
 DUP 
 
 (H) 
 
 110 
 
 ONE 
 
 (w) 
 
 10 110 
 
 DUP 
 
 (w) 
 
 111 
 
 ONE 
 
 (D) . 
 
 ■ 1 1 i 1 
 
 1 
 
 DUP 
 
 (D) 
 
 10 
 
 COUNT 
 
 (B) 
 
 10 10 
 
 XCH 
 
 (B) 
 
 001001 — 
 
 COUNT 
 
 (H) 
 
 10 10 1 
 
 XCH 
 
 (H) 
 
 10 10 
 
 COUNT 
 
 (w) 
 
 10 10 10 
 
 XCH 
 
 (w) 
 
 10 11 
 
 COUNT 
 
 (D) 
 
 10 10 11 
 
 XCH 
 
 (D) 
 
 1 1 
 
 BIT 
 
 (B) 
 
 10 110 
 
 CPRL 
 
 (B) 
 
 110 1 
 
 BIT 
 
 (H) 
 
 10 110 1 
 
 CPRL 
 
 (H) 
 
 1110 
 
 BIT 
 
 (w) 
 
 10 1110 
 
 CPRL 
 
 (w) 
 
 1111 
 
 BIT 
 
 (D) 
 
 10 1111 
 
 CPRL 
 
 (D) 
 
 10 
 
 AND 
 
 (B) 
 
 110 
 
 NOT 
 
 (B) 
 
 I 1 
 
 AND 
 
 (H) 
 
 110 1 
 
 NOT 
 
 (K) 
 
 10 10 
 
 AND 
 
 (w) 
 
 1 1 I 
 
 NOT 
 
 (w) 
 
 1 1 1 
 
 AND 
 
 (D) 
 
 110 11 
 
 NOT 
 
 (D) 
 
 10 10 
 
 OR 
 
 (B) 
 
 110 10 
 
 ACTP 
 
 (#0) 
 
 10 10 1 
 
 OR 
 
 (H) 
 
 110 10 1 
 
 ACTP 
 
 (#1) 
 
 10 110 
 
 OR 
 
 (w) 
 
 110 110 
 
 ACTP 
 
 (#2) 
 
 1 1 1 1 
 
 OR 
 
 (D) 
 
 110 111 
 
 ACTP 
 
 (#3) 
 
 110 
 
 XOR 
 
 (B) 
 
 1110 
 
 INRT 
 
 
 1 1 1 
 
 XOR 
 
 (H) 
 
 1110 1 
 
 
 
 - 1010 
 
 XOR 
 
 (w) 
 
 1110 10 
 
 LTR 
 
 
 110 11 
 
 XOR 
 
 (D) 
 
 1110 11 
 
 STR 
 
 
 1110 
 
 EQV 
 
 (B) 
 
 11110 
 
 SVC 
 
 
 1110 1 
 
 EQV 
 
 (H) 
 
 , 111101 
 
 SVR. 
 
 
 11110 
 
 EQV 
 
 (w) 
 
 111110 
 
 OKOFF 
 
 
 11111 
 
 EQV 
 
 (DO . 
 
 111111 
 
 WHO 
 
 
 Appendix 5 
 
 Instruction Mnemonic Codes 
 
 7/26/71 
 
1 
 
 ONE OPERAND INSTRUCTION CODES - 
 
 Fla- 
 Mil 1 
 MN 2 
 
 ;^;-;::o:;ic bit: 
 3 h 5 6 7 8 
 
 INSTRUCTION 
 
 ;:.:•:;::/.. i:c : 'j : 
 3 U b 6 7 6 
 
 ::::. o:: 
 
 
 3. 
 10 
 
 11 
 
 PUSH (B) 
 PUSH (H) 
 PUSH (W) 
 PUSH (D) 
 
 10 
 10 1 
 10 10 
 10 11 
 
 LS (B) 
 LS. (K) 
 LS (W) 
 
 10 
 10 1 
 110 
 111 
 
 LD (B) 
 LD (H) 
 LD (W) 
 LD (D) 
 
 10 10 
 10 10 1 
 10 110 
 1 
 
 RS (B) 
 RS (H) 
 RS (W) 
 
 u J. 
 10 1 
 10 10 
 3. 1 1 
 
 POP (B) 
 POP (H) 
 
 POP (w) 
 POP (D) 
 
 10 10 
 10 10 1 
 1 1 I 
 
 10 10 11 
 
 
 110 
 110 1 
 1 1 3. 
 1 1 3. 1 
 
 ST (B) 
 
 ST (H) 
 
 "ST " (W) 
 
 ST (D) 
 
 10 110 
 10 110 1 
 10 1110 
 10 11] 
 
 
 3. 
 10 1 
 1 1 
 0-10011 
 
 SET (B) 
 SET (H) 
 SET (W) 
 SET (D) 
 
 1 1 c 
 
 1 c 
 
 110 1 
 
 i i o o : 
 
 
 10 10 
 10 10 1 
 1 1 1 
 10 111 
 
 RESET (B) 
 RESET (H) 
 RESET (W) 
 RESET (D) 
 
 110 10 
 1 1 1 I 
 110 110 
 
 110-.. 
 
 
 I 1 
 110 3. 
 
 o ". i : i o 
 
 110 11 
 
 TEST (B) 
 TEST (H) 
 TEST _ (W) 
 TEST (D) 
 
 1110 
 1110 1 
 1110 10 
 1 I 1 1 1 
 
 
 1110 
 1 3. 1 1 
 ': "i 1 1 
 11111 
 
 TESTM (B) 
 TESTM (H) 
 TESTM (W) 
 TESTM (D) . 
 
 11110 
 
 11110 1 
 111110 
 
 111111 
 
 SLEEP 
 INCK 
 
 Appendix 5 
 7/26/71 
 
 continued Instruction Mnemonic Codes 
 
Flac 
 MN 1 
 MN 2 
 
 
 
 t 
 
 1 
 1 i 
 
 
 
 MNEMONIC BIT: 
 3 h 5 6 7 8 
 
 INSTRUCTION 
 
 MNEMONIC BIT: 
 
 3 It 5 6 T 8 
 
 Instruction 
 
 
 1 
 10 
 11 
 
 
 10 
 10 1 
 1 C 1 
 10 11 
 
 > 
 
 10 
 10 1= 
 110 
 111 
 
 • • 
 
 : iooioo 
 
 10 10 1 
 
 | 10 110 
 
 10 111 
 
 
 10 
 10 1 
 10 10 
 10 11 
 
 
 10 10 
 10 10 1 
 10 10 10 
 10 10 11 
 
 
 110 
 110 1 
 1110 
 1111 
 
 
 10 110 
 10 110 1 
 10 1110 
 10 1111 
 
 
 10 
 10 1 
 10 10 
 10 11 
 
 
 110 
 110 1 
 110 10 
 110 11 
 
 
 10 10 
 10 10 1 
 10 110 
 10 111 
 
 
 110 10 
 110 10 1 
 110 110 
 110 111 
 
 
 110 
 110 1 
 110 10 
 
 110 11 
 
 
 1110 
 1110 1 
 1110 10 
 1110 11 
 
 
 • 1110 
 1110 1 
 11110 
 11111 
 
 
 11110 
 11110 1 
 111110 
 
 111111 
 
 
 Appendix 5 
 7/26/71 
 
 con't Instruction Mnemonic Codes 
 
2 
 
 ± ± 
 
 EL a- 
 
 m 1 
 
 i i L 
 
 U i 
 
 :•:, ::-:o:iic bit: 
 3 U 5 6 7 8 
 
 INSTRUCTION 
 
 MNEMONIC :■ ". L 1 : 
 
 3 U 5 6 7 
 
 L'.'CT'RL'CTIC.'i 
 
 
 1 
 ,00010 
 <J 1 1 
 
 
 10 
 10 1 
 
 i o o c : 
 
 1 C 1 1 
 
 
 C 1 
 1 1 
 110 
 111 
 
 
 10 10 
 10 10 1 
 10 110 
 10 111 
 
 
 j. 
 10 1 
 10 10 
 10 11 
 
 
 10x000 
 10 10 1 
 10 10 10 
 
 10 10 11 
 
 
 110 
 
 110 1 
 
 111 
 
 111]. 
 
 
 10 110 
 10 110 1 
 10 1110 
 10 1111 
 
 
 1 
 10 1 
 10 10 
 
 o-iooii 
 
 
 110 
 110 1 
 110 10 
 110 11 
 
 
 ] 10 
 10 10 1 
 10 110 
 1 1 1 I 
 
 
 :. i o i o c 
 
 110 10 1 
 
 110 110 
 
 1 1 1 1 i 
 ! 
 
 
 1 1 C 
 110 .1 
 1 10 1 
 1 10 11 
 
 
 1110 
 1110 1 
 
 1110. 
 1110 11 
 
 
 0^1100 
 1110 1 
 
 11111 
 
 
 11110 
 
 11110 1 
 3 I 2 
 
 111111 
 
 
 Appendix 5 
 
 con't Instruction Mnemonic Codes 
 
 7/26/71 
 
10 
 
 MISC. INSTRUCTION CODES - 
 
 Flac 
 MN 1 
 KN 2 
 
 MNEMONIC BIT: 
 3 'i 5 6 7 8 
 
 INSTRUCTION 
 
 MNEMONIC BIT: 
 
 31*5678 
 
 
 ION 
 
 
 0001 
 10 
 11 
 
 ASSIGN 
 ASSIGN 
 ASSIGN 
 ASSIGN 
 
 10 
 10 1 
 10 10 
 1 1 I 
 
 PUSHF 
 PUSHF 
 PUSHF 
 PUSHF 
 
 (B) 
 (H) 
 
 (v) 
 
 (D) 
 
 - 10 
 10 1 
 110 
 111 
 
 POPF 
 POPF 
 POPF 
 POPF 
 
 (B) 
 (H) 
 
 (w) 
 
 (D) 
 
 10 10 
 10 10 1 
 10 110 
 10 111 
 
 PUSHFR 
 PUSHER 
 PUSHFR 
 PUSHFR 
 
 (B) 
 (H) 
 
 (w) 
 
 (D) 
 
 10 
 10 1 
 10 10- 
 10 11 
 
 POPFR 
 POPFR 
 POPFR 
 POPFR 
 
 (B) 
 
 (H) 
 
 (W) • - 
 
 (D) 
 
 • 10 10 
 10 10 1 
 10 10 10 
 10 10 11 
 
 SCAN 
 SCAN 
 SCAN 
 
 (B) 
 (H) 
 
 (w) 
 
 110 
 110 1 
 1110 
 1111 
 
 PACK 
 UNPACK 
 RNAM 
 LINK 
 
 10 110 
 10 110 1 
 10 1110 
 10 1111 
 
 SCANM 
 SCANM 
 SCANM 
 
 (B) 
 
 (H) 
 
 (w) 
 
 10 
 10 1 
 10 10 
 10 11 
 
 CALL 
 EXECUTE 
 GOTO 
 EXIT 
 
 110 
 110 1 
 110 10 
 110 11 
 
 MOVE 
 
 TRANS 
 
 EDIT 
 
 10 10 
 10 10 1 
 10 110 
 10 111 
 
 LOC 
 
 SPECIFY 
 
 NOP 
 
 110 10 
 110 10 1 
 110 110 
 110 111 
 
 IF 
 IFN 
 
 110 
 110 1 
 ". 10 10 
 110 11 
 
 RESU 
 
 1110 
 1110 1 
 1110 10 
 1110 11 
 
 
 .1 110 
 1110 1 
 11110 
 11111 
 
 
 
 11110 
 11110 1 
 111110 
 
 111111 
 
 
 
 Appendix 5 
 
 con't. Instruction Mnemonic Coders 
 
 7/26/71 
 
ZERO AND ONE OPERAND INSTRUCTION CODES - 
 
 F] a; 
 
 1 
 I 
 
 I 
 
 
 
 i 
 
 1 
 
 
 
 
 
 MM] : BIT: 
 3 !< 5 ■: 7 3 
 
 INSTRUCTION 
 
 Mu'j ,: IN1C . 
 3 h 5 G 7 8 
 
 j inJiho'J'j'lOi. 
 
 
 3. 
 ..00010 
 11 
 
 LIBR 
 SL 
 SIO 
 HIO 
 
 ]. 
 10 
 10 10 
 10 1]. 
 
 RDCLK 
 
 STTIM 
 RDTIM 
 
 10 
 10 1 
 
 110 
 11]. 
 
 SR 
 
 10 10 
 10 10 1 
 10 
 
 111 
 
 
 10 
 
 1 1 
 10 10 
 10 11 
 
 GET 
 
 10 10 
 10 10 
 10 10 10 
 10 10 11 
 
 
 110 
 
 110 1 
 1 1 1 
 1111 
 
 PUT 
 
 1 1 1 c 
 1 1 1 
 
 :. . 
 1011 : 
 
 
 1 
 10 1 
 10 10 
 O'l 1 1 
 
 ::;cl 
 
 1 1 c 
 
 110 0', 
 110 10 
 110 11 
 
 
 10 10 
 10 10 1 
 10 110 
 10 111 
 
 INCR 
 
 110 10 
 1 1 1 1 
 110. 1 c 
 110 111 
 
 
 110 
 110 0], 
 
 o - i ■: i o 
 
 110].! 
 
 DECL 
 
 1110 
 
 1110 1 
 1110 10 
 
 l l i o : 
 
 
 1110 
 1110 1 
 11110 
 11111 
 
 I 
 DECR 
 
 11110 
 11110 1 
 
 11111 
 l i i i : 
 
 
 one operand 
 
 zero operand 
 
 Appendix 5 
 
 Instruction Mnemonic Codes 
 
 7/26/71 
 
1 
 
 ARITHMETIC OPERATION CODES - 
 
 Elafl 
 MN 1 
 MN 2 
 
 MNEMONIC BIT: 
 3 1+56 7 8 
 
 INSTRUCT I 
 
 ON 
 
 MNEMONIC BIT: 
 3 U 3 C 7 6 
 
 KSTRUC'I 
 
 70;. r 
 
 
 1 
 10 
 11 
 
 
 10 
 10 1 
 
 f 1 1 
 ; 1 2. 2. 
 
 ADD 
 ADD 
 ADD 
 ADD 
 
 (SFX) 
 (LFX) 
 (FLT) 
 (DEC) 
 
 10 
 10 1 
 110 
 111 
 
 -CVL - 
 NOP 
 CVL 
 CVL 
 
 (SFX) 
 
 (FLT) 
 (DEC) 
 
 10 10 
 2. 1 1 
 10 110 
 10 111 
 
 
 10 
 10 1 
 10 10 
 10 11 
 
 CVF 
 CVF 
 NOP 
 CVF 
 
 (SFX) 
 (■LFX) 
 
 (DEC) 
 
 10 10 
 10 10 1 
 10 10 10 
 10 10 11 
 
 SUB 
 SUB 
 SUB 
 SUB 
 
 (SFX) 
 (LFX) 
 (FLT) 
 (DEC) 
 
 1 1 
 110 1 
 1110 
 1111 
 
 CVD 
 CVD 
 CVD 
 NOP 
 
 (SFX) 
 (LFX) 
 (FLT) 
 
 101100 
 
 10 110 1 
 10 1110 
 10 1111 
 
 CPRA 
 CPRA 
 CPRA 
 CPRA 
 
 (SFX) 
 
 (LFX) 
 
 (DEC) 
 
 10 
 10 1 
 
 2 10 
 
 10 11 
 
 NEG 
 NEG 
 NEG 
 NEG 
 
 (SFX) 
 .(LFX) 
 (FLT) 
 (DEC) 
 
 110 
 
 110 1 
 
 110 10 
 
 ■ 110 11 
 
 MPY 
 
 MPY 
 MPY 
 
 MPY 
 
 (SFX) 
 
 (LFX) 
 (FLT) 
 (DEC) 
 
 10 10 
 2 10 1 
 10 110 
 3. 1 1 1 
 
 ABS 
 ABS 
 ABS 
 ABS 
 
 (SFX) 
 (LFX) 
 (FLT) 
 (DEC) 
 
 110 10 
 110 10 1 
 110 110 
 110 111 
 
 POLY 
 POLY 
 POLY 
 POLY 
 
 (SFX) 
 
 (LFX) 
 (FLT) 
 (DEC) 
 
 110 
 110 3 
 ": 10 10 
 
 110 11 
 
 MNS 
 MNS 
 MNS 
 MNS 
 
 (SFX) 
 (LFX) 
 (FLT) 
 (DEC) 
 
 1110 
 1110 1 
 il 1 1 1 
 
 1110 11 
 
 DIV 
 DIV 
 DIV 
 DIV 
 
 ( SFX ) 
 (LFX) 
 (FLT) 
 (DEC) 
 
 1110 
 1110 2 
 11110 
 11111 
 
 TA 
 TA 
 TA 
 TA 
 
 (SFX) 
 
 (LFX) 
 
 tFLT) 
 
 ' (DEC) 
 
 11110 
 11110 1 
 111110 
 
 i 1 1 1 1 1 
 
 
 
 Appendix 5 
 7/26/71 
 
 continued Instruction Mnemonic Codes 
 
Ill 
 
 PAU INSTRUCTION CODES 
 
 Flas 
 KH 2 
 
 DEMONIC EIT: 
 
 
 . : 
 
 
 
 3 ^ 5 6 7 8 
 
 
 3 >' 5 6 ' 
 
 
 
 OOOOOO 
 
 RESTART 
 
 10 
 
 
 
 1 
 
 RESUME 
 
 1 C 1 
 
 LIST 
 
 
 10 
 
 BOOLE 
 
 10 10 
 
 TSZ 
 
 
 C 3 1 
 
 SETORG 
 
 1000: 
 
 LISTLZ 
 
 
 10 
 
 
 10 10 
 
 REPLICATE 
 
 
 10 1 
 
 
 10 10 1 
 
 ;rlz 
 
 
 110 
 
 
 10 110 
 
 :lz 
 
 
 111 
 
 
 10 111 
 
 RLZ 
 
 
 10 
 
 GATEIA 
 
 10 10:. 
 
 TESTP 
 
 
 1 1 
 
 
 1 1 ( 
 
 TESTS 
 
 
 10 10 
 
 
 10 10 10 
 
 
 
 10 11 
 
 
 10 10 11 
 
 ERASEP 
 
 
 110 
 
 
 10 110 
 
 SHIFT 
 
 
 .110 1 
 
 
 1 1 1 c 
 
 
 
 1110 
 
 
 10 1110 
 
 
 
 1111 
 
 
 1011 i 
 
 
 
 10 
 
 LOADB 
 
 110 
 
 .?P 
 
 
 10 1 
 
 PUSHB 
 
 . 1 
 
 SET? 
 
 
 10 10 
 
 STOREB 
 
 11 10 
 
 Z3 
 
 
 10 11 
 
 PO?B 
 
 13 11 
 
 
 
 10 10 
 
 
 110 10 
 
 PLOT 
 
 
 10 10 1 
 
 • 
 
 1 1 1 1 
 
 :sz 
 
 
 1 1 I 
 
 
 110 110 
 
 :lz 
 
 
 10 111 
 
 
 : :. 
 
 DTI 
 
 
 110 c 
 
 
 1 1 1 0. ( 
 
 COPY 
 
 
 I L 1 1 
 
 
 1110 1 
 
 COPYC 
 
 
 1 10 10 
 
 
 1 1 1 .1 
 
 PLA 
 
 
 o i i o i i 
 
 
 1110 11 
 
 PLOR 
 
 
 1 1 J. 
 
 TOPOLOGY 
 
 111 
 
 PI2JAJ 
 
 
 1 110 1 
 
 TOPOLOGY 
 
 11110 1 
 
 }R 
 
 
 11110 
 
 TOPOLOGY 
 
 111110 
 
 XOR 
 
 
 11111 
 
 TOPOLOGY 
 
 1111 
 
 PLEQV 
 
 
 Appendix 5 
 
 con't. Instruction Mnemonic Codes 
 
 7/26/71 
 
Form AEC-427 
 
 (6/68) 
 
 AECM 3201 
 
 U.S. ATOMIC ENERGY COMMISSION 
 
 UNIVERSITY -TYPE CONTRACTOR'S RECOMMENDATION FOR 
 
 DISPOSITION OF SCIEI\TIF|C AND TECHNICAL DOCUMENT 
 
 ( See Instructions on Reverse Side ) 
 
 1. AEC REPORT NO. 1+69 
 
 COO-2118-0017 
 
 2. title IBAL MANUAL 
 
 The Illiac III Basic Assembler Language 
 
 3. TYPE OF DOCUMENT (Check one): 
 
 l^l a. Scientific and technical report 
 
 I I b. Conference paper not to be published in a journal: 
 
 Title of conference 
 
 Date of conference 
 
 Exact location of conference. 
 
 Sponsoring organization 
 
 □ c. Other (Specify) 
 
 4. RECOMMENDED ANNOUNCEMENT AND DISTRIBUTION (Check one): 
 
 Pi a. AEC's normal announcement and distribution procedures may be followed. 
 ~~\ b. Make available only within AEC and to AEC contractors and other U.S. Government agencies and their contractors. 
 ] c. Make no announcement or distrubution. 
 
 5. REASON FOR RECOMMENDED RESTRICTIONS: 
 
 6. SUBMITTED BY: NAME AND POSITION (Please print or type) 
 
 Ahmad E. Masumi 
 Research Assistant 
 
 Organization University of minois 
 
 Department of Computer Science 
 Urbana, Illinois 
 
 Signature 
 
 AW</ £• tUo^ 
 
 Date 
 
 July ^o„ iaxi 
 
 FOR AEC USE ONLY 
 
 7. AEC CONTRACT ADMINISTRATOR'S COMMENTS, IF ANY, ON ABOVE ANNOUNCEMENT AND DISTRIBUTION 
 RECOMMENDATION: 
 
 8. PATENT CLEARANCE: 
 
 □ a. AEC patent clearance has been granted by responsible AEC patent group. 
 Lj b. Report has been sent to responsible AEC patent group for clearance. 
 LJ c. Patent clearance not required.