-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathls9-syncheck.nw
146 lines (123 loc) · 2.62 KB
/
ls9-syncheck.nw
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
Syntax checker
<<ls9 impl>>=
full length(full n) {
full k;
for (k = 0; n != NIL; n = cdr(n))
k++;
return k;
}
void ckargs(full x, full min, full max) {
full k;
char buf[100];
k = length(x) - 1;
if (k < min || k > max) {
sprintf(buf, "%s: wrong number of arguments",
symname(car(x)));
error(buf, x);
}
}
int ckseq(full x, int top) {
for (; pairp(x); x = cdr(x))
syncheck(car(x), top);
return 0;
}
int ckapply(full x) {
ckargs(x, 2, FULL_MAX);
return 0;
}
int ckdef(full x, int top) {
ckargs(x, 2, 2);
if (!symbolp(cadr(x)))
error("def: expected symbol", cadr(x));
if (!top) error("def: must be at top level", x);
return syncheck(caddr(x), 0);
}
int ckif(full x) {
ckargs(x, 2, 3);
return ckseq(cdr(x), 0);
}
int ckifstar(full x) {
ckargs(x, 2, 2);
return ckseq(cdr(x), 0);
}
int symlistp(full x) {
full p;
for (p = x; pairp(p); p = cdr(p)) {
if (!symbolp(car(p)))
return 0;
}
return symbolp(p) || NIL == p;
}
full memq(full x, full a) {
for (; a != NIL; a = cdr(a))
if (car(a) == x) return a;
return NIL;
}
int uniqlistp(full x) {
if (NIL == x) return 1;
while (cdr(x) != NIL) {
if (memq(car(x), cdr(x)) != NIL)
return 0;
x = cdr(x);
}
return 1;
}
full flatargs(full a) {
full n;
protect(n = NIL);
while (pairp(a)) {
n = cons(car(a), n);
car(Protected) = n;
a = cdr(a);
}
if (a != NIL) n = cons(a, n);
unprot(1);
return nreverse(n);
}
int cklambda(full x) {
ckargs(x, 2, FULL_MAX);
if (!symlistp(cadr(x)))
error("lambda: invalid formals", cadr(x));
if (!uniqlistp(flatargs(cadr(x))))
error("lambda: duplicate formal", cadr(x));
return ckseq(cddr(x), 0);
}
int ckmacro(full x, int top) {
ckargs(x, 2, 2);
if (!symbolp(cadr(x)))
error("macro: expected symbol", cadr(x));
if (!top) error("macro: must be at top level", x);
return syncheck(caddr(x), 0);
}
int ckprog(full x, int top) {
return ckseq(cdr(x), top);
}
int ckquote(full x) {
ckargs(x, 1, 1);
return 0;
}
int cksetq(full x) {
ckargs(x, 2, 2);
if (!symbolp(cadr(x)))
error("setq: expected symbol", cadr(x));
return ckseq(cddr(x), 0);
}
int syncheck(full x, int top) {
full p;
if (atomp(x)) return 0;
for (p = x; pairp(p); p = cdr(p))
;
if (p != NIL)
error("dotted list in program", x);
if (car(x) == S_apply) return ckapply(x);
if (car(x) == S_def) return ckdef(x, top);
if (car(x) == S_if) return ckif(x);
if (car(x) == S_ifstar) return ckifstar(x);
if (car(x) == S_lambda) return cklambda(x);
if (car(x) == S_macro) return ckmacro(x, top);
if (car(x) == S_prog) return ckprog(x, top);
if (car(x) == S_quote) return ckquote(x);
if (car(x) == S_setq) return cksetq(x);
return ckseq(x, top);
}
@