Execute Computer/Zero: Difference between revisions

 

=={{header|ALGOL 68}}==

# instructions #

INT nop = 0, lda = 1, sta = 2, add = 3, sub = 4, brz = 5, jmp = 6, stp = 7;

execute( "1+255", ( LDA 3, ADD 4, STP 0, 1, 255 ) )

END

{{out}}

<pre>

 

=={{header|Applesoft BASIC}}==

1 LET A = V: RETURN

2 LET P$ = MID$ (P$,1,MEM) + CHR$ (A) + MID$ (P$,MEM + 2,31 - MEM): PRINT MID$ ("",1 ^ FRE (0));: RETURN

300 DATA "FIBONACCI",46,79,109,78,47,77,48,145,171,80,192,46,224,1,1,0,8,1,

400 DATA "LINKED LIST",45,111,69,112,71,0,78,0,171,79,192,46,224,32,0,28,1,0,0,0,6,0,2,26,5,20,3,30,1,22,4,24

 

=={{header|Forth}}==

{{works with|gforth|0.7.3}}

<br>

 

\ Execute Computer/Zero

 

bye

 

{{out}}

Here's one approach which might be sufficiently close to the task requirements:

 

 

assemble1=: {{

while. 0<:pc do. exec1'' end.

acc

 

With this implementation, we can assemble and run representations of the five suggested programs:

 

4

exec assemble 'LDA 12; ADD 10; STA 12; LDA 11; SUB 13; STA 11; BRZ 8; JMP; LDA 12; STP; 8; 7; 0; 1'

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; 1; 3'

 

=== Alternate approach ===

Another approach would be to eliminate the 'assemble' command and implement the opcodes as native J commands (which build a representation of the memory space). To conform with J syntax, the right arguments of these opcodes is required (so you need a 0 even for NOP and STP). The implementation of <code>exec</code> remains much the same as before, but it's convenient to have exec save the code to memory. In other words:

 

(m+{.y),}.y

:

while. 0<:pc do. exec1'' end.

acc

 

and:

 

4

exec LDA 12 ADD 10 STA 12 LDA 11 SUB 13 STA 11 BRZ 8 JMP 0 LDA 12 STP 0 8 7 0 1

6

exec NOP 0 NOP 0 STP 0 NOP 0 LDA 3 SUB 29 BRZ 18 LDA 3 STA 29 BRZ 14 LDA 1 ADD 31 STA 1 JMP 2 LDA 0 ADD 31 STA 0 JMP 2 LDA 3 STA 29 LDA 1 ADD 30 ADD 3 STA 1 LDA 0 ADD 30 ADD 3 STA 0 JMP 2 0 1 3

 

=={{header|Java}}==

{{works with|Java|8}}

 

import static java.lang.Math.min;

import static java.util.stream.Collectors.toMap;

}

}

 

{{out}}

 

=={{header|Julia}}==

ip::Int

ram::Vector{UInt8}

run(compile(t))

end

<pre>

Compiled 6 lines.

=== Interpreter version with labels ===

Uses the Python examples.

ip, accum, isready, ram = 0x1, 0x0, true, zeros(UInt8, 32)

NOP() = (ip = mod1(ip + 1, 32))

interpret(t)

end

<pre>

Program completed with accumulator value 4.

===Execute (2+2, 7*8)===

Per primary task, just execute first two examples:

pc = 0,

acc = 0,

-- object code derived from js sim code

print("2 + 2 = " .. vmz:boot():load({[0]=35,100,224,2,2}):exec().acc)

{{out}}

<pre>2 + 2 = 4

===Disassembler (7*8)===

Assembly syntax doesn't seem well-specified (except as shown in descriptive text, which is presumably just pseudocode), but next step might be to add a minimal disassembler:

local mnem, imax = { [0]="NOP", "LDA", "STA", "ADD", "SUB", "BRZ", "JMP", "STP" }

for pc = 31,0,-1 do imax=pc if self.mem[pc]~=0 then break end end

print(vmz:dism())

print("Disassembly of 7 x 8 (POST-RUN):")

{{out}}

<pre>Disassembly of 7 x 8 (PRE-RUN):

===Assembler (fibo, list)===

Add an assembler (same minimal syntax as disassembler) for the next two examples:

vmz.assm = function(self, source)

local function oa2b(oper, addr) return oper * 32 + addr end

NOP 5 NOP 20 NOP 3 NOP 30 NOP 1 NOP 22 NOP 4 NOP 24

]]

{{out}}

<pre>Fibonacci = 55

===Prisoner===

Some additional helper routines, then multiple rounds:

vmz.poke = function(self,addr,byte) self.mem[addr]=byte end

vmz.entr = function(self,byte) self.mem[self.pc]=byte self.pc=self.pc+1 end

vmz:exec()

print("Round: " .. r .. " Move: " .. mvnm[move] .. " Player: " .. vmz:peek(0) .. " Computer: " .. vmz:peek(1))

{{out}}

<pre>Prisoner (priming) = 0

=={{header|Phix}}==

Assumes there is no need for an "assembler", just a runtime interpreter. Output matches Algol 68.

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">constant</span> <span style="color: #000000;">NOP</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">0b000_00000</span><span style="color: #0000FF;">,</span> <span style="color: #000080;font-style:italic;">-- no operation</span>

<span style="color: #000080;font-style:italic;">-- overflow on addition</span>

<span style="color: #000000;">execute</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"1+255"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">LDA</span><span style="color: #0000FF;">+</span><span style="color: #000000;">3</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ADD</span><span style="color: #0000FF;">+</span><span style="color: #000000;">4</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">STP</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">255</span><span style="color: #0000FF;">})</span>

You could of course define the programs using (say) 0b001_00011 instead of LDA+3.

{{out}}

 

=={{header|Python}}==

 

import re

if __name__ == "__main__":

main()

 

{{out}}

 

Although I've entered the fifth program, it just returns 0 when reaching the STP instruction. I'm unclear how we can make it interactive without having another instruction though possibly, if STP had address bits other than 0, this could signal that user input was required.

var LDA = 1

var STA = 2

"""

]

 

{{out}}

=={{header|Z80 Assembly}}==

Output is in hexadecimal but is otherwise correct.

PrintChar equ &BB5A

 

db %00000000,%00000000

db %00000000,%00000000

{{out}}

<pre>04