-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathzisp.zig
More file actions
696 lines (655 loc) · 31.8 KB
/
zisp.zig
File metadata and controls
696 lines (655 loc) · 31.8 KB
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
const std = @import("std");
const EnvEntry = struct { name: []const u8, value: Lisp.LispValue };
const Env = std.SinglyLinkedList(EnvEntry);
const Lisp = struct {
env: Env, // functions, symbols
rng: std.Random.DefaultPrng,
arena: std.heap.ArenaAllocator,
const Builtins = [_]EnvEntry{
.{ .name = "true", .value = .{ .boolean = true } },
.{ .name = "#t", .value = .{ .boolean = true } },
.{ .name = "false", .value = .{ .boolean = false } },
.{ .name = "#f", .value = .{ .boolean = false } },
.{ .name = "nil", .value = .{ .boolean = false } },
.{ .name = "print", .value = .{ .builtin = lisp_print } },
.{ .name = "eq", .value = .{ .builtin = lisp_eq } },
.{ .name = "car", .value = .{ .builtin = lisp_car } },
.{ .name = "cdr", .value = .{ .builtin = lisp_cdr } },
.{ .name = "atom", .value = .{ .builtin = lisp_atom } },
.{ .name = "cons", .value = .{ .builtin = lisp_cons } },
.{ .name = "progn", .value = .{ .builtin = lisp_progn } },
.{ .name = "format", .value = .{ .builtin = lisp_format } },
.{ .name = "rand", .value = .{ .builtin = lisp_rand } },
.{ .name = "macroexpand", .value = .{ .builtin = lisp_macroexpand } },
.{ .name = "macroexpand-1", .value = .{ .builtin = lisp_macroexpand_1 } },
.{ .name = "+", .value = .{ .builtin = lisp_plus } },
.{ .name = "-", .value = .{ .builtin = lisp_minus } },
.{ .name = "*", .value = .{ .builtin = lisp_mul } },
.{ .name = "/", .value = .{ .builtin = lisp_div } },
};
fn lisp_print(_: *Lisp, args: []const LispValue) !LispValue {
std.debug.print("{s}\n", .{args[0].string});
return LispValue{ .symbol = "nil" };
}
fn lisp_eq(self: *Lisp, args: []const LispValue) !LispValue {
const ltrue = LispValue{ .boolean = true };
const lfalse = LispValue{ .boolean = false };
if (std.meta.activeTag(args[0]) != std.meta.activeTag(args[1])) return lfalse;
switch (args[0]) {
.boolean => return if (args[0].boolean == args[1].boolean) ltrue else lfalse,
.number => return if (args[0].number == args[1].number) ltrue else lfalse,
.string => return if (std.mem.eql(u8, args[0].string, args[1].string)) ltrue else lfalse,
.symbol => return if (std.mem.eql(u8, args[0].symbol, args[1].symbol)) ltrue else lfalse,
.list => {
if (args[0].list.len != args[1].list.len) return lfalse;
for (args[0].list, args[1].list) |a0, a1| {
if ((try lisp_eq(self, &[_]LispValue{ a0, a1 })).boolean == false) return lfalse;
}
return ltrue;
},
.function => return self.lisp_eq(&[_]LispValue{ .{ .list = args[0].function.value }, .{ .list = args[1].function.value } }),
.macro => return self.lisp_eq(&[_]LispValue{ .{ .list = args[0].macro.value }, .{ .list = args[1].macro.value } }),
.builtin => return if (args[0].builtin == args[1].builtin) ltrue else lfalse,
}
}
fn lisp_car(_: *Lisp, args: []const LispValue) !LispValue {
if (args[0] == .symbol and std.mem.eql(u8, args[0].symbol, "nil")) return .{ .boolean = false };
if (args[0] == .boolean and args[0].boolean == false) return .{ .boolean = false };
if (args[0] != .list) return error.CarNeedList;
if (args[0].list.len == 0) return LispValue{ .boolean = false };
return args[0].list[0];
}
fn lisp_cdr(_: *Lisp, args: []const LispValue) !LispValue {
if (args[0] == .symbol and std.mem.eql(u8, args[0].symbol, "nil")) return .{ .boolean = false };
if (args[0] == .boolean and args[0].boolean == false) return .{ .boolean = false };
if (args[0] != .list) return error.CdrNeedList;
if (args[0].list.len <= 1) return LispValue{ .boolean = false };
return LispValue{ .list = args[0].list[1..] };
}
fn lisp_atom(_: *Lisp, args: []const LispValue) !LispValue {
return switch (args[0]) {
.symbol, .number, .string, .boolean, .function, .macro, .builtin => LispValue{ .boolean = true },
.list => LispValue{ .boolean = false },
};
}
fn lisp_cons(self: *Lisp, args: []const LispValue) !LispValue {
if (args.len != 2) return error.ConsExpectTwoArguments;
var list = std.ArrayList(LispValue).init(self.arena.allocator());
const first = args[0];
const last = args[1];
try list.append(first);
if ((last == .boolean and last.boolean == false) or (last == .symbol and std.mem.eql(u8, last.symbol, "nil"))) {
return LispValue{ .list = try list.toOwnedSlice() };
}
if (last == .list) {
try list.appendSlice(last.list);
} else {
try list.append(last);
}
return LispValue{ .list = try list.toOwnedSlice() };
}
fn lisp_progn(self: *Lisp, args: []const LispValue) !LispValue {
var rc = LispValue{ .symbol = "nil" };
for (args) |arg| {
rc = try self.eval(arg);
}
return rc;
}
fn lisp_format(self: *Lisp, args: []const LispValue) !LispValue {
const output = args[0].boolean; // if true write to stdout else return as str
const fmt = args[1].string;
var vars = args[2..];
var buff = std.ArrayList(u8).init(self.arena.allocator());
var index: usize = 0;
while (index < fmt.len) {
switch (fmt[index]) {
'~' => {
index += 1; // skip ~
const specifier = fmt[index];
var writer = buff.writer();
switch (specifier) {
'~' => try buff.append('~'),
'%' => try buff.append('\n'),
'A' => { // pretty print
try writer.print("{s}", .{vars[0]});
vars = vars[1..];
},
'R' => { // "raw" format
try writer.print("{any}", .{vars[0]});
vars = vars[1..];
},
else => return error.UnknownFormatSpecifier,
}
index += 1;
},
else => |c| {
try buff.append(c);
index += 1;
},
}
}
const str = try buff.toOwnedSlice();
if (!output) return LispValue{ .string = str };
std.debug.print("{s}", .{str});
return LispValue{ .symbol = "nil" };
}
fn lisp_rand(self: *Lisp, args: []const LispValue) !LispValue {
const rng = self.rng.random();
return switch (args.len) {
0 => .{ .number = rng.float(f64) },
1 => .{ .number = @floatFromInt(rng.intRangeAtMost(i64, 0, @intFromFloat(args[0].number))) },
else => .{ .number = @floatFromInt(rng.intRangeAtMost(i64, @intFromFloat(args[0].number), @intFromFloat(args[1].number))) },
};
}
fn lisp_macroexpand(self: *Lisp, args: []const LispValue) !LispValue {
var previous = args[0];
while (true) {
const next = try self.lisp_macroexpand_1(&[_]LispValue{previous});
if ((try self.lisp_eq(&[_]LispValue{ previous, next })).boolean) break;
previous = next;
}
return previous;
}
fn lisp_macroexpand_1(self: *Lisp, args: []const LispValue) !LispValue {
if (args[0] != .list) return args[0];
switch (args[0].list[0]) {
.symbol => |symbol| {
if (self.envGet(symbol)) |sym| {
if (sym != .macro) { // check inside the list for macro
var newlist = std.ArrayList(LispValue).init(self.arena.allocator());
for (0..args[0].list.len) |i| { // for each element of list check if macro
const next = try self.lisp_macroexpand_1(&[_]LispValue{args[0].list[i]});
// if yes (because changed) add it to the new list and append next unchanged
if (!(try self.lisp_eq(&[_]LispValue{ args[0].list[i], next })).boolean) {
try newlist.append(next);
try newlist.appendSlice(args[0].list[i + 1 ..]);
break;
}
try newlist.append(args[0].list[i]);
}
return LispValue{ .list = try newlist.toOwnedSlice() };
}
// args[0] is a macro call
if (sym.macro.args.len != args[0].list[1..].len) return error.MacroWrongNumberOfArguments;
const backup_env = self.env; // to reset env later
for (sym.macro.args, args[0].list[1..]) |name, val| try self.envAdd(name, val);
var rc: LispValue = .{ .symbol = "nil" };
for (sym.macro.value) |val| rc = try self.eval(val); // only eval once
self.env = backup_env; // reset env
return rc;
}
return args[0];
},
else => return args[0],
}
}
fn lisp_plus(_: *Lisp, args: []const LispValue) !LispValue {
return LispValue{ .number = args[0].number + args[1].number };
}
fn lisp_minus(_: *Lisp, args: []const LispValue) !LispValue {
return LispValue{ .number = args[0].number - args[1].number };
}
fn lisp_mul(_: *Lisp, args: []const LispValue) !LispValue {
return LispValue{ .number = args[0].number * args[1].number };
}
fn lisp_div(_: *Lisp, args: []const LispValue) !LispValue {
return LispValue{ .number = args[0].number / args[1].number };
}
pub fn lisp_define(self: *Lisp, args: []const LispValue) anyerror!void {
if (args[0] == .symbol) {
if (args[1] != .list) {
try self.envAdd(args[0].symbol, args[1]);
} else { // (define x (lambda () true)) ; for example
try self.envAdd(args[0].symbol, try self.eval(args[1]));
}
} else if (args[0] == .list) { // (define (x) (print x))
const fname = args[0].list[0].symbol;
const fargs = args[0].list[1..];
var strargs = std.ArrayList([]const u8).init(self.arena.allocator());
for (fargs) |farg| try strargs.append(farg.symbol);
const body = args[1..];
try self.envAdd(fname, .{ .function = .{ .args = try strargs.toOwnedSlice(), .env = self.env, .value = body } });
self.env.first.?.data.value.function.env = self.env; // add itself to env for recursive calls
}
}
pub fn lisp_defmacro(self: *Lisp, args: []const LispValue) !void {
if (args[0] != .list) return error.DefineMacroExpectList;
const fname = args[0].list[0].symbol;
const fargs = args[0].list[1..];
var strargs = std.ArrayList([]const u8).init(self.arena.allocator());
for (fargs) |farg| try strargs.append(farg.symbol);
const body = args[1..];
try self.envAdd(fname, .{ .macro = .{ .args = try strargs.toOwnedSlice(), .value = body } });
}
pub fn lisp_lambda(self: *Lisp, args: []const LispValue) !LispValue {
if (args[0] == .list) {
const fargs = args[0].list;
var strargs = std.ArrayList([]const u8).init(self.arena.allocator());
for (fargs) |farg| try strargs.append(farg.symbol);
const body = args[1..];
return LispValue{ .function = .{ .args = try strargs.toOwnedSlice(), .env = self.env, .value = body } };
}
return error.InvalidLambda;
}
pub fn lisp_quasiquote(self: *Lisp, args: LispValue) !LispValue {
if (args != .list) return args;
var newlist = std.ArrayList(LispValue).init(self.arena.allocator());
for (args.list) |value| {
switch (value) {
.list => |list| {
if (list[0] == .symbol and std.mem.eql(u8, list[0].symbol, "unquote")) {
try newlist.append(try self.eval(list[1]));
} else if (list[0] == .symbol and std.mem.eql(u8, list[0].symbol, "unquote-splat")) {
switch (list[1]) {
.list => |l| try newlist.appendSlice(l),
.symbol => try newlist.appendSlice((try self.eval(list[1])).list),
else => return error.SplatExpectListOrSymbol,
}
} else {
try newlist.append(try self.lisp_quasiquote(value));
}
},
else => |val| try newlist.append(val),
}
}
return LispValue{ .list = try newlist.toOwnedSlice() };
}
pub fn init(ally: std.mem.Allocator) !Lisp {
const arena = std.heap.ArenaAllocator.init(ally);
var lisp = Lisp{ .env = .{}, .arena = arena, .rng = .init(@intCast(std.time.nanoTimestamp())) };
var next: ?*Env.Node = null;
for (Lisp.Builtins) |builtin| {
const node = try lisp.arena.allocator().create(Env.Node);
node.* = .{ .data = builtin, .next = next };
next = node;
lisp.env.prepend(node);
}
return lisp;
}
pub fn deinit(self: *Lisp) void {
self.arena.deinit();
}
// resolve string to Symbol from Env
fn envGet(self: *Lisp, symbol: []const u8) ?LispValue {
var p = self.env.first;
while (p) |n| : (p = p.?.next) {
if (std.mem.eql(u8, n.data.name, symbol)) return n.data.value;
}
return null;
}
// return pointer to node of env element
// (for example used for set!)
fn envFind(self: *Lisp, symbol: []const u8) ?*Env.Node {
var p = self.env.first;
while (p) |n| : (p = p.?.next) {
if (std.mem.eql(u8, n.data.name, symbol)) return n;
}
return null;
}
// add var/func to env
fn envAdd(self: *Lisp, name: []const u8, value: LispValue) !void {
const node = try self.arena.allocator().create(Env.Node);
node.* = .{ .data = EnvEntry{ .name = name, .value = value }, .next = self.env.first };
self.env.prepend(node);
}
// call builtin/function
pub fn call(self: *Lisp, list: []const LispValue) anyerror!LispValue {
const value = self.envGet(list[0].symbol) orelse {
std.debug.print("{}: undefined function\n", .{list[0]});
return error.UndefinedFunction;
};
var fnargs = list[1..]; // workaround for tail call
func: switch (value) {
.function => |function| {
var args = std.ArrayList(LispValue).init(self.arena.allocator());
for (fnargs) |arg| try args.append(try self.eval(arg));
if (function.args.len != args.items.len) return error.FunctionWrongNumberOfArguments;
const backup_env = self.env;
self.env = function.env;
const backup_arena = self.arena;
self.arena = std.heap.ArenaAllocator.init(backup_arena.child_allocator);
// before reset env need to free each node until we reach backup_env
for (function.args, args.items) |name, val| try self.envAdd(name, val);
var rc: LispValue = .{ .symbol = "nil" };
// need to free each rc depending on if its a str/list/...
// except last one function.value[0..function.value-1]
// return the last rc
for (function.value[0 .. function.value.len - 1]) |val| rc = try self.eval(val);
// free function memory
self.arena.deinit();
self.arena = backup_arena;
const last = function.value[function.value.len - 1];
if (last == .list and last.list[0] == .symbol and std.mem.eql(u8, last.list[0].symbol, list[0].symbol)) {
// change args
fnargs = last.list[1..];
continue :func value;
} else {
rc = try self.eval(last);
}
self.env = backup_env;
return rc;
},
.macro => |macro| {
if (macro.args.len != list[1..].len) return error.MacroWrongNumberOfArguments;
// before reset env need to free each node until we reach backup_env
const backup_env = self.env; // to reset env later
var arena_backup = self.arena;
self.arena = std.heap.ArenaAllocator.init(arena_backup.child_allocator);
for (macro.args, list[1..]) |name, val| try self.envAdd(name, val);
var rc: LispValue = .{ .symbol = "nil" };
// need to free each rc depending on if its a str/list/...
// except last one macro.value[0..macro.value-1]
// return the last rc
for (macro.value) |val| rc = try self.eval(try self.eval(val));
const rc_dup = try arena_backup.allocator().create(LispValue);
rc_dup.* = rc;
self.arena.deinit();
self.arena = arena_backup;
self.env = backup_env; // reset env
return rc;
},
.builtin => |builtin| {
// need to free the args list
// and each LispValue inside depending on if its a str/list/...
var arena_backup = self.arena;
self.arena = std.heap.ArenaAllocator.init(arena_backup.child_allocator);
var args = std.ArrayList(LispValue).init(self.arena.allocator());
defer args.deinit();
for (list[1..]) |arg| try args.append(try self.eval(arg));
const rc = try builtin(self, args.items);
const rc_dup = try arena_backup.allocator().create(LispValue);
rc_dup.* = rc;
self.arena.deinit();
self.arena = arena_backup;
return rc_dup.*;
},
.list => return try self.eval(value),
else => |e| {
std.debug.print("got: {any}\n", .{e});
return error.ExpectedFunction;
},
}
}
// eval a LispValue
pub fn eval(self: *Lisp, value: LispValue) !LispValue {
ev: switch (value) {
.number, .string, .boolean => return value, // self evaluate
.symbol => |symbol| return self.envGet(symbol) orelse {
std.debug.print("got: {s}\n", .{symbol});
return error.UnboundVariable;
},
.list => |list| { // handle list, function call, special forms
if (list.len == 0) return LispValue{ .symbol = "nil" };
switch (list[0]) {
.symbol => |symbol| {
if (std.mem.eql(u8, symbol, "define")) {
try self.lisp_define(list[1..]);
} else if (std.mem.eql(u8, symbol, "defmacro")) {
try self.lisp_defmacro(list[1..]);
} else if (std.mem.eql(u8, symbol, "lambda")) {
return try self.lisp_lambda(list[1..]);
} else if (std.mem.eql(u8, symbol, "if")) {
const boolean = try self.eval(list[1]);
if (boolean == .boolean and boolean.boolean == true) {
continue :ev list[2];
} else if (list.len > 3) {
continue :ev list[3];
}
} else if (std.mem.eql(u8, symbol, "quote")) {
if (list[1] == .list and list[1].list.len == 0) return LispValue{ .boolean = false };
return list[1];
} else if (std.mem.eql(u8, symbol, "quasiquote")) {
return self.lisp_quasiquote(list[1]);
} else if (std.mem.eql(u8, symbol, "set!")) {
const target = self.envFind(list[1].symbol) orelse return error.UnboundVariable;
target.data.value = try self.eval(list[2]);
return target.data.value;
} else if (std.mem.eql(u8, symbol, "cond")) {
for (list[1..]) |combo| {
if (combo != .list) return error.CondExpectLists;
const booleanfn = combo.list[0];
const retvalue = combo.list[1];
if ((try self.eval(booleanfn)).boolean == true) {
continue :ev retvalue;
}
}
} else {
return try self.call(list);
}
return LispValue{ .symbol = "nil" };
},
else => |e| {
std.debug.print("got: {any}\n", .{e});
return error.InvalidFunction;
},
}
},
else => return error.InvalidFunction, // couldnt have a function here yet
}
}
// parse list of tokens to a LispValue
pub const Quote = enum { None, Quote, QuasiQuote };
pub fn parse(self: *Lisp, tokens: *std.ArrayList(Token), index: *usize, quote: Quote) !LispValue {
if (index.* == tokens.items.len) return error.EOF;
switch (tokens.items[index.*]) {
.lpar => {
index.* += 1;
var list = std.ArrayList(LispValue).init(self.arena.allocator());
while (index.* < tokens.items.len and tokens.items[index.*] != .rpar) {
const value = try self.parse(tokens, index, quote);
try list.append(value);
}
if (index.* == tokens.items.len) return error.UnclosedParen;
index.* += 1; // consume ')'
return LispValue{ .list = try list.toOwnedSlice() };
},
.rpar => return error.UnexpectedRPar,
.LispValue => |lvalue| {
if (lvalue == .symbol and quote == .None and std.mem.eql(u8, lvalue.symbol, "'")) {
index.* += 1;
const value = try self.parse(tokens, index, .Quote);
var list = std.ArrayList(LispValue).init(self.arena.allocator());
try list.append(LispValue{ .symbol = "quote" });
try list.append(value);
return LispValue{ .list = try list.toOwnedSlice() };
}
if (lvalue == .symbol and quote == .None and std.mem.eql(u8, lvalue.symbol, "`")) {
index.* += 1;
const value = try self.parse(tokens, index, .QuasiQuote);
var list = std.ArrayList(LispValue).init(self.arena.allocator());
try list.append(LispValue{ .symbol = "quasiquote" });
try list.append(value);
return LispValue{ .list = try list.toOwnedSlice() };
}
if (lvalue == .symbol and quote == .QuasiQuote and std.mem.eql(u8, lvalue.symbol, ",")) {
index.* += 1;
if (tokens.items[index.*] == .LispValue and tokens.items[index.*].LispValue == .symbol and std.mem.eql(u8, tokens.items[index.*].LispValue.symbol, "@")) {
index.* += 1;
const value = try self.parse(tokens, index, .Quote);
var list = std.ArrayList(LispValue).init(self.arena.allocator());
try list.append(LispValue{ .symbol = "unquote-splat" });
try list.append(value);
return LispValue{ .list = try list.toOwnedSlice() };
} else {
const value = try self.parse(tokens, index, .None);
var list = std.ArrayList(LispValue).init(self.arena.allocator());
try list.append(LispValue{ .symbol = "unquote" });
try list.append(value);
return LispValue{ .list = try list.toOwnedSlice() };
}
}
index.* += 1;
return lvalue;
},
}
return error.InvalidToken;
}
const LispValue = union(enum) {
number: f64,
string: []const u8,
boolean: bool,
symbol: []const u8,
list: []const LispValue,
function: struct {
args: []const []const u8,
value: []const LispValue,
env: Env,
},
macro: struct {
args: []const []const u8,
value: []const LispValue,
},
builtin: *const fn (L: *Lisp, args: []const LispValue) anyerror!LispValue,
pub fn format(self: LispValue, comptime fmt: []const u8, _: std.fmt.FormatOptions, writer: anytype) !void {
const pretty = fmt.len > 0 and fmt[0] == 's';
if (pretty) {
switch (self) {
.string => |str| try writer.print("\"{s}\"", .{str}),
.symbol => |sym| try writer.print("{s}", .{sym}),
.number => |n| try writer.print("{d:.2}", .{n}),
.boolean => |b| try writer.print("{}", .{b}),
.list => |l| {
var sep: []const u8 = " ";
try writer.print("[", .{});
for (l) |v| {
try writer.print("{s}{s}", .{ sep, v });
sep = ", ";
}
try writer.print(" ]", .{});
},
.function => |f| try writer.print("Fn({s}){{ {s} }}", .{ f.args, f.value }),
.macro => |m| try writer.print("Macro({s}){{ {s} }}", .{ m.args, m.value }),
else => try writer.print("{}", .{self}),
}
} else {
switch (self) {
.number => |n| try writer.print("Number({d:.2})", .{n}),
.string => |str| try writer.print("String(\"{s}\")", .{str}),
.boolean => |b| try writer.print("Boolean({})", .{b}),
.symbol => |i| try writer.print("Symbol(\"{s}\")", .{i}),
.list => |l| {
if (pretty) {
try writer.print("List({s})", .{l});
} else {
try writer.print("List({any})", .{l});
}
},
.function => |f| try writer.print("Fn({s}){{ {any} }}", .{ f.args, f.value }),
.macro => |m| try writer.print("Macro({s}){{ {any} }}", .{ m.args, m.value }),
.builtin => try writer.print("Builtin", .{}),
}
}
}
};
const Token = union(enum) {
lpar: void,
rpar: void,
LispValue: LispValue,
pub const Iterator = struct {
data: []const u8,
ally: std.mem.Allocator,
pub fn init(ally: std.mem.Allocator, data: []const u8) Iterator {
return .{ .data = data, .ally = ally };
}
fn next(self: *Iterator) !?Token {
while (self.data.len > 0) switch (self.data[0]) {
' ', '\t', '\r', '\n' => {
self.data = self.data[1..];
continue;
},
'(', '[' => {
self.data = self.data[1..];
return .lpar;
},
')', ']' => {
self.data = self.data[1..];
return .rpar;
},
';' => { // comment
const end = std.mem.indexOfAny(u8, self.data, "\n") orelse self.data.len;
self.data = self.data[end..];
continue;
},
'"' => { // string
const end = std.mem.indexOfScalar(u8, self.data[1..], '"') orelse return error.MissingStringQuoteEnd;
const str = self.data[1 .. end + 1]; // skip quote start
self.data = self.data[end + 2 ..]; // skip quote end
return .{ .LispValue = .{ .string = try self.ally.dupe(u8, str) } };
},
'\'' => {
self.data = self.data[1..];
return .{ .LispValue = .{ .symbol = "'" } };
},
',' => {
self.data = self.data[1..];
return .{ .LispValue = .{ .symbol = "," } };
},
'@' => {
self.data = self.data[1..];
return .{ .LispValue = .{ .symbol = "@" } };
},
else => { // need to check if bool, num or identifier
const end = std.mem.indexOfAny(u8, self.data, " ()\n") orelse self.data.len;
const data = self.data[0..end];
self.data = self.data[end..];
if (std.mem.eql(u8, data, "true")) {
return .{ .LispValue = .{ .boolean = true } };
} else if (std.mem.eql(u8, data, "false")) {
return .{ .LispValue = .{ .boolean = false } };
}
const num = std.fmt.parseFloat(f64, data) catch {
return .{ .LispValue = .{ .symbol = try self.ally.dupe(u8, data) } };
};
return .{ .LispValue = .{ .number = num } };
},
};
return null;
}
};
};
};
// tokenize/parse/eval in a loop until EOF
pub fn repl(lisp: *Lisp, data: []const u8) !Lisp.LispValue {
var it = Lisp.Token.Iterator.init(lisp.arena.allocator(), data);
var tokens = std.ArrayList(Lisp.Token).init(lisp.arena.allocator());
var index: usize = 0;
var rc: Lisp.LispValue = undefined;
while (try it.next()) |token| try tokens.append(token);
while (true) {
const val = lisp.parse(&tokens, &index, .None) catch |err| {
if (err == error.EOF) break;
return err;
};
rc = try lisp.eval(val);
}
return rc;
}
test "basic" {
var lisp = try Lisp.init(std.testing.allocator);
defer lisp.deinit();
const rc = repl(&lisp, "(+ 2 (+ 1 1))");
try std.testing.expectEqual(rc, Lisp.LispValue{ .number = 4 });
}
pub fn main() !void {
var gpa = std.heap.GeneralPurposeAllocator(.{}){};
defer {
std.testing.expect(gpa.deinit() == .ok) catch @panic("gpa: leak");
}
var lisp = try Lisp.init(gpa.allocator());
defer lisp.deinit();
if (std.os.argv.len == 2) {
const data = try std.fs.cwd().readFileAlloc(gpa.allocator(), std.mem.span(std.os.argv[1]), 10 * 1024 * 1024);
defer gpa.allocator().free(data);
const rc = try repl(&lisp, data);
_ = rc;
} else {
var stdin = std.io.getStdIn().reader();
var buff: [1024]u8 = undefined;
std.debug.print("> ", .{});
while (try stdin.readUntilDelimiterOrEof(&buff, '\n')) |line| {
const rc = try repl(&lisp, line);
std.debug.print(";; {}\n> ", .{rc});
}
std.debug.print("\rBye !\n", .{});
}
}