(calculation formula) located between “ =>” and “ A ” will be executed, and then
Goto 1 returns execution to Lbl 1. If the contents of memory A are less than zero,
execution will skip the following statement to the next “ A ” and return to Lbl 1
by Goto 1.
Example Calculate the sum of input numeric values. If a 0 Is input, the total
should be displayed.
program
0, B, :,
Lbl, 1 , A, A, =, 0, =», Goto, 2 ,
A, + , B, -+, B, :, Goto, 1, :,
Lbl, 2, :, B 31 steps
In this program, a 0 is first stored in memory B to clear it for calculation of the
sum. Next, the value input by “ ?->A” is stored in memory A by “ A = 0=>” and
it is determined whether or not the value stored in memory A equals zero. If A = 0,
Goto 2 causes execution to jump to Lbl 2. If memory A does not equal 0, Goto
2 will be skipped and the command A + B-+B which follows “ : ” is executed, and
then Goto 1 returns execution to Lbl 1 .
Execution from Lbl 2 will display the sum that has been stored in memory B.
Actually, the display command "A ” is inserted following B, but here it can be
omitted.
The following illustration shows the flow of the program:
(A *0 )
i
--------------------------------------------------------
Lbl 1 : ?-*A
(A = 0)
n
A = 0 =»Goto 2 : A + B-*B : Goto 1
---------
L
(A*0)
Lbl 2 : B
t_______
(A = 0)
J
- 1 2 3 -