
IP 266 Machine Data, Modes and Traversing Programs
In the following example, the processing order does not change. The order in
which blocks are processed is determined only by the order of those blocks in the
program.
Example:
%9 Sample program 1 %8 Sample program 2
N10 G74 M10 N30 G74 M10
N20 G24 F5 N10 G24 F5
N30 L36 N20 L36
N40 X50 F2000 N60 X50 F2000
N50 G20 N50 G20
N60 M02 N40 M02
The two sample programs are identical.
The L function
Within a block, another program can be called as subroutine. The subroutine call
must immediately follow the N function, and comprises the letter "L", followed
by the program number of the program to be called.
No further functions may follow the L function. The block may only be termina-
ted with <1>.
Example: N10 L123 <1>
.
.
.
Subroutines may be nested, but the nesting depth of loops and subroutines
together may not exceed five.
Note:
Recursive structures and reciprocal calls are not possible.
EWA 4NEB 812 6057-02
5-71
Kommentare zu diesen Handbüchern