[PDF][PDF] Scatter storage techniques
R Morris - Communications of the ACM, 1968 - dl.acm.org
R Morris
Communications of the ACM, 1968•dl.acm.orgScatter storage techniques Page 1 The BXI, works like a TtX if the SEcond operand (in this
ease 3) is odd; the BXH with an even second ~vrgument allows the increment and comparand
to be in adjacent regist.ers, in this ease 4 aud 5. The Stl. subtraets register 5 from register 2. C
is a fuI1 word comparison which sets the condition codE; this example could be modified for a
halfword ~able by changing (3 to CH and "4" to "2" throughout the instructions above. BC
branches (>~ eondition code 6, which is 0110 in binary--.-ie, first opera.nd low or first operand …
ease 3) is odd; the BXH with an even second ~vrgument allows the increment and comparand
to be in adjacent regist.ers, in this ease 4 aud 5. The Stl. subtraets register 5 from register 2. C
is a fuI1 word comparison which sets the condition codE; this example could be modified for a
halfword ~able by changing (3 to CH and "4" to "2" throughout the instructions above. BC
branches (>~ eondition code 6, which is 0110 in binary--.-ie, first opera.nd low or first operand …
Scatter storage techniques as a method for implementing the symbol tables of assemblers~ and compilers are reviewed and a number of ways of using them more effectively ore presented. Many of the most useftA variants of~ e techniques are documented.
ACM Digital Library