aboutsummaryrefslogtreecommitdiffstats
path: root/src/parser.c
blob: 3f15b4799bb553857953602d41d7cbf27c399f12 (plain)
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
#include "parser.h"
#include "darray.h"

Token
next_token(Parser *parser) {
    return parser->tokens[parser->current_token++];
}

Token
peek_token(Parser *parser) {
    return parser->tokens[parser->current_token];
}

bool
has_next(Parser *parser) {
    return parser->current_token < array_size(parser->tokens);
}

bool
consume_rparen(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_RPAREN) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_RPAREN, tok.line, tok.col);
        return false;
    }
    return true;
}

bool
consume_lparen(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_LPAREN) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_LPAREN, tok.line, tok.col);
        return false;
    }
    return true;
}

Node *
parse_number(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_NUMBER) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_NUMBER, tok.line, tok.col);
        return NULL;
    }

    bool negative = false;
    int base = 10;
    char c = sv_next(&tok.value);
    if (c == '-') {
        negative = true;
        c = sv_next(&tok.value);
    }
    if (c == '+') {
        c = sv_next(&tok.value);
    }
    if (c == '0' && sv_peek(&tok.value) != '\0') {
        c = sv_next(&tok.value);
        if (c == 'x') {
            base = 16;
            c = sv_next(&tok.value);
        } else if (c == 'b') {
            base = 2;
            c = sv_next(&tok.value);
        } else if (!(c >= '0' && c <= '9')){
            push_error(ERR_TYPE_PARSER, ERR_MALFORMED_NUMBER, tok.line, tok.col);
            return NULL;
        }
    }

    // Integral part.
    u64 integral = 0;
    while (c != '\0') {
        ssize_t current = 0;
        if (c >= 'a' && c <= 'z' && base == 16) {
            current = (c - 'a') + 10;
        } else if (c >= 'A' && c <= 'Z' && base == 16) {
            current = (c - 'A') + 10;
        } else if (c >= '0' && c <= '9') {
            current = (c - '0');
        } else if (c == '.') {
            c = sv_next(&tok.value);
            break;
        } else {
            push_error(ERR_TYPE_PARSER, ERR_MALFORMED_NUMBER, tok.line, tok.col);
            return NULL;
        }
        integral = integral * base + current;
        c = sv_next(&tok.value);
    }

    // Fractional part.
    u64 fractional = 0;
    while (c != '\0') {
        ssize_t current = 0;
        if (c >= 'a' && c <= 'z' && base == 16) {
            current = (c - 'a') + 10;
        } else if (c >= 'A' && c <= 'Z' && base == 16) {
            current = (c - 'A') + 10;
        } else if (c >= '0' && c <= '9') {
            current = (c - '0');
        } else {
            push_error(ERR_TYPE_PARSER, ERR_MALFORMED_NUMBER, tok.line, tok.col);
            return NULL;
        }
        fractional = fractional * base + current;
        c = sv_next(&tok.value);
    }

    Node * node = alloc_node(NODE_NUMBER);
    node->number.negative = negative;
    node->number.integral = integral;
    node->number.fractional = fractional;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_string(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_STRING) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_STRING, tok.line, tok.col);
        return NULL;
    }
    Node *node = alloc_node(NODE_STRING);
    node->string = tok.value;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_symbol(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_SYMBOL) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_SYMBOL, tok.line, tok.col);
        return NULL;
    }
    Node *node = alloc_node(NODE_SYMBOL);
    node->string = tok.value;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_type(Parser *parser) {
    Token tok = next_token(parser);
    if (tok.type != TOKEN_COLON) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_TYPE, tok.line, tok.col);
        return NULL;
    }
    Node *node = alloc_node(NODE_TYPE);
    node->line = tok.line;
    node->col = tok.col;
    tok = next_token(parser);
    if (tok.type != TOKEN_SYMBOL) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_TYPE, tok.line, tok.col);
        return NULL;
    }
    node->string = tok.value;
    return node;
}

