/
rt.py
136 lines (111 loc) · 3.49 KB
/
rt.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
import lisptypes as types
from load import load
from primitives import Primitives
from errors import LispException
import threading
class Scope(dict):
def __init__(self, callable = None, parent = None, extend = {}):
dict.__init__(self)
self.callable = callable
self.parent = parent
self.lock = threading.Lock()
self.extend(extend)
def define(self, symbol, value):
if types.is_symbol(symbol):
symbol = symbol.value
self.lock.acquire()
self[symbol] = value
self.lock.release()
return value
def extend(self, d):
for key in d:
self.define(key, d[key])
def lookup(self, key):
rv = None
self.lock.acquire()
if self.has_key(key):
rv = self[key]
elif self.parent:
rv = self.parent.lookup(key)
self.lock.release()
return rv
class RT(object):
def __init__(self, ns = None):
if ns:
self.ns = ns
else:
prims = Primitives(self)
import primitives.math
prims.extend(primitives.math)
import primitives.concurrent
prims.extend(primitives.concurrent)
self.ns = Scope(extend = prims)
def clone(self):
return RT(ns = self.ns)
def lookup(self, scope, symbol):
value = scope.lookup(symbol.value)
if value:
return value
raise LispException("symbol \"%s\" is undefined" % symbol.value)
def define(self, symbol, value):
return self.ns.define(symbol, value)
def eval(self, scope, exp):
"""
If exp is a list, execute it as a function call.
If exp is a symbol, resolve it.
Else, return it as is.
"""
if types.is_list(exp) and not types.is_nil(exp):
return self.execute(scope, exp)
elif types.is_symbol(exp):
return self.lookup(scope, exp)
else:
return exp
def invoke(self, scope, func, args, tailrec = False):
args = list(args)
if types.is_primitive(func):
return func.invoke(scope, args)
try:
rest = list((i.value for i in func.sig)).index("&")
except ValueError:
rest = -1
if len(args) != len(func.sig):
raise LispException("%s takes %d arguments, %d given" %
(types.type_name(func),
len(func.sig), len(args)))
else:
if len(args) < rest:
raise LispException("%s takes at least %d arguments, %d given" %
(types.type_name(func), rest, len(args)))
closure = scope if tailrec else Scope(func, func.scope)
for i in xrange(len(args)):
if func.sig[i].value == "&":
closure.define(func.sig[rest+1].value,
types.mklist(args[rest:]))
rest = -1
break
else:
closure.define(func.sig[i].value, args[i])
if rest >= 0:
closure.define(func.sig[rest+1].value, types.nil)
rv = types.nil
for sexp in func.value:
rv = self.execute(closure, sexp)
return rv
def execute(self, scope, sexp):
if types.is_atomic(sexp):
return self.eval(scope, sexp)
if types.is_nil(sexp):
return sexp
func = self.eval(scope, sexp.car)
args = list(sexp.cdr)
if types.is_primitive(func):
return self.invoke(scope, func, args)
if types.is_macro(func):
return self.eval(scope, self.invoke(scope, func, args))
if types.is_function(func):
return self.invoke(scope, func, (self.eval(scope, arg) for arg in args))
raise LispException("%s is not callable" % repr(func), sexp)
def load(self, scope, stream):
for sexp in load(stream):
self.execute(scope, sexp)