LispInSmallPieces/chapter3/interpreter.coffee

164 lines
4.7 KiB
CoffeeScript
Raw Normal View History

2015-05-21 20:02:39 +00:00
{listToString, listToVector, pairp, cons, car, cdr, caar, cddr, cdar, cadr, caadr, cadar, caddr, nilp, nil, setcdr, metacadr} = require "cons-lists/lists"
2015-06-17 19:34:31 +00:00
readline = require "readline"
2015-05-21 20:02:39 +00:00
{inspect} = require "util"
2015-06-17 19:34:31 +00:00
print = require "../chapter1/print"
2015-05-21 20:02:39 +00:00
2015-06-11 00:28:47 +00:00
env_init = nil
env_global = env_init
2015-06-17 19:34:31 +00:00
ntype = (node) -> car node
nvalu = (node) -> cadr node
2015-05-21 20:02:39 +00:00
2015-06-17 19:34:31 +00:00
definitial = (name, value = nil) ->
env_global = (cons (cons name, value), env_global)
name
2015-05-21 20:02:39 +00:00
defprimitive = (name, nativ, arity) ->
definitial name, ((args) ->
vmargs = listToVector(args)
if (vmargs.length == arity)
nativ.apply null, vmargs
else
throw "Incorrect arity")
the_false_value = (cons "false", "boolean")
definitial "#t", true
definitial "#f", the_false_value
definitial "nil", nil
definitial "foo"
definitial "bar"
definitial "fib"
definitial "fact"
defpredicate = (name, nativ, arity) ->
defprimitive name, ((a, b) -> if nativ.call(null, a, b) then true else the_false_value), arity
defprimitive "cons", cons, 2
defprimitive "car", car, 2
defprimitive "set-cdr!", setcdr, 2
defprimitive "+", ((a, b) -> a + b), 2
defprimitive "*", ((a, b) -> a * b), 2
defprimitive "-", ((a, b) -> a - b), 2
defprimitive "/", ((a, b) -> a / b), 2
defpredicate "lt", ((a, b) -> a < b), 2
defpredicate "eq?", ((a, b) -> a == b), 2
extend = (env, variables, values) ->
if (pairp variables)
if (pairp values)
(cons (cons (car variables), (car values)),
(extend env, (cdr variables), (cdr values)))
else
throw "Too few values"
else if (nilp variables)
if (nilp values) then env else throw "Too many values"
else
if (symbolp variables)
(cons (cons variables, values), env)
else
nil
2015-06-17 19:34:31 +00:00
make_function = (variables, body, env, continuation) ->
continuation (values, cb) -> eprogn body, (extend env, variables, values), cb
2015-06-17 19:34:31 +00:00
invoke = (fn, args, cb) ->
fn args, cb
2015-05-21 20:02:39 +00:00
# Takes a list of nodes and calls evaluate on each one, returning the
# last one as the value of the total expression. In this example, we
2015-06-17 19:34:31 +00:00
# are hard-coding what ought to be a macro, namely the threading
# macros, "->"
2015-05-21 20:02:39 +00:00
2015-06-17 19:34:31 +00:00
eprogn = (exps, env, cb) ->
2015-05-21 20:02:39 +00:00
if (pairp exps)
if pairp (cdr exps)
2015-06-17 19:34:31 +00:00
evaluate (car exps), env, (next) ->
eprogn (cdr exps), env, cb
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
evaluate (car exps), env, cb
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
cb nil
2015-06-17 19:34:31 +00:00
evlis = (exps, env, cb) ->
if (pairp exps)
evaluate (car exps), env, (stepv) ->
evlis (cdr exps), env, (next) ->
cb cons stepv, next
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
cb(nil)
lookup = (id, env, continuation) ->
if (pairp env)
2015-05-21 20:02:39 +00:00
if (caar env) == id
2015-06-17 19:34:31 +00:00
continuation (cdar env)
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
lookup id, (cdr env), continuation
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
continuation nil
2015-05-21 20:02:39 +00:00
2015-06-17 19:34:31 +00:00
update = (id, env, value, callback) ->
if (pairp env)
2015-05-21 20:02:39 +00:00
if (caar env) == id
setcdr value, (car env)
2015-06-17 19:34:31 +00:00
callback value
2015-05-21 20:02:39 +00:00
else
2015-06-17 19:34:31 +00:00
update id, (cdr env), value, callback
2015-05-21 20:02:39 +00:00
else
nil
# This really ought to be the only place where the AST meets the
# interpreter core. I can't help but think that this design precludes
# pluggable interpreter core.
2015-06-17 19:34:31 +00:00
astSymbolsToLispSymbols = (node) ->
2015-05-21 20:02:39 +00:00
return nil if nilp node
throw "Not a list of variable names" if not (ntype(node) is 'list')
handler = (node) ->
return nil if nilp node
cons (nvalu car node), (handler cdr node)
2015-06-17 19:34:31 +00:00
handler(nvalu node)
2015-05-21 20:02:39 +00:00
2015-06-17 19:34:31 +00:00
# Takes an AST node and evaluates it and its contents. A node may be
# ("list" (... contents ...)) or ("number" 42) or ("symbol" x), etc.
cadddr = metacadr('cadddr')
evaluate = (e, env, continuation) ->
[type, exp] = [(ntype e), (nvalu e)]
if type in ["number", "string", "boolean", "vector"]
return continuation exp
else if type == "symbol"
return lookup exp, env, continuation
else if type == "list"
head = car exp
if (ntype head) == 'symbol'
switch (nvalu head)
when "quote" then continuation cdr exp
when "if"
evaluate (cadr exp), env, (result) ->
unless result == the_false_value
evaluate (caddr exp), env, continuation
else
evaluate (cadddr exp), env, continuation
when "begin" then eprogn (cdr exp), env, continuation
when "set!" then evaluate (caddr exp), env, (value) ->
update (nvalu cadr exp), env, value, continuation
when "lambda"
make_function (astSymbolsToLispSymbols cadr exp), (cddr exp), env, continuation
else
console.log(cdr exp)
evlis (cdr exp), env, (args) ->
evaluate (car exp), env, (fn) ->
invoke fn, args, continuation
else
evlis (cdr exp), env, (args) ->
evaluate (car exp), env, (fn) ->
invoke fn, args, continuation
else
throw new Error("Can't handle a #{type}")
2015-05-21 20:02:39 +00:00
2015-06-17 19:34:31 +00:00
module.exports = (c, continuation) -> evaluate c, env_global, continuation