Node *
parse_bool(Parser *parser) {
    Token tok = next_token(parser);
    if (!(tok.type == TOKEN_TRUE || tok.type == TOKEN_FALSE)) {
        push_error(ERR_TYPE_PARSER, ERR_NOT_A_BOOL, tok.line, tok.col);
        return NULL;
    }
    Node *node = alloc_node(NODE_BOOL);
    node->boolean = tok.type == TOKEN_TRUE;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_builtin(Parser *parser) {
    Token tok = next_token(parser);
    Node *node = alloc_node(NODE_BUILTIN);
    node->builtin.type = tok.type;
    node->line = tok.line;
    node->col = tok.col;
    array_init(node->builtin.args, 0);
    while (has_next(parser)) {
        Token next = peek_token(parser);
        if (next.type == TOKEN_RPAREN) {
            next_token(parser);
            return node;
        }
        Node *arg = parse_next(parser);
        if (arg == NULL) {
            break;
        }
        array_push(node->builtin.args, arg);
    }
    push_error(ERR_TYPE_PARSER, ERR_UNMATCHED_PAREN, tok.line, tok.col);
    return NULL;
}

Node *
parse_funcall(Parser *parser) {
    Token tok = peek_token(parser);
    Node *name = parse_symbol(parser);
    if (name == NULL) {
        return NULL;
    }
    Node *node = alloc_node(NODE_FUNCALL);
    node->funcall.name = name;
    node->line = tok.line;
    node->col = tok.col;
    array_init(node->funcall.args, 0);
    while (has_next(parser)) {
        Token next = peek_token(parser);
        if (next.type == TOKEN_RPAREN) {
            next_token(parser);
            return node;
        }
        Node *arg = parse_next(parser);
        if (arg == NULL) {
            break;
        }
        array_push(node->funcall.args, arg);
    }
    push_error(ERR_TYPE_PARSER, ERR_UNMATCHED_PAREN, tok.line, tok.col);
    return NULL;
}

Node *
parse_def(Parser *parser) {
    Token tok = next_token(parser);

    Node *symbol = parse_symbol(parser);
    if (symbol == NULL) {
        return NULL;
    }

    // TODO: Making type definitions mandatory for now until we introduce type
    // inference.
    Node *type = parse_type(parser);
    if (type == NULL) {
        return NULL;
    }

    Node *value = parse_next(parser);
    if (value == NULL) {
        return NULL;
    }

    if (!consume_rparen(parser)) {
        return NULL;
    }

    Node *node = alloc_node(NODE_DEF);
    node->def.symbol = symbol;
    node->def.value = value;
    node->def.type = type;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_set(Parser *parser) {
    Token tok = next_token(parser);

    Node *symbol = parse_symbol(parser);
    if (symbol == NULL) {
        return NULL;
    }

    Node *value = parse_next(parser);
    if (value == NULL) {
        return NULL;
    }

    if (!consume_rparen(parser)) {
        return NULL;
    }

    Node *node = alloc_node(NODE_SET);
    node->set.symbol = symbol;
    node->set.value = value;
    node->line = tok.line;
    node->col = tok.col;
    return node;
}

Node *
parse_fun(Parser *parser) {
    Token tok = next_token(parser);

    Node *name = parse_symbol(parser);
    if (name == NULL) {
        return NULL;
    }

    Node *node = alloc_node(NODE_FUN);
    node->fun.name = name;
    array_init(node->fun.param_names, 0);
    array_init(node->fun.param_types, 0);
    node->line = tok.line;
    node->col = tok.col;

    // Parse parameter list and return type.
    if (!consume_lparen(parser)) {
        return NULL;
    }
    while (true) {
        Token next = peek_token(parser);
        if (next.type == TOKEN_RPAREN) {
            next_token(parser);
            break;
        }
        Node *name = parse_symbol(parser);
        if (name == NULL) {
            return NULL;
        }
        Node *type = parse_type(parser);
        if (type == NULL) {
            return NULL;
        }
        array_push(node->fun.param_names, name);
        array_push(node->fun.param_types, type);
    }
    Node *ret_type = parse_type(parser);
    if (ret_type == NULL) {
        return NULL;
    }
    node->fun.return_type = ret_type;

    Node *body = parse_next(parser);
    if (body == NULL) {
        return NULL;
    }
    node->fun.body = body;
    if (!consume_rparen(parser)) {
        return NULL;
    }

    return node;
}

Node *
parse_if(Parser *parser) {
    Token tok = next_token(parser);

    Node *node = alloc_node(NODE_IF);
    node->ifexpr.cond = NULL;
    node->ifexpr.expr_true = NULL;
    node->ifexpr.expr_false = NULL;
    node->line = tok.line;
    node->col = tok.col;

    Node *cond = parse_next(parser);
    if (cond == NULL) {
        return NULL;
    }
    Node *expr_true = parse_next(parser);
    if (expr_true == NULL) {
        return NULL;
    }
    node->ifexpr.cond = cond;
    node->ifexpr.expr_true = expr_true;
    tok = peek_token(parser);

    // Optional else statement.
    if (tok.type != TOKEN_RPAREN) {
        Node *expr_false = parse_next(parser);
        if (expr_false == NULL) {
            return NULL;
        }
        node->ifexpr.expr_false = expr_false;
    }

    if (!consume_rparen(parser)) {
        return NULL;
    }

    return node;
}

Node *
parse_paren(Parser *parser) {
    next_token(parser); // Skip paren.

    Token tok = peek_token(parser);

    switch (tok.type) {
        // Builtin functions.
        case TOKEN_ADD:
        case TOKEN_SUB:
        case TOKEN_MUL:
        case TOKEN_DIV:
        case TOKEN_MOD:
        case TOKEN_NOT:
        case TOKEN_AND:
        case TOKEN_OR:
        case TOKEN_EQ:
        case TOKEN_LT:
        case TOKEN_GT:
        case TOKEN_LE:
        case TOKEN_GE: { return parse_builtin(parser); } break;
        // Special functions.
        case TOKEN_DEF: { return parse_def(parser); } break;
        case TOKEN_SET: { return parse_set(parser); } break;
        case TOKEN_FUN: { return parse_fun(parser); } break;
        case TOKEN_IF: { return parse_if(parser); } break;
        default: break;
    }

    return parse_funcall(parser);
}

Node *
parse_block(Parser *parser) {
    Token tok = next_token(parser);

    Node *node = alloc_node(NODE_BLOCK);
    array_init(node->block.expr, 0);
    node->line = tok.line;
    node->col = tok.col;
    while (true) {
        Token next = peek_token(parser);
        if (next.type == TOKEN_RCURLY) {
            next_token(parser);
            break;
        }
        Node *expr = parse_next(parser);
        if (expr == NULL) {
            return NULL;
        }
        array_push(node->block.expr, expr);
    }
    return node;
}

Node *
parse_next(Parser *parser) {
    Token tok = peek_token(parser);
    switch (tok.type) {
        case TOKEN_NUMBER: { return parse_number(parser); } break;
        case TOKEN_STRING: { return parse_string(parser); } break;
        case TOKEN_SYMBOL: { return parse_symbol(parser); } break;
        case TOKEN_TRUE:
        case TOKEN_FALSE: { return parse_bool(parser); } break;
        case TOKEN_LPAREN: { return parse_paren(parser); } break;
        case TOKEN_EOF: { return NULL; } break;
        case TOKEN_LCURLY: { return parse_block(parser); } break;
        default: {
            push_error(ERR_TYPE_PARSER, ERR_UNKNOWN_TOK_TYPE, tok.line, tok.col);
            return NULL;
        } break;
    }
}

bool
parse_roots(Parser *parser) {
    while (has_next(parser)) {
        Token tok = peek_token(parser);
        if (tok.type == TOKEN_EOF) {
            break;
        }
        Node *node = parse_next(parser);
        if (node == NULL) {
            return false;
        }
        array_push(parser->roots, node);
    }
    return true;
}

Root *
parse(Token *tokens) {
    Parser parser = {
        .tokens = tokens,
        .current_token = 0,
    };
    array_init(parser.roots, 0);

    if (!parse_roots(&parser)) {
        return NULL;
    }
    return parser.roots;
}