-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlisp.oz
397 lines (358 loc) · 8.11 KB
/
lisp.oz
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
functor
import
Application Open System
Dictionary at 'x-oz://system/adt/Dictionary.ozf'
define
LPar = &(
RPar = &)
Quote = &'
fun {SafeCar Obj}
case Obj
of cons(A _) then @A
else nil
end
end
fun {SafeCdr Obj}
case Obj
of cons(_ D) then @D
else nil
end
end
SymTable = {Dictionary.new}
fun {MakeSym Str} S in
S = {String.toAtom Str}
if {SymTable.member S} == false then
{SymTable.put S sym(Str)}
end
{SymTable.get S}
end
SymT = {MakeSym "t"}
SymQuote = {MakeSym "quote"}
SymIf = {MakeSym "if"}
SymLambda = {MakeSym "lambda"}
SymDefun = {MakeSym "defun"}
SymSetq = {MakeSym "setq"}
fun {MakeCons A D}
cons({NewCell A} {NewCell D})
end
fun {Nreverse Lst} Rec in
fun {Rec Lst Acc} Tmp in
case Lst
of cons(_ D) then
Tmp = @D
D := Acc
{Rec Tmp Lst}
else Acc
end
end
{Rec Lst nil}
end
fun {Pairlis Lst1 Lst2} Rec in
fun {Rec Lst1 Lst2 Acc}
case Lst1|Lst2
of cons(A1 D1)|cons(A2 D2) then
{Rec @D1 @D2 {MakeCons {MakeCons @A1 @A2} Acc}}
else
{Nreverse Acc}
end
end
{Rec Lst1 Lst2 nil}
end
fun {IsSpace C}
C == &\t orelse C == &\r orelse C == &\n orelse C == &\x20
end
fun {IsDelimiter C}
C == LPar orelse C == RPar orelse C == Quote orelse {IsSpace C}
end
fun {MakeExpr Args Env}
expr({SafeCar Args} {SafeCdr Args} Env)
end
fun {SkipSpaces Str}
if Str == nil then ""
elseif {IsSpace Str.1} then {SkipSpaces Str.2}
else Str
end
end
fun {MakeNumOrSym Str}
try num({String.toInt Str})
catch _ then {MakeSym Str}
end
end
fun {ReadAtom Str} Rec in
fun {Rec Str Acc}
if Str == nil orelse {IsDelimiter Str.1} then
{MakeNumOrSym {List.reverse Acc}}|Str
else
{Rec Str.2 Str.1|Acc}
end
end
{Rec Str ""}
end
fun {ParseError S}
error(S)|""
end
fun {Read Str} S in
S = {SkipSpaces Str}
if S == nil then
{ParseError "empty input"}
elseif S.1 == RPar then
{ParseError {Append "invalid syntax: " S}}
elseif S.1 == LPar then
{ReadList S.2}
elseif S.1 == Quote then
local Elm Next
in
Elm|Next = {Read S.2}
{MakeCons SymQuote {MakeCons Elm nil}}|Next
end
else
{ReadAtom S}
end
end
fun {ReadList Str} Rec in
fun {Rec Str Acc} S Elm Next in
S = {SkipSpaces Str}
if S == nil then
{ParseError "unfinishde parenthesis"}
elseif S.1 == RPar then
{Nreverse Acc}|Str.2
else
Elm|Next = {Read S}
case Elm
of error(_) then Elm|Next
else {Rec Next {MakeCons Elm Acc}}
end
end
end
{Rec Str nil}
end
fun {PrintObj Obj}
case Obj
of nil then "nil"
[] num(N) then {Int.toString N}
[] sym(S) then S
[] error(S) then {Append "<error: " {Append S ">"}}
[] cons(_ _) then {PrintList Obj}
[] subr(_) then "<subr>"
[] expr(_ _ _) then "<expr>"
end
end
fun {PrintList Obj} Rec in
fun {Rec Obj Blank Acc}
case Obj
of cons(A D) then
{Rec @D " " {Append Acc {Append Blank {PrintObj @A}}}}
[] nil then
{Append "(" {Append Acc ")"}}
else
{Append "(" {Append Acc {Append " . " {Append {PrintObj Obj} ")"}}}}
end
end
{Rec Obj "" ""}
end
fun {FindVar Sym Env} Assoc X in
fun {Assoc Alist}
if Alist == nil then
nil
elseif {SafeCar {SafeCar Alist}} == Sym then
{SafeCar Alist}
else
{Assoc {SafeCdr Alist}}
end
end
if Env == nil then
nil
else
X = {Assoc {SafeCar Env}}
if X == nil then {FindVar Sym {SafeCdr Env}}
else X
end
end
end
GEnv = {MakeCons nil nil}
proc {AddToEnv Sym Val Env}
case Env
of cons(A _) then
A := {MakeCons {MakeCons Sym Val} @A}
end
end
fun {Eval Obj Env} Bind Op Args C Expr Sym Val in
case Obj
of nil then Obj
[] num(_) then Obj
[] error(_) then Obj
[] sym(S) then
Bind = {FindVar Obj Env}
if Bind == nil then error({Append S " has no value"})
else {SafeCdr Bind}
end
else
Op = {SafeCar Obj}
Args = {SafeCdr Obj}
if Op == SymQuote then
{SafeCar Args}
elseif Op == SymIf then
C = {Eval {SafeCar Args} Env}
case C
of error(_) then C
[] nil then {Eval {SafeCar {SafeCdr {SafeCdr Args}}} Env}
else {Eval {SafeCar {SafeCdr Args}} Env}
end
elseif Op == SymLambda then
{MakeExpr Args Env}
elseif Op == SymDefun then
Expr = {MakeExpr {SafeCdr Args} Env}
Sym = {SafeCar Args}
{AddToEnv Sym Expr GEnv}
Sym
elseif Op == SymSetq then
Val = {Eval {SafeCar {SafeCdr Args}} Env}
Sym = {SafeCar Args}
Bind = {FindVar Sym Env}
case Bind
of cons(_ D) then D := Val
else {AddToEnv Sym Val GEnv}
end
Val
else
{Apply {Eval Op Env} {Evlis Args Env}}
end
end
end
fun {Evlis Lst Env} Rec X in
fun {Rec Lst Acc} Elm in
case Lst
of cons(A D) then
Elm = {Eval @A Env}
case Elm
of error(_) then Elm
else {Rec @D {MakeCons Elm Acc}}
end
else Acc
end
end
X = {Rec Lst nil}
case X
of error(_) then X
else {Nreverse X}
end
end
fun {Progn Body Env} Rec in
fun {Rec Body Acc}
case Body
of cons(A D) then {Rec @D {Eval @A Env}}
else Acc
end
end
{Rec Body nil}
end
fun {Apply Fn Args}
case Args
of error(_) then Args
else
case Fn
of error(_) then Fn
[] subr(F) then {F Args}
[] expr(A B E) then {Progn B {MakeCons {Pairlis A Args} E}}
else error({Append {PrintObj Fn} " is not function"})
end
end
end
fun {SubrCar Args}
{SafeCar {SafeCar Args}}
end
fun {SubrCdr Args}
{SafeCdr {SafeCar Args}}
end
fun {SubrCons Args}
{MakeCons {SafeCar Args} {SafeCar {SafeCdr Args}}}
end
fun {SubrEq Args} X Y in
X = {SafeCar Args}
Y = {SafeCar {SafeCdr Args}}
case X|Y
of num(N)|num(N) then SymT
else
if X == Y then SymT
else nil
end
end
end
fun {SubrAtom Args}
case {SafeCar Args}
of cons(_ _) then nil
else SymT
end
end
fun {SubrNumberp Args}
case {SafeCar Args}
of num(_) then SymT
else nil
end
end
fun {SubrSymbolp Args}
case {SafeCar Args}
of sym(_) then SymT
else nil
end
end
fun {SubrAddOrMul Fn InitVal}
fun {$ Args} Rec in
fun {Rec Args Acc}
case Args
of cons(A D) then
case @A
of error(_) then @A
[] num(N) then {Rec @D {Fn Acc N}}
else error("wrong type")
end
else num(Acc)
end
end
{Rec Args InitVal}
end
end
SubrAdd = {SubrAddOrMul fun {$ X Y} X + Y end 0}
SubrMul = {SubrAddOrMul fun {$ X Y} X * Y end 1}
fun {SubrSubOrDivOrMod Fn}
fun {$ Args} X Y in
X = {SafeCar Args}
Y = {SafeCar {SafeCdr Args}}
case X|Y
of num(N)|num(M) then num({Fn N M})
else error("wrong type")
end
end
end
SubrSub = {SubrSubOrDivOrMod fun {$ X Y} X - Y end}
SubrDiv = {SubrSubOrDivOrMod fun {$ X Y} X div Y end}
SubrMod = {SubrSubOrDivOrMod fun {$ X Y} X mod Y end}
local
class TextFile from Open.file Open.text end
StdIn = {New TextFile init(name:stdin)}
in
proc {Repl Prompt} Line in
{System.printInfo Prompt}
Line = {StdIn getS($)}
if Line \= false then
{System.showInfo {PrintObj {Eval {Read Line}.1 GEnv}}}
{Repl Prompt}
end
end
{AddToEnv {MakeSym "car"} subr(SubrCar) GEnv}
{AddToEnv {MakeSym "cdr"} subr(SubrCdr) GEnv}
{AddToEnv {MakeSym "cons"} subr(SubrCons) GEnv}
{AddToEnv {MakeSym "eq"} subr(SubrEq) GEnv}
{AddToEnv {MakeSym "atom"} subr(SubrAtom) GEnv}
{AddToEnv {MakeSym "numberp"} subr(SubrNumberp) GEnv}
{AddToEnv {MakeSym "symbolp"} subr(SubrSymbolp) GEnv}
{AddToEnv {MakeSym "+"} subr(SubrAdd) GEnv}
{AddToEnv {MakeSym "*"} subr(SubrMul) GEnv}
{AddToEnv {MakeSym "-"} subr(SubrSub) GEnv}
{AddToEnv {MakeSym "/"} subr(SubrDiv) GEnv}
{AddToEnv {MakeSym "mod"} subr(SubrMod) GEnv}
{AddToEnv SymT SymT GEnv}
{Repl "> "}
{Application.exit 0}
end
end