-
Notifications
You must be signed in to change notification settings - Fork 2
/
ellc.c
1830 lines (1629 loc) · 59.6 KB
/
ellc.c
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
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/***** Executable and Linkable Lisp Compiler *****/
//////////////////////////////////////////////////////////////////
// //
// _| _| _|_| _| _| _| //
// _|_|_| _|_|_| _| _| _|_|_| _|_|_|_| //
// _| _| _| _| _| _|_|_|_| _| _| _| _| //
// _| _| _| _| _| _| _| _| _| _| //
// _| _| _|_|_| _| _| _|_|_| _| _|_| //
// //
// //
//////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <dlfcn.h>
#include "ellc.h"
struct ell_obj *
ellc_eval(struct ell_obj *stx_lst);
/**** AST Utilities ****/
static struct ellc_id *
ellc_make_id_cx(struct ell_obj *sym, enum ellc_ns ns, struct ell_cx *cx)
{
ell_assert_wrapper(sym, ELL_WRAPPER(sym));
struct ellc_id *id = (struct ellc_id *) ell_alloc(sizeof(*id));
id->sym = sym;
id->ns = ns;
id->cx = cx;
return id;
}
static struct ellc_id *
ellc_make_id(struct ell_obj *sym, enum ellc_ns ns)
{
return ellc_make_id_cx(sym, ns, NULL);
}
static bool
ellc_id_equal(struct ellc_id *a, struct ellc_id *b)
{
return (a->sym == b->sym) && (a->ns == b->ns) && (ell_cx_equal(a->cx, b->cx));
}
static int
ellc_id_cmp(struct ellc_id *a, struct ellc_id *b)
{
int sym_cmp = ell_sym_cmp(a->sym, b->sym);
if (sym_cmp != 0) {
return sym_cmp;
} else {
int ns_cmp = a->ns - b->ns;
if (ns_cmp != 0) {
return ns_cmp;
} else {
return ell_cx_cmp(a->cx, b->cx);
}
}
}
static struct ellc_ast_seq *
ellc_make_ast_seq()
{
struct ellc_ast_seq *ast_seq = ell_alloc(sizeof(*ast_seq));
ast_seq->exprs = ell_util_make_list();
return ast_seq;
}
static void
ellc_ast_seq_add(struct ellc_ast_seq *ast_seq, struct ellc_ast *expr)
{
ell_util_list_add(ast_seq->exprs, expr);
}
static struct ellc_ast *
ellc_make_ast(enum ellc_ast_type type)
{
struct ellc_ast *ast = (struct ellc_ast *) ell_alloc(sizeof(*ast));
ast->type = type;
return ast;
}
static int
ellc_param_boxed(struct ellc_param *p)
{
return (p->closed && p->mutable);
}
/**** Lexical Contour Utilities ****/
static struct ellc_param *
ellc_params_list_lookup(list_t *list, struct ellc_id *id)
{
for (lnode_t *n = list_first(list); n; n = list_next(list, n)) {
struct ellc_param *p = (struct ellc_param *) lnode_get(n);
if (ellc_id_equal(p->id, id))
return p;
}
return NULL;
}
static struct ellc_param *
ellc_params_lookup(struct ellc_params *params, struct ellc_id *id)
{
struct ellc_param *p;
if ((p = ellc_params_list_lookup(params->req, id))) return p;
if ((p = ellc_params_list_lookup(params->opt, id))) return p;
if ((p = ellc_params_list_lookup(params->key, id))) return p;
if (params->rest && ellc_id_equal(params->rest->id, id)) return params->rest;
if (params->all_keys && ellc_id_equal(params->all_keys->id, id)) return params->all_keys;
return NULL;
}
// Returns the contour containing a parameter with the given ID,
// from the contour C upwards, or NULL if there is no countour
// containing that parameter. If found, sets OUT to the parameter.
static struct ellc_contour *
ellc_contour_lookup(struct ellc_contour *c, struct ellc_id *id, struct ellc_param **out)
{
if (!c) return NULL;
struct ellc_param *p = ellc_params_lookup(c->lam->params, id);
if (p) {
if (out) *out = p;
return c;
} else {
return ellc_contour_lookup(c->up, id, out);
}
}
/**** Normalization: Syntax Objects -> AST ****/
/* Table of normalization functions. */
static dict_t ellc_norm_tab; // sym -> norm_fun
static struct ellc_ast *
ellc_norm_stx(struct ellc_st *st, struct ell_obj *stx);
typedef struct ellc_ast *
(ellc_norm_fun)(struct ellc_st *st, struct ell_obj *stx_lst);
/* (Simple Forms) */
static struct ellc_ast *
ellc_make_ref(struct ellc_st *st, struct ell_obj *stx_sym, enum ellc_ns ns)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_REF);
ast->ref.id = ellc_make_id_cx(ell_stx_sym_sym(stx_sym), ns, ell_stx_sym_cx(stx_sym));
return ast;
}
static struct ellc_ast *
ellc_norm_ref(struct ellc_st *st, struct ell_obj *stx_sym)
{
return ellc_make_ref(st, stx_sym, ELLC_NS_VAR);
}
static struct ellc_ast *
ellc_norm_fref(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 2);
struct ell_obj *stx_sym = ELL_SEND(stx_lst, second);
return ellc_make_ref(st, stx_sym, ELLC_NS_FUN);
}
static struct ellc_ast *
ellc_make_def(struct ellc_st *st, struct ell_obj *stx_lst, enum ellc_ns ns)
{
ell_assert_stx_lst_len(stx_lst, 3);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_DEF);
struct ell_obj *stx_sym = ELL_SEND(stx_lst, second);
ast->def.id = ellc_make_id_cx(ell_stx_sym_sym(stx_sym), ns, ell_stx_sym_cx(stx_sym));
ast->def.val = ellc_norm_stx(st, ELL_SEND(stx_lst, third));
ell_util_set_add(st->defined_globals, ast->def.id, (dict_comp_t) &ellc_id_cmp);
return ast;
}
static struct ellc_ast *
ellc_norm_def(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_def(st, stx_lst, ELLC_NS_VAR);
}
static struct ellc_ast *
ellc_norm_fdef(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_def(st, stx_lst, ELLC_NS_FUN);
}
static struct ellc_ast *
ellc_make_defp(struct ellc_st *st, struct ell_obj *stx_lst, enum ellc_ns ns)
{
ell_assert_stx_lst_len(stx_lst, 2);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_DEFP);
struct ell_obj *stx_sym = ELL_SEND(stx_lst, second);
ast->defp.id = ellc_make_id_cx(ell_stx_sym_sym(stx_sym), ns, ell_stx_sym_cx(stx_sym));
return ast;
}
static struct ellc_ast *
ellc_norm_defp(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_defp(st, stx_lst, ELLC_NS_VAR);
}
static struct ellc_ast *
ellc_norm_fdefp(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_defp(st, stx_lst, ELLC_NS_FUN);
}
static struct ellc_ast *
ellc_make_set(struct ellc_st *st, struct ell_obj *stx_lst, enum ellc_ns ns)
{
ell_assert_stx_lst_len(stx_lst, 3);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_SET);
struct ell_obj *stx_sym = ELL_SEND(stx_lst, second);
ast->set.id = ellc_make_id_cx(ell_stx_sym_sym(stx_sym), ns, ell_stx_sym_cx(stx_sym));
ast->set.val = ellc_norm_stx(st, ELL_SEND(stx_lst, third));
return ast;
}
static struct ellc_ast *
ellc_norm_set(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_set(st, stx_lst, ELLC_NS_VAR);
}
static struct ellc_ast *
ellc_norm_fset(struct ellc_st *st, struct ell_obj *stx_lst)
{
return ellc_make_set(st, stx_lst, ELLC_NS_FUN);
}
static struct ellc_ast *
ellc_norm_cond(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 4);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_COND);
ast->cond.test = ellc_norm_stx(st, ELL_SEND(stx_lst, second));
ast->cond.consequent = ellc_norm_stx(st, ELL_SEND(stx_lst, third));
ast->cond.alternative = ellc_norm_stx(st, ELL_SEND(stx_lst, fourth));
return ast;
}
static struct ellc_ast *
ellc_norm_seq(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len_min(stx_lst, 1);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_SEQ);
ast->seq.exprs = ell_util_make_list();
list_t *elts_stx = ell_util_sublist(ell_stx_lst_elts(stx_lst), 1);
for (lnode_t *n = list_first(elts_stx); n; n = list_next(elts_stx, n)) {
struct ell_obj *stx = (struct ell_obj *) lnode_get(n);
ellc_ast_seq_add(&ast->seq, ellc_norm_stx(st, stx));
}
return ast;
}
/* (Application and Arguments Dissection) */
static bool
ellc_is_key_arg_sym(struct ell_obj *sym)
{
struct ell_obj *name_str = ell_sym_name(sym);
size_t len = ell_str_len(name_str);
return (len > 1) && (ell_str_char_at(name_str, len - 1) == ':');
}
static struct ell_obj *
ellc_clean_key_arg_sym(struct ell_obj *sym)
{
ell_assert_wrapper(sym, ELL_WRAPPER(sym));
struct ell_obj *name_str = ell_sym_name(sym);
return ell_intern(ell_str_poplast(name_str));
}
static struct ellc_args *
ellc_make_args()
{
struct ellc_args *args = (struct ellc_args *) ell_alloc(sizeof(*args));
list_init(&args->pos, LISTCOUNT_T_MAX);
dict_init(&args->key, DICTCOUNT_T_MAX, (dict_comp_t) &ell_sym_cmp);
return args;
}
static struct ellc_args *
ellc_dissect_args(struct ellc_st *st, list_t *args_stx)
{
struct ellc_args *args = ellc_make_args();
for (lnode_t *n = list_first(args_stx); n; n = list_next(args_stx, n)) {
struct ell_obj *arg_stx = lnode_get(n);
if ((arg_stx->wrapper == ELL_WRAPPER(stx_sym)) &&
ellc_is_key_arg_sym(ell_stx_sym_sym(arg_stx)))
{
n = list_next(args_stx, n);
if (!n) {
ell_fail("missing value for keyword argument\n");
}
struct ell_obj *key_arg_sym =
ellc_clean_key_arg_sym(ell_stx_sym_sym(arg_stx));
struct ellc_ast *key_arg_val_ast =
ellc_norm_stx(st, (struct ell_obj *) lnode_get(n));
ell_util_dict_put(&args->key, key_arg_sym, key_arg_val_ast);
} else {
ell_util_list_add(&args->pos, ellc_norm_stx(st, arg_stx));
}
}
return args;
}
static struct ellc_ast *
ellc_make_app(struct ellc_st *st, struct ellc_ast *op, list_t *arg_stx_list)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_APP);
ast->app.op = op;
ast->app.args = ellc_dissect_args(st, arg_stx_list);
return ast;
}
static struct ellc_ast *
ellc_norm_app(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len_min(stx_lst, 2);
return ellc_make_app(st, ellc_norm_stx(st, ELL_SEND(stx_lst, second)),
ell_util_sublist(ell_stx_lst_elts(stx_lst), 2));
}
/* Takes a syntax list containing operator symbol and arguments and
normalizes it to an application AST, with a reference to the
operator function. */
static struct ellc_ast *
ellc_norm_ordinary_app(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len_min(stx_lst, 1);
struct ell_obj *op_sym_stx = ELL_SEND(stx_lst, first);
ell_assert_wrapper(op_sym_stx, ELL_WRAPPER(stx_sym));
struct ellc_ast *op_ast = ellc_make_ast(ELLC_AST_REF);
op_ast->ref.id = ellc_make_id_cx(ell_stx_sym_sym(op_sym_stx), ELLC_NS_FUN,
ell_stx_sym_cx(op_sym_stx));
return ellc_make_app(st, op_ast,
ell_util_sublist(ell_stx_lst_elts(stx_lst), 1));
}
/* (Lambda and Parameters Dissection) */
static struct ellc_param *
ellc_dissect_param(struct ellc_st *st, struct ell_obj *p_stx, dict_t *deferred_inits)
{
struct ellc_param *p = (struct ellc_param *) ell_alloc(sizeof(*p));
if (p_stx->wrapper == ELL_WRAPPER(stx_sym)) {
p->id = ellc_make_id_cx(ell_stx_sym_sym(p_stx), ELLC_NS_VAR,
ell_stx_sym_cx(p_stx));
} else if (p_stx->wrapper == ELL_WRAPPER(stx_lst)) {
ell_assert_stx_lst_len(p_stx, 2);
struct ell_obj *name_stx = ELL_SEND(p_stx, first);
struct ell_obj *init_stx = ELL_SEND(p_stx, second);
p->id = ellc_make_id_cx(ell_stx_sym_sym(name_stx), ELLC_NS_VAR,
ell_stx_sym_cx(name_stx));
ell_util_dict_put(deferred_inits, p, init_stx);
}
return p;
}
static struct ellc_params *
ellc_dissect_params(struct ellc_st *st, list_t *params_stx, dict_t *deferred_inits)
{
struct ellc_params *params =
(struct ellc_params *) ell_alloc(sizeof(*params));
list_t *req = ell_util_make_list();
list_t *opt = ell_util_make_list();
list_t *key = ell_util_make_list();
list_t *rest = ell_util_make_list();
list_t *all_keys = ell_util_make_list();
list_t *cur = req;
for (lnode_t *n = list_first(params_stx); n; n = list_next(params_stx, n)) {
struct ell_obj *p_stx = lnode_get(n);
if (p_stx->wrapper == ELL_WRAPPER(stx_sym)) {
struct ell_obj *p_sym = ell_stx_sym_sym(p_stx);
if (p_sym == ELL_SYM(param_optional)) {
cur = opt;
continue;
} else if (p_sym == ELL_SYM(param_key)) {
cur = key;
continue;
} else if (p_sym == ELL_SYM(param_rest)) {
cur = rest;
continue;
} else if (p_sym == ELL_SYM(param_all_keys)) {
cur = all_keys;
continue;
}
}
ell_util_list_add(cur, ellc_dissect_param(st, p_stx, deferred_inits));
}
if ((list_count(rest) > 1) || (list_count(all_keys) > 1)) {
ell_fail("more than one rest or all-keys parameter\n");
}
params->req = req;
params->opt = opt;
params->key = key;
if (list_count(rest) == 1)
params->rest = lnode_get(list_first(rest));
if (list_count(all_keys) == 1)
params->all_keys = lnode_get(list_first(all_keys));
return params;
}
static struct ellc_ast *
ellc_norm_lam(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 3);
struct ell_obj *params_stx = ELL_SEND(stx_lst, second);
ell_assert_wrapper(params_stx, ELL_WRAPPER(stx_lst));
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LAM);
struct ellc_contour *c = (struct ellc_contour *) ell_alloc(sizeof(*c));
c->lam = &ast->lam;
c->up = st->bottom_contour;
st->bottom_contour = c;
/* We have to defer normalization of parameter init forms until
after all parameters have been seen, and have been added to the
current lambda, so that local variable references work correctly. */
dict_t *deferred_inits = ell_util_make_dict((dict_comp_t) &ell_ptr_cmp); // param -> init_stx
ast->lam.params = ellc_dissect_params(st, ell_stx_lst_elts(params_stx), deferred_inits);
for (dnode_t *dn = dict_first(deferred_inits); dn; dn = dict_next(deferred_inits, dn)) {
struct ellc_param *param = (struct ellc_param *) dnode_getkey(dn);
struct ell_obj *init_stx = (struct ell_obj *) dnode_get(dn);
param->init = ellc_norm_stx(st, init_stx);
}
ast->lam.body = ellc_norm_stx(st, ELL_SEND(stx_lst, third));
ast->lam.env = ell_util_make_dict((dict_comp_t) &ellc_id_cmp); // unused during norm.
st->bottom_contour = c->up;
return ast;
}
static struct ellc_ast *
ellc_quote(struct ellc_st *st, struct ell_obj *stx_sym)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LIT_SYM);
ast->lit_sym.sym = stx_sym;
return ast;
}
static struct ellc_ast *
ellc_norm_quote(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 2);
return ellc_quote(st, ell_stx_sym_sym(ELL_SEND(stx_lst, second)));
}
static struct ellc_ast *
ellc_norm_loop(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 2);
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LOOP);
ast->loop.body = ellc_norm_stx(st, ELL_SEND(stx_lst, second));
return ast;
}
/* (Quasisyntax) */
static struct ellc_ast *
ellc_norm_qs(struct ellc_st *st, struct ell_obj *arg_stx, unsigned depth);
static struct ellc_ast *
ellc_build_syntax(struct ellc_st *st, struct ell_obj *stx)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LIT_STX);
if (!((stx->wrapper == ELL_WRAPPER(stx_sym))
|| (stx->wrapper == ELL_WRAPPER(stx_str)))) {
ell_fail("can't build syntax AST from non-syntax object\n");
}
ast->lit_stx.stx = stx;
return ast;
}
static struct ellc_ast *
ellc_build_syntax_list(struct ellc_st *st, list_t *asts)
{
struct ellc_args *args = ellc_make_args();
list_transfer(&args->pos, asts, list_first(asts));
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_APP);
ast->app.op = ellc_make_ref(st, ell_make_stx_sym(ELL_SYM(core_syntax_list)), ELLC_NS_FUN);
ast->app.args = args;
return ast;
}
static struct ellc_ast *
ellc_build_append_syntax_lists(struct ellc_st *st, list_t *asts)
{
struct ellc_args *args = ellc_make_args();
list_transfer(&args->pos, asts, list_first(asts));
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_APP);
ast->app.op = ellc_make_ref(st, ell_make_stx_sym(ELL_SYM(core_append_syntax_lists)), ELLC_NS_FUN);
ast->app.args = args;
return ast;
}
static struct ellc_ast *
ellc_build_quasisyntax(struct ellc_st *st, struct ell_obj *stx, unsigned depth)
{
list_t *asts = ell_util_make_list();
ell_util_list_add(asts, ellc_build_syntax(st, ell_make_stx_sym(ELL_SYM(core_quasisyntax))));
ell_util_list_add(asts, ellc_norm_qs(st, stx, depth));
return ellc_build_syntax_list(st, asts);
}
static struct ellc_ast *
ellc_build_unsyntax(struct ellc_st *st, struct ell_obj *stx, unsigned depth)
{
list_t *asts = ell_util_make_list();
ell_util_list_add(asts, ellc_build_syntax(st, ell_make_stx_sym(ELL_SYM(core_unsyntax))));
ell_util_list_add(asts, ellc_norm_qs(st, stx, depth));
return ellc_build_syntax_list(st, asts);
}
static struct ellc_ast *
ellc_build_unsyntax_splicing(struct ellc_st *st, struct ell_obj *stx, unsigned depth)
{
list_t *asts = ell_util_make_list();
ell_util_list_add(asts, ellc_build_syntax(st, ell_make_stx_sym(ELL_SYM(core_unsyntax_splicing))));
ell_util_list_add(asts, ellc_norm_qs(st, stx, depth));
return ellc_build_syntax_list(st, asts);
}
static bool
ellc_is_unsyntax_splicing_list(struct ellc_st *st, struct ell_obj *stx)
{
if (stx->wrapper != ELL_WRAPPER(stx_lst)) return 0;
if (ell_stx_lst_len(stx) != 2) return 0;
struct ell_obj *op_stx = ELL_SEND(stx, first);
return ((op_stx->wrapper == ELL_WRAPPER(stx_sym))
&& (ell_stx_sym_sym(op_stx) == ELL_SYM(core_unsyntax_splicing)));
}
static bool
ellc_is_unsyntax(struct ellc_st *st, struct ell_obj *op_stx)
{
return ((op_stx->wrapper == ELL_WRAPPER(stx_sym))
&& (ell_stx_sym_sym(op_stx) == ELL_SYM(core_unsyntax)));
}
static bool
ellc_is_quasisyntax(struct ellc_st *st, struct ell_obj *op_stx)
{
return ((op_stx->wrapper == ELL_WRAPPER(stx_sym))
&& (ell_stx_sym_sym(op_stx) == ELL_SYM(core_quasisyntax)));
}
/* Unfortunately, this code is very hard to understand. If you want
to make sense of it, first understand Alan Bawden's implementation
in appendix B of his paper "Quasiquotation in Lisp". Ha. */
static struct ellc_ast *
ellc_norm_qs_lst_helper(struct ellc_st *st, struct ell_obj *stx_lst, unsigned depth)
{
list_t *in_elts = ell_stx_lst_elts(stx_lst);
list_t *lsts = ell_util_make_list();
list_t *cur_elts = ell_util_make_list();
for (lnode_t *n = list_first(in_elts); n; n = list_next(in_elts, n)) {
struct ell_obj *sub = (struct ell_obj *) lnode_get(n);
if (ellc_is_unsyntax_splicing_list(st, sub)) {
if (list_count(cur_elts) > 0) {
ell_util_list_add(lsts, ellc_build_syntax_list(st, cur_elts));
cur_elts = ell_util_make_list();
}
if (depth == 0) {
ell_util_list_add(lsts, ellc_norm_stx(st, ELL_SEND(sub, second)));
} else {
ell_util_list_add(lsts, ellc_build_unsyntax_splicing(st, ELL_SEND(sub, second), depth - 1));
}
} else {
ell_util_list_add(cur_elts, ellc_norm_qs(st, sub, depth));
}
}
if (list_count(cur_elts) > 0)
ell_util_list_add(lsts, ellc_build_syntax_list(st, cur_elts));
return ellc_build_append_syntax_lists(st, lsts);
}
static struct ellc_ast *
ellc_norm_qs_lst(struct ellc_st *st, struct ell_obj *stx_lst, unsigned depth)
{
if (ell_stx_lst_len(stx_lst) == 0) {
return ellc_build_syntax_list(st, ell_stx_lst_elts(stx_lst));
} else {
struct ell_obj *op_stx = ELL_SEND(stx_lst, first);
if (ellc_is_unsyntax(st, op_stx)) {
ell_assert_stx_lst_len(stx_lst, 2);
struct ell_obj *arg_stx = ELL_SEND(stx_lst, second);
if (depth == 0) {
return ellc_norm_stx(st, arg_stx);
} else {
return ellc_build_unsyntax(st, arg_stx, depth - 1);
}
} else if (ellc_is_quasisyntax(st, op_stx)) {
ell_assert_stx_lst_len(stx_lst, 2);
struct ell_obj *arg_stx = ELL_SEND(stx_lst, second);
return ellc_build_quasisyntax(st, arg_stx, depth + 1);
} else {
return ellc_norm_qs_lst_helper(st, stx_lst, depth);
}
}
}
static struct ellc_ast *
ellc_norm_qs(struct ellc_st *st, struct ell_obj *arg_stx, unsigned depth)
{
if (depth < 0) {
ell_fail("negative quasiquotation depth\n");
}
if ((arg_stx->wrapper == ELL_WRAPPER(stx_str)) ||
(arg_stx->wrapper == ELL_WRAPPER(stx_sym))) {
return ellc_build_syntax(st, arg_stx);
} else if (arg_stx->wrapper == ELL_WRAPPER(stx_lst)) {
return ellc_norm_qs_lst(st, arg_stx, depth);
} else {
ell_fail("bad quasiquoted syntax object\n");
}
}
static struct ellc_ast *
ellc_norm_quasisyntax(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_stx_lst_len(stx_lst, 2);
struct ell_obj *arg_stx = ELL_SEND(stx_lst, second);
struct ellc_ast *body = ellc_norm_qs(st, arg_stx, 0);
struct ellc_ast *cx_ast = ellc_make_ast(ELLC_AST_CX);
cx_ast->cx.body = body;
return cx_ast;
}
/* (Macroexpansion) */
static bool
ellc_is_seq(struct ell_obj *stx)
{
if (stx->wrapper != ELL_WRAPPER(stx_lst)) return 0;
if (list_count(ell_stx_lst_elts(stx)) < 2) return 0; // todo: handle better
struct ell_obj *op_stx = ELL_SEND(stx, first);
return ((op_stx->wrapper == ELL_WRAPPER(stx_sym))
&& (ell_stx_sym_sym(op_stx) == ELL_SYM(core_seq)));
}
static bool
ellc_is_mdef(struct ell_obj *stx)
{
if (stx->wrapper != ELL_WRAPPER(stx_lst)) return 0;
if (list_count(ell_stx_lst_elts(stx)) != 3) return 0; // todo: handle better
struct ell_obj *op_stx = ELL_SEND(stx, first);
return ((op_stx->wrapper == ELL_WRAPPER(stx_sym))
&& (ell_stx_sym_sym(op_stx) == ELL_SYM(core_mdef)));
}
static struct ellc_ast *
ellc_norm_mdef(struct ellc_st *st, struct ell_obj *mdef_stx)
{
ell_assert_stx_lst_len(mdef_stx, 3);
struct ell_obj *name_stx = ELL_SEND(mdef_stx, second);
ell_assert_wrapper(name_stx, ELL_WRAPPER(stx_sym));
struct ell_obj *expander_stx = ELL_SEND(mdef_stx, third);
ell_util_dict_put(st->defined_macros, ell_stx_sym_sym(name_stx), expander_stx);
// Right now, eval requires a syntax list as input, so we need to
// wrap the expander expression in one.
struct ell_obj *stx_lst = ell_make_stx_lst();
ELL_SEND(stx_lst, add, expander_stx);
ell_util_dict_put(&ellc_mac_tab, ell_stx_sym_sym(name_stx), ellc_eval(stx_lst));
return NULL; // runtime noop
}
/* (Inline C) */
static struct ellc_ast *
ellc_norm_snip(struct ellc_st *st, struct ell_obj *stx_lst)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_SNIP);
ast->snip.body = ellc_norm_seq(st, stx_lst);
return ast;
}
static struct ellc_ast *
ellc_norm_stmt(struct ellc_st *st, struct ell_obj *stx_lst)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_STMT);
ast->stmt.body = ellc_norm_seq(st, stx_lst);
return ast;
}
/* (Putting it All Together) */
// This belongs somewhere else
/* (compiler-put-expander symbol function) -> unspecified */
struct ell_obj *__ell_g_compilerDputDexpander_2_;
struct ell_obj *
ellc_compiler_put_expander_code(struct ell_obj *clo, ell_arg_ct npos,
ell_arg_ct nkey, struct ell_obj **args)
{
ell_check_npos(npos, 2);
struct ell_obj *symbol = args[0];
struct ell_obj *function = args[1];
ell_assert_wrapper(symbol, ELL_WRAPPER(sym));
ell_assert_wrapper(function, ELL_WRAPPER(clo));
ell_util_dict_put(&ellc_mac_tab, symbol, function);
}
__attribute__((constructor(300))) static void
ellc_init()
{
// Constant table of normalization functions
dict_init(&ellc_norm_tab, DICTCOUNT_T_MAX, (dict_comp_t) &ell_sym_cmp);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_fref), &ellc_norm_fref);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_def), &ellc_norm_def);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_fdef), &ellc_norm_fdef);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_defp), &ellc_norm_defp);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_fdefp), &ellc_norm_fdefp);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_set), &ellc_norm_set);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_fset), &ellc_norm_fset);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_cond), &ellc_norm_cond);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_seq), &ellc_norm_seq);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_app), &ellc_norm_app);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_lam), &ellc_norm_lam);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_loop), &ellc_norm_loop);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_quote), &ellc_norm_quote);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_quasisyntax), &ellc_norm_quasisyntax);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_syntax), &ellc_norm_quasisyntax);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_mdef), &ellc_norm_mdef);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_snip), &ellc_norm_snip);
ell_util_dict_put(&ellc_norm_tab, ELL_SYM(core_stmt), &ellc_norm_stmt);
// Compiler state
dict_init(&ellc_mac_tab, DICTCOUNT_T_MAX, (dict_comp_t) &ell_sym_cmp);
__ell_g_compilerDputDexpander_2_ =
ell_make_clo(&ellc_compiler_put_expander_code, NULL);
}
static struct ellc_ast *
ellc_norm_lst(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_wrapper(stx_lst, ELL_WRAPPER(stx_lst));
struct ell_obj *op_stx = ELL_SEND(stx_lst, first);
ell_assert_wrapper(op_stx, ELL_WRAPPER(stx_sym));
struct ell_obj *op_sym = ell_stx_sym_sym(op_stx);
struct ell_cx *cx = ell_stx_sym_cx(op_stx);
struct ellc_id *id = ellc_make_id_cx(op_sym, ELLC_NS_FUN, cx);
if (ellc_contour_lookup(st->bottom_contour, id, NULL)) {
// operator is lexically fbound
return ellc_norm_ordinary_app(st, stx_lst);
} else {
dnode_t *exp_node = dict_lookup(&ellc_mac_tab, op_sym);
if (exp_node) {
// operator is a macro
struct ell_obj *expander = (struct ell_obj *) dnode_get(exp_node);
struct ell_obj *expansion_stx = ELL_CALL(expander, stx_lst);
return ellc_norm_stx(st, expansion_stx);
} else {
dnode_t *norm_node = dict_lookup(&ellc_norm_tab, op_sym);
if (norm_node) {
// operator is a special form
ellc_norm_fun *norm_fun = (ellc_norm_fun *) dnode_get(norm_node);
return norm_fun(st, stx_lst);
} else {
// operator is assumed to be global function
return ellc_norm_ordinary_app(st, stx_lst);
}
}
}
}
static struct ellc_ast *
ellc_norm_lit_str(struct ellc_st *st, struct ell_obj *stx)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LIT_STR);
ast->lit_str.str = ell_stx_str_str(stx);
return ast;
}
static struct ellc_ast *
ellc_norm_lit_num(struct ellc_st *st, struct ell_obj *stx)
{
struct ellc_ast *ast = ellc_make_ast(ELLC_AST_LIT_NUM);
ast->lit_num.num = ell_stx_num_num(stx);
return ast;
}
/* Main normalization function. Takes syntax object as input, and
returns AST. Special handling for classic Lisp evaluation rules:
symbols evaluate to the variables they name; lists evaluate to
function calls, special forms (taken from `ellc_norm_tab'), or
macro calls (taken from `ellc_mac_tab'); literals evaluate to
themselves. */
static struct ellc_ast *
ellc_norm_stx(struct ellc_st *st, struct ell_obj *stx)
{
if (stx->wrapper == ELL_WRAPPER(stx_sym)) {
return ellc_norm_ref(st, stx);
} else if (stx->wrapper == ELL_WRAPPER(stx_lst)) {
return ellc_norm_lst(st, stx);
} else if (stx->wrapper == ELL_WRAPPER(stx_str)) {
return ellc_norm_lit_str(st, stx);
} else if (stx->wrapper == ELL_WRAPPER(stx_num)) {
return ellc_norm_lit_num(st, stx);
} else {
ell_fail("syntax normalization failure\n");
}
}
static list_t *
ellc_norm_macro_pass(struct ellc_st *st, list_t *stx_elts, list_t *deferred)
{
for (lnode_t *n = list_first(stx_elts); n; n = list_next(stx_elts, n)) {
struct ell_obj *stx = (struct ell_obj *) lnode_get(n);
if (ellc_is_seq(stx)) {
ellc_norm_macro_pass(st, ell_util_sublist(ell_stx_lst_elts(stx), 1), deferred);
} else if (ellc_is_mdef(stx)) {
ellc_norm_mdef(st, stx);
} else {
ell_util_list_add(deferred, stx);
}
}
}
static struct ellc_ast_seq *
ellc_norm(struct ellc_st *st, struct ell_obj *stx_lst)
{
ell_assert_wrapper(stx_lst, ELL_WRAPPER(stx_lst));
list_t *deferred = ell_util_make_list();
ellc_norm_macro_pass(st, ell_stx_lst_elts(stx_lst), deferred);
struct ellc_ast_seq *ast_seq = ellc_make_ast_seq();
for (lnode_t *n = list_first(deferred); n; n = list_next(deferred, n)) {
struct ell_obj *stx = (struct ell_obj *) lnode_get(n);
struct ellc_ast *res = ellc_norm_stx(st, stx);
if (res) // no-ops return NULL
ellc_ast_seq_add(ast_seq, res);
}
return ast_seq;
}
/**** Closure Conversion ****/
static void
ellc_conv_ast(struct ellc_st *st, struct ellc_ast *ast);
static bool
ellc_defined_at_toplevel(struct ellc_st *st, struct ellc_id *id)
{
return ell_util_list_contains(st->defined_globals, id, (dict_comp_t) &ellc_id_cmp);
}
static void
ellc_env_add_ref(struct ellc_ast_lam *lam, struct ellc_id *id)
{
if (!dict_lookup(lam->env, id)) {
struct ellc_ast *ref = ellc_make_ast(ELLC_AST_REF);
ref->ref.id = id;
ell_util_dict_put(lam->env, id, ref);
}
}
static void
ellc_conv_ref(struct ellc_st *st, struct ellc_ast *ast)
{
struct ellc_param *p = NULL;
struct ellc_contour *c = ellc_contour_lookup(st->bottom_contour, ast->ref.id, &p);
if (!c) {
/* The identifier isn't lexically bound. Now, we still need
to check whether it's defined at the top-level in the
current unit, before we follow the rule that all variables
are considered implicitly bound at the top-level. For such
implicitly bound variables we need to ignore the hygiene
context. */
if (!ellc_defined_at_toplevel(st, ast->ref.id)) {
ast->ref.id->cx = NULL;
}
struct ellc_id *tmp_id = ast->ref.id;
ast->type = ELLC_AST_GLO_REF;
ast->glo_ref.id = tmp_id;
ell_util_set_add(st->globals, tmp_id, (dict_comp_t) &ellc_id_cmp);
} else if (c == st->bottom_contour) {
ast->type = ELLC_AST_ARG_REF;
ast->arg_ref.param = p;
} else {
ast->type = ELLC_AST_ENV_REF;
ast->env_ref.param = p;
p->closed = 1;
ellc_env_add_ref(st->bottom_contour->lam, p->id);
}
}
static void
ellc_conv_def(struct ellc_st *st, struct ellc_ast *ast)
{
ell_util_set_add(st->globals, ast->def.id, (dict_comp_t) &ellc_id_cmp);
ellc_conv_ast(st, ast->def.val);
}
static void
ellc_conv_defp(struct ellc_st *st, struct ellc_ast *ast)
{
/* See comment in ellc_conv_ref. */
if (!ellc_defined_at_toplevel(st, ast->defp.id)) {
ast->defp.id->cx = NULL;
}
ell_util_set_add(st->globals, ast->defp.id, (dict_comp_t) &ellc_id_cmp);
}
static void
ellc_conv_set(struct ellc_st *st, struct ellc_ast *ast)
{
ellc_conv_ast(st, ast->set.val);
struct ellc_param *p;
struct ellc_contour *c = ellc_contour_lookup(st->bottom_contour, ast->set.id, &p);
if (!c) {
/* See comment in ellc_conv_ref. */
if (!ellc_defined_at_toplevel(st, ast->ref.id)) {
ast->set.id->cx = NULL;
}
struct ellc_id *tmp_id = ast->set.id;
ast->type = ELLC_AST_GLO_SET;
ast->glo_set.id = tmp_id;
ell_util_set_add(st->globals, tmp_id, (dict_comp_t) &ellc_id_cmp);
} else if (c == st->bottom_contour) {
struct ellc_ast *tmp_val = ast->set.val;
ast->type = ELLC_AST_ARG_SET;
ast->arg_set.param = p;
ast->arg_set.val = tmp_val;
p->mutable = 1;
} else {
struct ellc_ast *tmp_val = ast->set.val;
ast->type = ELLC_AST_ENV_SET;
ast->env_set.param = p;
ast->env_set.val = tmp_val;
p->closed = 1;
p->mutable = 1;
ellc_env_add_ref(st->bottom_contour->lam, p->id);
}
}
static void
ellc_conv_cond(struct ellc_st *st, struct ellc_ast *ast)
{
ellc_conv_ast(st, ast->cond.test);
ellc_conv_ast(st, ast->cond.consequent);
ellc_conv_ast(st, ast->cond.alternative);
}
static void
ellc_conv_seq(struct ellc_st *st, struct ellc_ast *ast)
{
for (lnode_t *n = list_first(ast->seq.exprs); n; n = list_next(ast->seq.exprs, n))
ellc_conv_ast(st, (struct ellc_ast *) lnode_get(n));
}
static void
ellc_conv_args(struct ellc_st *st, struct ellc_args *args)
{
for (lnode_t *n = list_first(&args->pos); n; n = list_next(&args->pos, n))
ellc_conv_ast(st, (struct ellc_ast *) lnode_get(n));
for (dnode_t *n = dict_first(&args->key); n; n = dict_next(&args->key, n))
ellc_conv_ast(st, (struct ellc_ast *) dnode_get(n));
}
static void
ellc_conv_app(struct ellc_st *st, struct ellc_ast *ast)
{
ellc_conv_ast(st, ast->app.op);
ellc_conv_args(st, ast->app.args);
}
static void
ellc_conv_params_list_inits(struct ellc_st *st, list_t *params)
{
for (lnode_t *n = list_first(params); n; n = list_next(params, n)) {
struct ellc_param *p = (struct ellc_param *) lnode_get(n);
if (p->init)
ellc_conv_ast(st, p->init);
}
}
static void
ellc_conv_param_inits(struct ellc_st *st, struct ellc_params *params)
{
ellc_conv_params_list_inits(st, params->opt);