haxala1r
d846046c4a
Compiler and VM are now working well enough to support larger programs. A test program is included and executed immediately upon running the executable. A more feature complete read-eval-print loop is planned.
87 lines
2.7 KiB
OCaml
87 lines
2.7 KiB
OCaml
|
|
module Types = Types
|
|
open Types
|
|
|
|
|
|
let do_local state i f =
|
|
match List.nth_opt state.env i with
|
|
| None -> failwith "Invalid index for local access"
|
|
| Some x -> f x
|
|
let load_local state i =
|
|
do_local state i (!)
|
|
let set_local state i v =
|
|
do_local state i (fun r -> r := v)
|
|
|
|
let pop_one state =
|
|
match state.stack with
|
|
| v :: rest -> state.stack <- rest; v
|
|
| [] -> failwith ("VM error: cannot pop from empty stack! " ^ (string_of_int state.i))
|
|
|
|
let push state v =
|
|
state.stack <- (v :: state.stack)
|
|
|
|
let trace state =
|
|
let stack () = List.fold_left (fun acc x -> acc ^ " " ^ (Types.print_value x)) "" state.stack in
|
|
let env () = List.fold_left (fun acc x -> acc ^ " " ^ (Types.print_value !x)) "" state.env in
|
|
Printf.printf "%d: \n\tstack: [%s ]\n\tenv:[%s]\n" state.i (stack ()) (env ())
|
|
|
|
let rec do_apply state =
|
|
let cur_env = state.env in
|
|
let cur_i = state.i in
|
|
let arg = pop_one state in
|
|
let f = pop_one state in
|
|
match f with
|
|
| Closure (x, e) ->
|
|
state.call_stack <- (cur_i, cur_env) :: state.call_stack;
|
|
state.i <- x;
|
|
state.env <- (ref arg) :: e;
|
|
interpret state
|
|
| Native x ->
|
|
push state (Native.table.(x) arg);
|
|
interpret state
|
|
| _ -> failwith "Cannot apply non-closure object"
|
|
|
|
and interpret state =
|
|
let i = state.i in
|
|
state.i <- i + 1;
|
|
(match state.instrs.(i) with
|
|
| Constant x -> push state state.constants.(x) ; interpret state
|
|
| LoadLocal x -> push state (load_local state x) ; interpret state
|
|
| LoadGlobal x -> push state state.globals.(x) ; interpret state
|
|
| StoreLocal x -> set_local state x (pop_one state) ; interpret state
|
|
| StoreGlobal x -> Array.set state.globals x (pop_one state) ; interpret state
|
|
| MakeCons ->
|
|
let cdr = pop_one state in
|
|
let car = pop_one state in
|
|
push state (Cons (car, cdr))
|
|
| Pop -> ignore (pop_one state) ; interpret state
|
|
| Apply -> do_apply state
|
|
| MakeClosure x -> push state (Closure (x, state.env)); interpret state
|
|
| Jump target -> state.i <- target ; interpret state
|
|
| JumpF target ->
|
|
(match (pop_one state) with
|
|
| Nil -> state.i <- target
|
|
| _ -> ()); interpret state
|
|
| End ->
|
|
(match state.call_stack with
|
|
| [] ->
|
|
print_endline "\nPROGRAM HAS SUCCESSFULLY TERMINATED"
|
|
| (old_i, old_env) :: rest ->
|
|
state.call_stack <- rest;
|
|
state.env <- old_env;
|
|
state.i <- old_i;
|
|
interpret state)
|
|
| NOOP -> interpret state)
|
|
|
|
let make_vm instrs constants global_count =
|
|
let globals = Array.init global_count (fun x -> if x < (Array.length Native.table) then Native x else Nil) in
|
|
{
|
|
i = 0;
|
|
instrs = instrs;
|
|
globals = globals;
|
|
constants = constants;
|
|
env = [];
|
|
stack = [];
|
|
call_stack = [];
|
|
}
|