-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlisp.py
981 lines (884 loc) · 27.6 KB
/
lisp.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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
#
# PyLisp / Pyle (Python List Expressions)
#
# Ronan Klyne, http://github.com/users/rklyne
#
# imports
import sys
import re
# Exceptions
class LispError(Exception): pass
class LispTraceableError(LispError):
# TODO: Implement Lisp tracebacks
pass
class LispCallError(LispError): pass
class LispRuntimeError(RuntimeError): pass
class ReaderError(LispError): pass
class ExpressionEvalError(LispError): pass
class LookupError(LispError): pass
class LispStackTrace(LispError):
def __init__(self, exc):
self.exc = exc.__class__.__name__ + ": " + str(exc)
self.stack = []
def add_trace(self, *tpl):
self.stack.append(tpl)
def __str__(self):
lines = ['%s%r' % (func, args, ) for func, args, kw_args in self.stack]
lines.reverse()
lines.append(str(self.exc))
return '\n'.join(lines)
# s-expression type
# TODO: Make s-expressions look like linked lists
class SExpr(tuple): pass
class Sequence(tuple): pass
class UnquoteWrapper(object):
def __init__(self, content):
self.content = content
class QuoteWrapper(object):
def __init__(self, content):
self.content = content
def __eq__(self, other):
if isinstance(other, QuoteWrapper):
return self.content == other.content
return self is other
class Symbol(str):
def __str__(self):
return "<Symbol: %s>" % super(Symbol, self).__str__()
# Well known symbols
QUOTE_SYMBOL = Symbol('quote')
# enivronment
integrated_mode = False
def start_integrated_mode():
global integrated_mode
integrated_mode = True
def stop_integrated_mode():
global integrated_mode
integrated_mode = False
class LispEnv(dict):
def __init__(self, mapping, parent=None):
super(LispEnv, self).__init__(mapping)
if parent is not None:
assert isinstance(parent, LispEnv), parent
self.parent = parent
def __getitem__(self, key, *t, **k):
if not self._has_key(key):
if self.parent is not None:
return self.parent.__getitem__(key, *t, **k)
return super(LispEnv, self).__getitem__(key, *t, **k)
def __setitem__(self, *t, **k):
assert type(t[0]) is Symbol, (t[0], type(t[0]))
return super(LispEnv, self).__setitem__(*t, **k)
def __nonzero__(self):
if super(LispEnv, self).__nonzero__():
return True
if self.parent is not None:
return bool(self.parent)
return False
def _has_key(self, key):
return super(LispEnv, self).has_key(key)
def has_key(self, key):
if self._has_key(key):
return True
if self.parent is not None:
return self.parent.has_key(key)
return False
def lookup(self, key):
return self[key]
def _flatten(self):
"Written to help debugging."
dct = {}
for k, v in self.items():
dct[k] = v
if self.parent is not None:
dct.update(self.parent._flatten())
return dct
class StackableLispEnv(object):
def __init__(self, base):
assert isinstance(base, LispEnv), base
self._stack = []
self._base = base
self.push(base)
def __str__(self):
return '<%s "%s">' % (
self.__class__.__name__,
getattr(self, 'name', '(unnamed)'),
)
__repr__ = __str__
def __getattr__(self, key, *t, **k):
if key in [
'push',
'pop',
'_stack',
'define',
]:
return self.__dict__[key]
return getattr(self._stack[-1], key, *t, **k)
def __hasattr__(self, key, *t, **k):
return hasattr(self._stack[-1], key, *t, **k)
def push(self, env):
self._stack.append(env)
def pop(self):
self._stack.pop()
assert self._stack
def define(self, key, value):
self._stack[-1][key] = value
def lookup(self, key):
return self._stack[-1][key]
def new_scope(self, mapping=None):
if mapping is None:
mapping = {}
return LispEnv(mapping, self._stack[-1])
class LispFunc(object):
extra_bindings = None
"""In general, a Python function is a PyLisp function, and a PyLisp function
needs this wrapper to make it
"""
def __init__(self, bindings, exprs, env, local_env):
assert isinstance(env, StackableLispEnv), env
self.integrated_mode = integrated_mode
if not self.integrated_mode:
assert type(bindings) is Sequence, bindings
else:
bindings = Sequence(bindings)
self.expr = SExpr((Symbol("progn"), ) + exprs)
exact_bindings = bindings
if bindings and bindings[-1][0] == '&':
self.extra_bindings = Symbol(bindings[-1][1:])
exact_bindings = bindings[:-1]
self.bindings = exact_bindings
self.def_env = env
self.def_local_env = LispEnv({}, local_env)
def __call__(self, *args_in, **kwargs_in):
# Implemented this so that Lisp code is Python callable.
# (Python code is Lisp callable, so this is also required to make Lisp
# functions Lisp callable ;))
ret = None
args = args_in
for name in self.bindings:
assert isinstance(name, Symbol), (name, self.bindings)
self.def_local_env[name] = args[0]
args = args[1:]
if self.extra_bindings:
self.def_local_env[self.extra_bindings] = args
elif args or kwargs_in:
raise LispError("Too many params to function", self, args_in, kwargs_in)
if self.integrated_mode:
env = self.def_env
else:
env = get_thread_env()
if self.def_env is not env:
raise LispCallError("Data from another Lisp", env)
im = integrated_mode
if self.integrated_mode:
start_integrated_mode()
try:
try:
try:
ret = lisp_eval(self.expr, env, self.def_local_env)
except LispStackTrace: raise
except LispError: raise
except Exception, e:
import sys
raise LispStackTrace, e, sys.exc_info()[2]
except LispStackTrace, st:
st.add_trace(self, args_in, env)
raise
finally:
if not im and self.integrated_mode:
stop_integrated_mode()
return ret
def __str__(self):
if hasattr(self, 'name'):
return self.name
return "<anonymous>"
_thread_envs = {}
def get_thread_env():
import thread
thread_id = thread.get_ident()
env = _thread_envs.get(thread_id)
if env is not None:
return env
return None
def set_thread_env(env):
import thread
thread_id = thread.get_ident()
_thread_envs[thread_id] = env
class LispMacro(LispFunc):
_lisp_macro = True
env_stack = []
def lisp_apply(f, args, env):
assert callable(f), f
try:
# XXX: Not thread safe except in pure PyLisp code
env0 = get_thread_env()
set_thread_env(env)
return f(*args)
finally:
set_thread_env(env0)
def build_basic_env():
_no_value = object()
# Maths functions
def plus(arg0, *args):
return arg0 + sum(args)
def times(arg0, *args):
result = arg0
for arg in args:
result *= arg
return result
def minus(l, r):
return l - r
def divide(l, r):
return l / r
# String functions
def string(arg0, *args):
res = str(arg0)
for arg in args: res += str(arg)
return res
# Sequence functions
def list_(*args):
return SExpr(args)
def seq(*args):
return Sequence(args)
def head(seq):
return seq[0]
def tail(seq):
return seq[1:]
def cons(el, seq):
klass = SExpr
if isinstance(seq, Sequence):
klass = Sequence
if seq is None:
return klass((el,))
return klass((el,) + seq)
def concat(*tpl):
r = ()
for x in tpl:
r = r + x
return SExpr(r)
# IO functions
def print_func(*args):
for arg in args:
print arg,
print
def println(*args):
for arg in args:
print arg,
print ""
# System functions
def assert_func(truth, message=_no_value):
if message is _no_value:
assert truth
else:
assert truth, message
def lisp_eval_(code):
return lisp_eval(code)
def read_str(code_string):
reader = StringReader(code_string)
expr = reader.get_expr()
return expr
def eval_str(code_string):
expr = read_str(code_string)
return lisp_eval(expr)
import random
def rand_int(a, b=None):
if b is None:
return random.randint(1, a)
return random.randint(a, b)
# Boolean logic functions
def equals(a, b):
return a == b
def not_(a):
return not a
# Type checking functions
def is_integer(x):
return isinstance(x, int)
def is_sexpr(x):
return isinstance(x, SExpr)
# The environment, with Lisp names.
builtin_dict = __builtins__
if not isinstance(builtin_dict, dict):
builtin_dict = builtin_dict.__dict__
builtin_env = LispEnv(builtin_dict)
env = LispEnv({
't': True,
'+': plus,
'-': minus,
'*': times,
'/': divide,
'print': print_func,
'println': println,
'str': string,
'integer?': is_integer,
'list?': is_sexpr,
'assert': assert_func,
'apply': apply,
'list': list_,
'seq': seq,
'head': head,
'tail': tail,
'cons': cons,
'concat': concat,
'eq': equals,
'=': equals,
'not': not_,
'eval': lisp_eval_,
'eval-str': eval_str,
'read-string': read_str,
'randint': rand_int,
'read-line': raw_input,
}, builtin_env)
return env
# basic_env is the bare minimum Lisp environment
_basic_env = build_basic_env()
basic_env = None
# simple_env is an extension os basic_env with core.pyl loaded
_simple_env = None
def reset():
global basic_env
global _simple_env
basic_env = None
_simple_env = None
_thread_envs.clear()
env_stack[:] = []
reset()
def make_stackable_env(env, name='(no name)'):
new_env = StackableLispEnv(env)
new_env.name = name
return new_env
def _get_basic_env():
global basic_env
if basic_env is None:
basic_env = LispEnv({}, _basic_env)
return basic_env
def get_basic_env():
return make_stackable_env(_get_basic_env(), 'basic')
def build_simple_env():
base_env = LispEnv({}, _get_basic_env())
env = make_stackable_env(base_env, 'simple')
core_file_name = 'core.pyl'
core_reader = FileReader(core_file_name)
exprs = []
for expr in core_reader:
exprs.append(expr)
expr = SExpr((Symbol("progn"), SExpr(exprs)))
lisp_eval(expr, env, LispEnv({}))
return env
def get_simple_env():
global _simple_env
if _simple_env is None:
_simple_env = build_simple_env()
return _simple_env
def resolve_def(var, env1, env2):
try:
return env1.lookup(var)
except KeyError:
try:
return env2.lookup(var)
except KeyError:
raise LookupError(var)
# The Reader
def normality_(x):
return x
class Reader(object):
"""The default Reader implementation. Reads input with Python's `raw_input`
method.
"""
_prompt = 'lisp=>'
_nl_expr = re.compile(r"[\n\r]")
_ws_expr = re.compile(r"[\t\n\r, ]")
_debug = True
symbol_start_chars = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_+-/*!?$&^#=.'
digits = '0123456789'
symbol_chars = digits
def __init__(self, input_func=raw_input):
self._raw_input = input_func
self._buffer = ''
self._last_form = None
def _input(self):
data = ''
while not data:
data = self._raw_input(self._prompt)
return data + "\n" # This nl gets stripped by python :-(
def _read(self):
try:
data = str(self._input())
except EOFError:
return ""
self._buffer += data
def _ensure_data(self, error=False):
if not self._buffer:
if self._read() == "":
if error:
raise EOFError
def _read_until(self, str_or_expr, matches=True):
if isinstance(str_or_expr, str):
expr = re.compile(str_or_expr)
else:
expr = str_or_expr
# TODO: This could be much more efficient.
data = ''
while self.peek_char() and (expr.match(self.peek_char()) is not None) != matches:
data += self.get_char()
return data
def _buffer_drop(self, count=1):
if self._debug and self._last_form is not None:
self._last_form += self._buffer[:count]
self._buffer = self._buffer[count:]
def _drop_until(self, expr, matches=True):
# TODO: This could be much more efficient if I dropped several chars at
# once. The RE is matching them all anyway...
while self.peek_char() and (expr.match(self.peek_char()) is not None) == matches:
self._buffer_drop()
def _drop_ws(self):
self._drop_until(self._ws_expr)
def _drop_until_newline(self):
self._drop_until(self._nl_expr, False)
def get_char(self):
self._ensure_data(error=True)
c = self._buffer[0]
self._buffer_drop()
return c
def peek_char(self):
"""Ensure that there is data, excepting at EOF.
Returns one character without consuming it.
"""
self._ensure_data()
if not self._buffer:
return ""
return self._buffer[0]
def get_non_ws_char(self):
self._drop_ws()
return self.get_char()
def get_expr(self, return_func=normality_):
"""Reads a form and returns one full s-expression. An s-expression may be:
0. A reader macro. These produce more complex lisp forms.
1. A Symbol
2. A number, int or float.
3. A string
4. A comment
5. A sequence
6. A parenthesised whitespace separated list of s-expressions
"""
self._last_form = ''
c = self.get_non_ws_char() # First char.
# 0. Reader macros
# 0.1 '-quoting.
if c == "'":
quoted_expr = self.get_expr(return_func=return_func)
return return_func(SExpr((QUOTE_SYMBOL, quoted_expr)))
# 0.2.a `()-quoting. (backtick)
if c == "`":
# In "`(+ x 1 ~a)" everything is quoted but 'a'.
return QuoteWrapper(self.get_expr())
# 0.2.b `,-quoting's ~unquote mechanism
if c == "~":
return return_func(UnquoteWrapper(self.get_expr(return_func=normality_)))
# 0.3 #-macros
if c == '#':
raise ReaderError, "No such macro"
# 1. A Symbol
if c in self.symbol_start_chars:
sym = c
c = self.peek_char()
while c and (c in self.symbol_chars or c in self.symbol_start_chars):
sym += c
self.get_char()
c = self.peek_char()
return return_func(Symbol(sym))
# 2. A number
if c in self.digits:
n = c
while self.peek_char() and self.peek_char() in self.digits:
n += self.get_char()
# Detect floating point numbers:
if self.peek_char() == '.':
n += self.get_char()
while self.peek_char() and self.peek_char() in self.digits:
n += self.get_char()
return return_func(float(n))
return return_func(int(n))
# 3. A string
if c == '"':
s = self._read_until('"')
if s:
while s[-1] == "\\":
s += self.get_char()
s += self._read_until('"')
# Consume the ending quote
self.get_char()
# Unescape
s = s.replace('\\n', '\n')
s = s.replace('\\t', '\t')
s = s.replace('\\r', '\r')
s = s.replace('\\"', '"')
s = s.replace('\\\\', '\\')
return return_func(s)
# 4. Comment
if c == ';':
self._drop_until_newline()
return return_func(None)
nested_expr_params = None
# 5. A sequence
if c == '[':
nested_expr_params = ']', Sequence
# 6. Parenthesised list of s-expressions
if c == '(':
nested_expr_params = ')', SExpr
# The real work for 5. and 6.
if nested_expr_params:
closing_char, expr_class = nested_expr_params
self._drop_ws()
s_expr = []
while self.peek_char() and self.peek_char() != closing_char:
s_expr.append(self.get_expr(return_func=return_func))
self._drop_ws()
# consume the closing char
self.get_char()
return return_func(expr_class(s_expr))
# Something unexpected
raise ReaderError("Unexpected form", c, self._last_form, self._buffer)
class FileReader(Reader):
_CHUNK = 256
def __init__(self, filename):
self._fp = open(filename, 'rb')
super(FileReader, self).__init__()
def _input(self):
data = self._fp.read(self._CHUNK)
if data: return data
raise EOFError
def __iter__(self):
try:
while True:
expr = self.get_expr()
if expr:
yield expr
except EOFError:
pass
class StringReader(Reader):
_CHUNK = 256
def __init__(self, text=""):
self._text = text
super(StringReader, self).__init__()
def _input(self):
ret = self._text
if ret == "":
raise EOFError
self._text = ""
return ret
def clear_input(self):
self._text = ""
def provide_input(self, text):
self._text += text
def get_remaining_input(self):
return self._text
# The Evaluator (the main bit)
# TODO: Build a dictionary of symbols to lambdas to handle special forms quickly.
_passthrough_expr_types = dict.fromkeys([
int,
float,
str,
unicode,
bool,
Sequence,
])
def lisp_eval(expr, env=None, private_env=None):
try:
return lisp_eval__(expr, env=env, private_env=private_env)
except LispStackTrace, lst:
if hasattr(lst, 'code'):
raise
lst.code = expr
lst.env = env
lst.private_env = private_env
raise
def lisp_eval__(expr, env=None, private_env=None):
"""PyLisp Evaluator.
Reserved words:
* def
* defmacro
* progn
* quote
* nil
* t
* if
* fn
* let
* binding*
"""
if env is None:
env = get_simple_env()
assert type(env) is StackableLispEnv, (type(env), env)
local_env = LispEnv({}, private_env)
if expr in [
True,
False,
None,
]:
return expr
type_e = type(expr)
assert type_e is not UnquoteWrapper, expr
if type_e is Symbol:
# 'nil' and 't' can't be overridden.
if expr == 'nil': return None
elif expr == 't': return True
else: return resolve_def(expr, local_env, env)
elif type_e is QuoteWrapper:
def unquote(qexpr):
t = type(qexpr)
if t is SExpr:
expr_out = []
# recursive descent
for e in qexpr:
expr_out.append(unquote(e))
return SExpr(expr_out)
elif t is UnquoteWrapper:
return lisp_eval(qexpr.content, env, private_env)
else:
return qexpr
return unquote(expr.content)
elif isinstance(expr, SExpr):
if len(expr) == 0:
return expr
f, r = expr[0], expr[1:]
if f == 'def':
assert len(r) == 2, r
name = r[0]
assert type(name) is Symbol, name
expr = r[1]
value = lisp_eval(expr, env, private_env)
env.define(name, value)
assert env.has_key(name), env._flatten()
return value
elif f == 'defmacro':
assert len(r) >= 3, r
name = r[0]
# A new LispMacro, with bindings and an expression body
bindings = r[1]
exprs = r[2:]
value = LispMacro(bindings, exprs, env, private_env)
env.define(name, value)
return value
elif f == 'progn':
ret = None
while r:
ret = lisp_eval(r[0], env, private_env)
r = r[1:]
return ret
elif f == QUOTE_SYMBOL:
assert len(r) == 1, expr
return r[0]
elif f == 'fn':
assert len(r) >= 2, r
# A new LispFunc, with bindings and an expression body
return LispFunc(r[0], r[1:], env, private_env)
elif f == 'if':
else_body = None
if len(r) == 3:
else_body = r[2]
test = r[0]
body = r[1]
if lisp_eval(test, env, private_env):
return lisp_eval(body, env, private_env)
elif else_body is not None:
return lisp_eval(else_body, env, private_env)
elif f == 'let*':
bindings = r[0]
body = SExpr(r[1:])
assert isinstance(bindings, Sequence)
new_private_env = LispEnv({}, private_env)
while bindings:
name = bindings[0]
expr = bindings[1]
new_private_env[name] = lisp_eval(expr, env, new_private_env)
bindings = bindings[2:]
return lisp_eval(body, env, new_private_env)
elif f == 'binding*':
bindings = r[0]
body = SExpr(r[1:])
assert isinstance(bindings, Sequence)
new_bindings = {}
while bindings:
name = bindings[0]
assert type(name) is Symbol, name
expr = bindings[1]
new_bindings[name] = lisp_eval(expr, env, private_env)
bindings = bindings[2:]
new_env = env.new_scope(new_bindings)
try:
env.push(new_env)
return lisp_eval(body, env, private_env)
finally:
env.pop()
elif f == '.':
if len(r) == 2:
# get
obj = lisp_eval(r[0], env, private_env)
attr = lisp_eval(r[1], env, private_env)
return getattr(obj, attr)
else:
obj = lisp_eval(r[0], env, private_env)
attr = lisp_eval(r[1], env, private_env)
value = lisp_eval(r[2], env, private_env)
return setattr(obj, attr, value)
elif f == '.?':
return hasattr(*r)
else:
# If not a special form, then treat this as a function.
# Evaluate the first form and keep it as the function object.
func = lisp_eval(f, env, private_env)
assert callable(func), (func, f, expr)
args = r
macro = hasattr(func, '_lisp_macro')
if not macro:
args = map(lambda x: lisp_eval(x, env, private_env), args)
ret = lisp_apply(func, args, env)
return ret
else:
ret = lisp_apply(func, args, env)
return lisp_eval(ret, env, private_env)
elif type_e in _passthrough_expr_types: return expr
elif callable(expr):
return expr
# TODO: Maybe some instanceof checks here?
else:
raise LispRuntimeError("Cannot evaluate this expression.", expr)
run = lisp_eval
class Lisp(object):
"""An encapsulation of Python/Lisp integration.
"""
def __init__(self):
self._env = get_simple_env()
self._local_env = LispEnv({})
class StringWrap(object):
def __init__(self, s):
self.value = s
self.string = StringWrap
class ListWrap(object):
def __init__(self, s):
self.value = s
self.list = ListWrap
def _eval(self, s):
return lisp_eval(s, self._env, self._local_env)
def _S(self, thing):
t = type(thing)
if t is tuple:
return self.SExpr(*thing)
# if t is Sequence:
# return self.Seq(*thing)
if t is list:
return self.Seq(*thing)
if t is self.list:
return list(map(self._S, thing))
if t is self.string:
return thing.value
if t is str:
return self.sym(thing)
return thing
def Seq(self, *tpl):
return Sequence(map(self._S, tpl))
def SExpr(self, *tpl):
"""Recursively convert a tuple to an s-expression.
"""
return SExpr(map(self._S, tpl))
def E(self, *tpl):
try:
# TODO: make this thread safe
start_integrated_mode()
expr = self.SExpr(*tpl)
return self._eval(expr)
finally:
stop_integrated_mode()
def Q(self, expr):
return SExpr((QUOTE_SYMBOL, expr))
def sym(self, sym_name):
return Symbol(sym_name)
def R(self, sym_name):
return self._eval(self.sym(sym_name))
F = E
__all__ = [
'F',
'E',
'S',
'Q',
'R',
'lisp_eval',
]
__call__ = E
def repl(debug=False, env=None):
"""REPL:
* R ead s-expressions and
* E valuate them, then
* P rint the results.
* L oop."""
reader = Reader()
if env is None:
env = get_simple_env()
try:
while True:
try:
expr = reader.get_expr()
if debug: print "READ:", expr
except LispError:
print "READER ERROR:"
import traceback
traceback.print_exc()
continue
try:
s = lisp_eval(expr, env)
except LispError:
print "EVAL ERROR:"
import traceback
traceback.print_exc()
except KeyboardInterrupt: break
else:
try:
print s
except:
print '???'
except (EOFError, KeyboardInterrupt):
print "Done"
def usage():
print """Usage:
lisp.py # Runs a Read-Eval-Print Loop.
lisp.py file.pyl # Executes file.pyl
"""
def main():
import sys, getopt
args_in = sys.argv[1:]
longopts = [
'help',
'verbose',
'bare',
]
shortopts = '?hv'
opts, args = getopt.getopt(args_in, shortopts, longopts)
opt_help = False
opt_verbose = 0
opt_bare = False
for opt, value in opts:
if opt in ['-h', '-?', '--help']:
opt_help = True
elif opt in ['-v', '--verbose']:
opt_verbose += 1
elif opt in ['--bare']:
opt_bare = True
debug = (opt_verbose >= 1)
if opt_help:
usage()
return
if opt_bare:
env = get_basic_env()
else:
env = get_simple_env()
if not args:
repl(debug=debug, env=env)
else:
# Each spare arg is interpreted as a file name
for filename in args:
if debug:
print "Reading", filename
reader = FileReader(filename)
for expr in reader:
result = lisp_eval(expr, env=env)
if __name__ == '__main__':
main()