Contact us Heritage collections Image license terms
HOME ACL Associates Technology Literature Applications Society Software revisited
Further reading □ Preface □ Contents □ 1 Introduction □ 2 The basic language □ 3 Storage and block structure of programs □ 4 Routines □ 5 Data I/O □ 6 Monitor printing and fault diagnosis □ 7 Presentation of complete programs □ 8 Complex arithmetic □ 9 Store Mapping □ 10 The use of machine instructions □ 11 Permanent routines □ Appendices and indices □ A1 Phrase structure notation □ A2 Standard functions and permanent routines □ A3 Delimiters □ A4 Monitored faults □ A5 Numerical equivalents of symbols
ACD C&A INF CCD CISD Archives Contact us Heritage archives Image license terms

Search

   
⟶ ACL ⟶ Literature ⟶ Atlas manuals ⟶ Atlas Autocode :: ATLAS AUTOCODE REFERENCE MANUAL
⟶ ACL ⟶ Literature ⟶ Atlas manuals ⟶ Atlas Autocode :: ATLAS AUTOCODE REFERENCE MANUAL
ACL ACD C&A INF CCD CISD Archives
Further reading ⇓

□ Preface
□ Contents
□ 1 Introduction
□ 2 The basic language
□ 3 Storage and block structure of programs
□ 4 Routines
□ 5 Data I/O
□ 6 Monitor printing and fault diagnosis
□ 7 Presentation of complete programs
□ 8 Complex arithmetic
□ 9 Store Mapping
□ 10 The use of machine instructions
□ 11 Permanent routines
Appendices and indices
□ A1 Phrase structure notation
□ A2 Standard functions and permanent routines
□ A3 Delimiters
□ A4 Monitored faults
□ A5 Numerical equivalents of symbols

Appendix 5 Numerical Equivalents of Basic and Composite Symbols

The numerical equivalents for use in conjunction with the read symbol and 'print symbol' routines are given in the table overleaf. The table gives the numerical equivalents of the basic symbols i.e. symbols comprising of a single (upper or lower case) character. Up to three basic symbols may be superimposed (by means of the backspace facility) to form a compound symbol. For example:-

≠ is formed from = _ /

The numerical equivalent of a compound symbol is

a*2↑14 + b*2↑7 + c

where a,b,c are the numerical equivalents of the individual symbols, ordered so that a>b>c. Thus the numerical equivalent is independent of the order of punching the individual characters.

If only two symbols are used, the formula is

b*2↑7 + c, b > c

Thus ≠ is equivalent to 86*2↑14 + 28*2↑7 + 15 and ≥ is equivalent to 86*2↑7 + 27

TABLE OF NUMERICAL EQUIVALENTS

   0               32 '             64               96
   1               33 A             65 space         97 a
   2               34 B             66               98 b
   3               35 C             67               99 c
   4 newline       36 D             68              100 d
   5               37 E             69              101 e
   6               38 F             70              102 f
   7               39 G             71              103 g
   8 (             40 H             72              104 h
   9 )             41 I             73              105 i
  10 ,             42 J             74              106 j
  11 π             43 K             75              107 k
  12 ?             44 L             76              108 l
  13 &             45 M             77              109 m
  14 *             46 N             78              110 n
  15 /             47 O             79 :            111 o
  16 0             48 P             70              112 p
  17 1             49 Q             81 [            113 q
  18 2             50 R             82 ]            114 r
  19 3             51 S             83              115 s
  20 4             52 T             84              116 t
  21 5             53 U             85              117 u
  22 6             54 V             86 _(underline) 118 v
  23 7             55 W             87 |            119 w
  24 8             56 X             88              120 x
  25 9             57 Y             89              121 y
  26 <             58 Z             90 α            122 z
  27 >             59               91 β            123
  28 =             60               92 ½            124
  29 +             61               93              125
  30 -             62               94              126
  31 .             63               95              127
⇑ Top of page
© Chilton Computing and UKRI Science and Technology Facilities Council webmaster@chilton-computing.org.uk
Our thanks to UKRI Science and Technology Facilities Council for hosting this site