Link alle Slide Conferenza La Macchina di Turing - ITIS G. Marconi

Struttura di un self-interpreter: Turing!!!
input P,d; Program to be interpreted, and its data
pc := 2; Initialise program counter and store
store := [in ↦→ d,out ↦→ 0,x1 ↦→ 0,...];
while pc < length(P) do
instruction := lookup(P,pc); Find the pc-th instruction
case instruction of Dispatch on syntax
skip : pc := pc+1;
x := e : store := store[x ↦→ eval(e,store)]; pc := pc+1;
... endw ;
output store[out];
eval(e,store) = case e of Function to evaluate expressions
constant : e
variable : store(e)
e1+e2 : eval(e1,store)+eval(e2,store)
e1−e2 : eval(e1,store)−eval(e2,store)
e1∗e2 : eval(e1,store)∗eval(e2,store) ...
Mathesis: Verona - 10.03.2012 – p.45/56