The Automatic Memory Stack
2–5
File name 32sii-Manual-E-0424
Printed Date : 2003/4/24 Size : 17.7 x 25.2 cm
3 + 4 – 9
T
1
1
1
1
Z
2
1
2
1
Y
3
2
7
2
X
4
7
9
–2
1
2
3
1.
The stack "drops" its contents. The T– (top) register
replicates
its contents.
2.
The stack "lifts" its contents. The T–register's contents are
lost
.
3.
The stack drops.
Notice that when the stack lifts, it replaces the contents of the T– (top)
register with the contents of the Z–register, and that the
former
contents of
the T–register are lost. You can see, therefore, that the stack's memory is
limited to four numbers.
Because of the automatic movements of the stack, you do
not
need to
clear the X–register before doing a new calculation.
Most functions prepare the stack to lift its contents
when the next number
enters the X–register.
See appendix B for lists of functions that disable
stack lift.
How ENTER Works
You know that
separates two numbers keyed in one after the other. In
terms of the stack, how does it do this
?
Suppose the stack is again filled with
1, 2, 3, and 4. Now enter and add two new numbers:
