Execute Computer/Zero: Difference between revisions
m
J: get rid of LIT pseudocode -- numbers are clear enough by themselves
m (J: be more consistent with LIT (literal number) pseudocode) |
m (J: get rid of LIT pseudocode -- numbers are clear enough by themselves) |
||
Line 115:
Here's one approach which might be sufficiently close to the task requirements:
<lang J>OPS=:
assemble1=: {{
val=. {.0".y-.OPS
if. *cod
val▼
else.▼
assert. 8>cod▼
assert. 32>val
val+32*cod
▲ else.
▲ val
end.
}}
Line 164:
With this implementation, we can assemble and run representations of the five suggested programs:
<lang J> exec assemble 'LDA 3; ADD 4; STP;
4
exec assemble 'LDA 12; ADD 10; STA 12; LDA 11; SUB 13; STA 11; BRZ 8; JMP; LDA 12; STP;
56
exec assemble 'LDA 14; STA 15; ADD 13; STA 14; LDA 15; STA 13; LDA 16; SUB 17; BRZ 11; STA 16; JMP; LDA 14; STP;
55
exec assemble 'LDA 13; ADD 15; STA 5; ADD 16; STA 7; NOP; STA 14; NOP; BRZ 11; STA 15; JMP; LDA 14; STP; LDA;
6
exec assemble 'NOP; NOP; STP; NOP; LDA 3; SUB 29; BRZ 18; LDA 3; STA 29; BRZ 14; LDA 1; ADD 31; STA 1; JMP 2; LDA; ADD 31; STA; JMP 2; LDA 3; STA 29; LDA 1; ADD 30; ADD 3; STA 1; LDA; ADD 30; ADD 3; STA; JMP 2;
0</lang>
| |||