-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparser.c
More file actions
339 lines (284 loc) · 10.2 KB
/
Copy pathparser.c
File metadata and controls
339 lines (284 loc) · 10.2 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
#include "parser.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
static void parser_advance(lisa_parser *parser);
static lisa_ast *expression(lisa_parser *parser);
static void error_at(lisa_parser *parser, lisa_token *token, const char *message) {
if (parser->panic_mode) return;
parser->panic_mode = true;
parser->had_error = true;
fprintf(stderr, "[line %d] Error", token->line);
if (token->type == TOKEN_EOF) {
fprintf(stderr, " at end");
} else if (token->type != TOKEN_ERROR) {
fprintf(stderr, " at '%.*s'", token->length, token->start);
}
fprintf(stderr, ": %s\n", message);
}
static void error(lisa_parser *parser, const char *message) {
error_at(parser, &parser->previous, message);
}
static void error_at_current(lisa_parser *parser, const char *message) {
error_at(parser, &parser->current, message);
}
void lisa_parser_init(lisa_parser *parser, const char *source) {
lisa_lexer_init(&parser->lexer, source);
parser->had_error = false;
parser->panic_mode = false;
parser_advance(parser);
}
static void parser_advance(lisa_parser *parser) {
parser->previous = parser->current;
for (;;) {
parser->current = lisa_lexer_next(&parser->lexer);
if (parser->current.type != TOKEN_ERROR) break;
error_at_current(parser, parser->current.start);
}
}
static bool check(lisa_parser *parser, lisa_token_type type) {
return parser->current.type == type;
}
static void consume(lisa_parser *parser, lisa_token_type type, const char *message) {
if (parser->current.type == type) {
parser_advance(parser);
return;
}
error_at_current(parser, message);
}
static bool is_symbol_token(lisa_token_type type) {
/* Symbols can also be things that look like keywords but are used as identifiers */
return type == TOKEN_SYMBOL;
}
/* --- Expression parsing --- */
static lisa_ast *parse_number(lisa_parser *parser) {
int line = parser->previous.line;
char *buf = strndup(parser->previous.start, (size_t)parser->previous.length);
errno = 0;
int64_t val = strtoll(buf, NULL, 10);
free(buf);
if (errno == ERANGE) {
error(parser, "Number literal out of range.");
return lisa_ast_int(0, line);
}
return lisa_ast_int(val, line);
}
static lisa_ast *parse_double(lisa_parser *parser) {
int line = parser->previous.line;
char *buf = strndup(parser->previous.start, (size_t)parser->previous.length);
double val = strtod(buf, NULL);
free(buf);
return lisa_ast_double(val, line);
}
static lisa_ast *parse_string(lisa_parser *parser) {
/* Token includes quotes, skip them */
return lisa_ast_string(
parser->previous.start + 1,
parser->previous.length - 2,
parser->previous.line
);
}
static lisa_ast *parse_symbol(lisa_parser *parser) {
return lisa_ast_symbol(
parser->previous.start,
parser->previous.length,
parser->previous.line
);
}
static lisa_ast *parse_def(lisa_parser *parser, int line) {
/* (def name value) — name is next token */
if (!is_symbol_token(parser->current.type)) {
error_at_current(parser, "Expected symbol after 'def'.");
return NULL;
}
parser_advance(parser);
lisa_ast *name = parse_symbol(parser);
lisa_ast *value = expression(parser);
if (value == NULL) { lisa_ast_free(name); return NULL; }
consume(parser, TOKEN_RPAREN, "Expected ')' after def.");
return lisa_ast_def(name, value, line);
}
static lisa_ast *parse_fn(lisa_parser *parser, int line) {
/* (fn [params...] body...) */
lisa_ast *node = lisa_ast_fn(line);
consume(parser, TOKEN_LBRACKET, "Expected '[' for fn parameters.");
while (!check(parser, TOKEN_RBRACKET) && !check(parser, TOKEN_EOF)) {
if (!is_symbol_token(parser->current.type)) {
error_at_current(parser, "Expected parameter name.");
lisa_ast_free(node);
return NULL;
}
parser_advance(parser);
lisa_ast_list_push(&node->as.fn.params, parse_symbol(parser));
}
consume(parser, TOKEN_RBRACKET, "Expected ']' after fn parameters.");
/* Body: one or more expressions */
while (!check(parser, TOKEN_RPAREN) && !check(parser, TOKEN_EOF)) {
lisa_ast *expr = expression(parser);
if (expr == NULL) { lisa_ast_free(node); return NULL; }
lisa_ast_list_push(&node->as.fn.body, expr);
}
if (node->as.fn.body.count == 0) {
error(parser, "fn body cannot be empty.");
lisa_ast_free(node);
return NULL;
}
consume(parser, TOKEN_RPAREN, "Expected ')' after fn body.");
return node;
}
static lisa_ast *parse_let(lisa_parser *parser, int line) {
/* (let [x 1 y 2] body...) */
lisa_ast *node = lisa_ast_let(line);
consume(parser, TOKEN_LBRACKET, "Expected '[' for let bindings.");
while (!check(parser, TOKEN_RBRACKET) && !check(parser, TOKEN_EOF)) {
if (!is_symbol_token(parser->current.type)) {
error_at_current(parser, "Expected binding name.");
lisa_ast_free(node);
return NULL;
}
parser_advance(parser);
lisa_ast_list_push(&node->as.let.bindings, parse_symbol(parser));
lisa_ast *val = expression(parser);
if (val == NULL) { lisa_ast_free(node); return NULL; }
lisa_ast_list_push(&node->as.let.bindings, val);
}
consume(parser, TOKEN_RBRACKET, "Expected ']' after let bindings.");
while (!check(parser, TOKEN_RPAREN) && !check(parser, TOKEN_EOF)) {
lisa_ast *expr = expression(parser);
if (expr == NULL) { lisa_ast_free(node); return NULL; }
lisa_ast_list_push(&node->as.let.body, expr);
}
if (node->as.let.body.count == 0) {
error(parser, "let body cannot be empty.");
lisa_ast_free(node);
return NULL;
}
consume(parser, TOKEN_RPAREN, "Expected ')' after let body.");
return node;
}
static lisa_ast *parse_if(lisa_parser *parser, int line) {
/* (if cond then else?) */
lisa_ast *cond = expression(parser);
if (cond == NULL) return NULL;
lisa_ast *then_b = expression(parser);
if (then_b == NULL) { lisa_ast_free(cond); return NULL; }
lisa_ast *else_b = NULL;
if (!check(parser, TOKEN_RPAREN)) {
else_b = expression(parser);
if (else_b == NULL) {
lisa_ast_free(cond);
lisa_ast_free(then_b);
return NULL;
}
}
consume(parser, TOKEN_RPAREN, "Expected ')' after if.");
return lisa_ast_if(cond, then_b, else_b, line);
}
static lisa_ast *parse_do(lisa_parser *parser, int line) {
/* (do exprs...) */
lisa_ast *node = lisa_ast_do(line);
while (!check(parser, TOKEN_RPAREN) && !check(parser, TOKEN_EOF)) {
lisa_ast *expr = expression(parser);
if (expr == NULL) { lisa_ast_free(node); return NULL; }
lisa_ast_list_push(&node->as.do_block.exprs, expr);
}
if (node->as.do_block.exprs.count == 0) {
error(parser, "do block cannot be empty.");
lisa_ast_free(node);
return NULL;
}
consume(parser, TOKEN_RPAREN, "Expected ')' after do.");
return node;
}
static lisa_ast *parse_list_form(lisa_parser *parser) {
/* We've consumed '(' already */
int line = parser->previous.line;
/* Empty list: () */
if (check(parser, TOKEN_RPAREN)) {
parser_advance(parser);
return lisa_ast_nil(line);
}
/* Check for special forms */
if (check(parser, TOKEN_DEF)) {
parser_advance(parser);
return parse_def(parser, line);
}
if (check(parser, TOKEN_FN)) {
parser_advance(parser);
return parse_fn(parser, line);
}
if (check(parser, TOKEN_LET)) {
parser_advance(parser);
return parse_let(parser, line);
}
if (check(parser, TOKEN_IF)) {
parser_advance(parser);
return parse_if(parser, line);
}
if (check(parser, TOKEN_DO)) {
parser_advance(parser);
return parse_do(parser, line);
}
/* Function call: (callee args...) */
lisa_ast *callee = expression(parser);
if (callee == NULL) return NULL;
lisa_ast *call = lisa_ast_call(callee, line);
while (!check(parser, TOKEN_RPAREN) && !check(parser, TOKEN_EOF)) {
lisa_ast *arg = expression(parser);
if (arg == NULL) { lisa_ast_free(call); return NULL; }
lisa_ast_list_push(&call->as.call.args, arg);
}
consume(parser, TOKEN_RPAREN, "Expected ')' after arguments.");
return call;
}
static lisa_ast *expression(lisa_parser *parser) {
parser_advance(parser);
switch (parser->previous.type) {
case TOKEN_NUMBER: return parse_number(parser);
case TOKEN_DOUBLE: return parse_double(parser);
case TOKEN_STRING: return parse_string(parser);
case TOKEN_TRUE: return lisa_ast_bool(1, parser->previous.line);
case TOKEN_FALSE: return lisa_ast_bool(0, parser->previous.line);
case TOKEN_NIL: return lisa_ast_nil(parser->previous.line);
case TOKEN_SYMBOL: return parse_symbol(parser);
case TOKEN_LPAREN: return parse_list_form(parser);
case TOKEN_EOF:
error(parser, "Unexpected end of input.");
return NULL;
default:
error(parser, "Unexpected token.");
return NULL;
}
}
lisa_ast *lisa_parse_expr(lisa_parser *parser) {
return expression(parser);
}
lisa_ast **lisa_parse(lisa_parser *parser, int *count) {
int cap = 8;
lisa_ast **exprs = malloc(sizeof(lisa_ast*) * (size_t)cap);
*count = 0;
while (!check(parser, TOKEN_EOF)) {
lisa_ast *expr = expression(parser);
if (expr == NULL) {
/* Error recovery: skip to next top-level form */
parser->panic_mode = false;
while (!check(parser, TOKEN_EOF) && !check(parser, TOKEN_LPAREN)) {
parser_advance(parser);
}
continue;
}
if (*count >= cap) {
cap *= 2;
exprs = realloc(exprs, sizeof(lisa_ast*) * (size_t)cap);
}
exprs[(*count)++] = expr;
}
return exprs;
}
void lisa_parse_free(lisa_ast **exprs, int count) {
for (int i = 0; i < count; i++) {
lisa_ast_free(exprs[i]);
}
free(exprs);
}