Table of Contents
Advertisement
I n the above example, even when No.2 program is being executed, it jumps to
E;i]
ff]
of No.1 program. That is, when there are more than two designated steps for jumping
in two programs, it jumps to the step closest to
a
(zero) step. Therefore even when it
is executing No.2 program, it may jump to No.1 program. Please keep it in mind.
Please refer to page 115 "G·1" or page 1 21 "G ·4" which gives an example of
programming using jumps function.
" Note: Zero judge
There are two kinds of zero in CS·363P; that is, (+0) and (-0).
When zero is gained by subtracting a certain number from a positive number, it
is (+0). When zero is gained by adding a certain number to a negative number, it
.is (-0).
In the following cases, (-0) is gained:
1.
-a
+
a [a
0
a
0
]
2.
0 x (-a) [0
0
a
0
]
0.;. (-a) [0
G
a
0
3.
(-a) x 0 [a
0
0
0
0
] a x (-0) [a
0
0
0
]
4.
-
(02)
[0
0
0
]
5.
-0 [0
rE
]
It has not of course any meaning mathematically but it is employed in
consideration of the specifications of the computer. It becomes necessary when
programming with use of Jump function. The program can be simplified if it
is
used for skillfully.
90
- Quick Links:
- Table of Contents
Hide quick links:
Advertisement
Table of Contents
