DL205 User Manual, 4th Edition, Rev. B
5–165
Chapter 5: Standard RLL Instructions - Table
1
2
3
4
5
6
7
8
9
10
11
12
13
14
A
B
C
D
The following diagram shows the scan-by-scan results of the execution for our example
program. In our example we’re showing the table counter set to 4 initially. (Remember, you
can set the table counter to any value that is within the range of the table.) The table counter
automatically decrements from 4 to 0 as the instruction is executed. Notice how the last two
table positions, 5 and 6, are not moved up through the table. Also, notice how SP56, which
comes on when the table counter is zero, is only on until the end of the scan.
V
1
4
0
1
8
9
8
9
V
1
4
0
2
8
9
8
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
4
0
1
8
9
8
9
V
1
4
0
2
8
9
8
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
4
0
1
8
9
8
9
V
1
4
0
2
8
9
8
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
4
0
1
4
0
7
9
V
1
4
0
2
8
9
8
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
4
0
1
9
9
9
9
V
1
4
0
2
4
0
7
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
1
2
3
4
5
6
1
2
3
4
5
6
V
1
4
0
1
0
5
0
0
V
1
4
0
2
9
9
9
9
V
1
4
0
3
3
0
7
4
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
5
00
X
X
X
X
1
2
3
4
5
6
V
1
4
00
0
0
0
4
V
1
4
0
1
9
9
9
9
V
1
4
0
2
4
0
7
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
V
1
5
00
0
5
0
0
D
e
s
t
i
n
a
t
i
o
n
V
1
4
00
0
0
0
3
V
1
5
00
9
9
9
9
D
e
s
t
i
n
a
t
i
o
n
V
1
4
00
0
0
0
2
V
1
5
00
4
0
7
9
V
1
4
00
0
0
0
1
V
1
5
00
0
5
0
0
1
2
3
4
5
6
V
1
4
00
0
0
0
3
V
1
5
00
9
9
9
9
1
2
3
4
5
6
V
1
4
00
0
0
0
2
S
P
5
6
=
O
FF
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
V
1
5
00
8
9
8
9
V
1
4
00
0
0
0
0
V
1
5
00
4
0
7
9
1
2
3
4
5
6
V
1
4
00
0
0
0
1
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
S
P
5
6
=
O
FF
S
P
5
6
T
a
b
l
e
C
o
u
n
t
e
r
(
A
u
t
o
m
a
t
i
c
a
ll
y
d
e
c
r
e
m
e
n
t
e
d
)
V
1
4
0
1
4
0
7
9
V
1
4
0
2
8
9
8
9
V
1
4
0
3
8
9
8
9
V
1
4
0
4
8
9
8
9
V
1
4
0
5
1
0
1
0
V
1
4
0
6
2
0
4
6
V
1
4
0
7
X
X
X
X
1
2
3
4
5
6
0
5
0
0
9
9
9
9
4
0
7
9
1
2
3
4
5
6
8
9
8
9
B
e
f
o
r
e
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
T
a
b
l
e
C
o
u
n
t
e
r
D
e
s
t
i
n
a
t
i
o
n
T
a
b
l
e
C
o
u
n
t
e
r
i
n
d
i
c
a
t
e
s
t
h
a
t
t
h
e
s
e
4
p
o
s
i
t
i
o
n
s
w
i
ll
b
e
u
s
e
d
A
f
t
e
r
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
B
e
f
o
r
e
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
A
f
t
e
r
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
B
e
f
o
r
e
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
A
f
t
e
r
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
B
e
f
o
r
e
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
A
f
t
e
r
R
F
T
Ex
e
c
u
t
i
o
n
T
a
b
l
e
T
a
b
l
e
C
o
u
n
t
e
r
T
a
b
l
e
C
o
u
n
t
e
r
T
a
b
l
e
C
o
u
n
t
e
r
D
e
s
t
i
n
a
t
i
o
D
e
s
t
i
n
a
t
i
o
n
D
e
s
t
i
n
a
t
i
o
n
S
t
a
r
t
h
e
r
e
S
t
a
r
t
h
e
r
e
S
t
a
r
t
h
e
r
e
S
t
a
r
t
h
e
r
e
S
c
a
n
N+
3
S
c
a
n
N+
2
S
c
a
n
N+
1
S
c
a
n
N
D
e
s
t
i
n
a
t
i
o
n
D
e
s
t
i
n
a
t
i
o
n
S
P
5
6
=
O
N
u
n
t
i
l
e
n
d
o
f
s
c
a
n
o
r
n
e
x
t
i
n
s
t
r
u
c
t
i
o
n
t
h
a
t
u
s
e
s
S
P
5
6
T
a
b
l
e
C
o
u
n
t
e
r
(
A
u
t
o
m
a
t
i
c
a
ll
y
d
e
c
r
e
m
e
n
t
e
d
)
T
a
b
l
e
C
o
u
n
t
e
r
(
A
u
t
o
m
a
t
i
c
a
ll
y
d
e
c
r
e
m
e
n
t
e
d
)
T
a
b
l
e
C
o
u
n
t
e
r
(
A
u
t
o
m
a
t
i
c
a
ll
y
d
e
c
r
e
m
e
n
t
e
d
)