-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlexer.c
More file actions
737 lines (599 loc) · 19 KB
/
lexer.c
File metadata and controls
737 lines (599 loc) · 19 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
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
// lexer.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "lexer.h"
typedef struct {
const char* source;
const char* start;
const char* current;
int line;
int column;
int offset;
int tokenLine;
int tokenColumn;
int tokenOffset;
int indentStack[MAX_INDENTS];
int indentCount;
int pendingDedents;
int atLineStart;
int groupDepth;
Diagnostics* diagnostics;
} Scanner;
void initDiagnostics(Diagnostics* diagnostics) {
diagnostics->errorCount = 0;
diagnostics->warningCount = 0;
}
static void reportLexerError(
Diagnostics* diagnostics,
int line,
int column,
int offset,
const char* message
) {
diagnostics->errorCount++;
fprintf(stderr,
"[lex error] line %d, col %d, off %d: %s\n",
line, column, offset, message);
}
void initTokenArray(TokenArray* array) {
array->data = NULL;
array->count = 0;
array->capacity = 0;
}
void freeTokenArray(TokenArray* array) {
free(array->data);
array->data = NULL;
array->count = 0;
array->capacity = 0;
}
static void pushToken(TokenArray* array, Token token) {
if (array->count >= array->capacity) {
int newCapacity = (array->capacity < 8) ? 8 : array->capacity * 2;
Token* newData = (Token*)realloc(array->data, sizeof(Token) * newCapacity);
if (newData == NULL) {
fprintf(stderr, "Out of memory while growing token array.\n");
exit(1);
}
array->data = newData;
array->capacity = newCapacity;
}
array->data[array->count++] = token;
}
static void initScanner(Scanner* scanner, const char* source, Diagnostics* diagnostics) {
scanner->source = source;
scanner->start = source;
scanner->current = source;
scanner->line = 1;
scanner->column = 1;
scanner->offset = 0;
scanner->tokenLine = 1;
scanner->tokenColumn = 1;
scanner->tokenOffset = 0;
scanner->indentStack[0] = 0;
scanner->indentCount = 1;
scanner->pendingDedents = 0;
scanner->atLineStart = 1;
scanner->groupDepth = 0;
scanner->diagnostics = diagnostics;
}
static int isAtEnd(Scanner* scanner) {
return *scanner->current == '\0';
}
static char peekChar(Scanner* scanner) {
return *scanner->current;
}
static char peekNextChar(Scanner* scanner) {
if (isAtEnd(scanner) || scanner->current[1] == '\0') {
return '\0';
}
return scanner->current[1];
}
static char advanceChar(Scanner* scanner) {
char c = *scanner->current;
scanner->current++;
scanner->offset++;
if (c == '\n') {
scanner->line++;
scanner->column = 1;
scanner->atLineStart = 1;
} else {
scanner->column++;
}
return c;
}
static int matchChar(Scanner* scanner, char expected) {
if (isAtEnd(scanner)) return 0;
if (*scanner->current != expected) return 0;
advanceChar(scanner);
return 1;
}
static void markTokenStart(Scanner* scanner) {
scanner->start = scanner->current;
scanner->tokenLine = scanner->line;
scanner->tokenColumn = scanner->column;
scanner->tokenOffset = scanner->offset;
}
static void syncSyntheticTokenPos(Scanner* scanner) {
scanner->tokenLine = scanner->line;
scanner->tokenColumn = scanner->column;
scanner->tokenOffset = scanner->offset;
}
static Token buildToken(
Scanner* scanner,
TokenType type,
const char* start,
int length,
int line,
int column,
int offset
) {
Token token;
(void)scanner;
token.type = type;
token.start = start;
token.length = length;
token.line = line;
token.column = column;
token.offset = offset;
return token;
}
static Token makeToken(Scanner* scanner, TokenType type) {
return buildToken(
scanner,
type,
scanner->start,
(int)(scanner->current - scanner->start),
scanner->tokenLine,
scanner->tokenColumn,
scanner->tokenOffset
);
}
static Token makeSyntheticToken(Scanner* scanner, TokenType type) {
return buildToken(
scanner,
type,
scanner->current,
0,
scanner->tokenLine,
scanner->tokenColumn,
scanner->tokenOffset
);
}
static Token errorToken(Scanner* scanner, const char* message) {
int len = 0;
while (message[len] != '\0') {
len++;
}
reportLexerError(
scanner->diagnostics,
scanner->tokenLine,
scanner->tokenColumn,
scanner->tokenOffset,
message
);
return buildToken(
scanner,
TOKEN_ERROR,
message,
len,
scanner->tokenLine,
scanner->tokenColumn,
scanner->tokenOffset
);
}
static int isBlankOrCommentLine(Scanner* scanner) {
const char* p = scanner->current;
while (*p == ' ' || *p == '\t' || *p == '\r') {
p++;
}
return *p == '\n' || *p == '#' || *p == '\0';
}
static int isDigit(char c) {
return c >= '0' && c <= '9';
}
static int isAlpha(char c) {
return ((c >= 'a' && c <= 'z') ||
(c >= 'A' && c <= 'Z') ||
c == '_');
}
static int isAlphaNumeric(char c) {
return isAlpha(c) || isDigit(c);
}
static int stringsEqual(const char* a, int aLen, const char* b) {
int i = 0;
while (b[i] != '\0') {
if (i >= aLen || a[i] != b[i]) {
return 0;
}
i++;
}
return i == aLen;
}
static TokenType identifierType(Scanner* scanner) {
int length = (int)(scanner->current - scanner->start);
const char* text = scanner->start;
if (stringsEqual(text, length, "if")) return TOKEN_IF;
if (stringsEqual(text, length, "elif")) return TOKEN_ELIF;
if (stringsEqual(text, length, "else")) return TOKEN_ELSE;
if (stringsEqual(text, length, "while")) return TOKEN_WHILE;
if (stringsEqual(text, length, "for")) return TOKEN_FOR;
if (stringsEqual(text, length, "in")) return TOKEN_IN;
if (stringsEqual(text, length, "def")) return TOKEN_DEF;
if (stringsEqual(text, length, "class")) return TOKEN_CLASS;
if (stringsEqual(text, length, "return")) return TOKEN_RETURN;
if (stringsEqual(text, length, "True")) return TOKEN_TRUE;
if (stringsEqual(text, length, "False")) return TOKEN_FALSE;
if (stringsEqual(text, length, "None")) return TOKEN_NONE;
if (stringsEqual(text, length, "and")) return TOKEN_AND;
if (stringsEqual(text, length, "or")) return TOKEN_OR;
if (stringsEqual(text, length, "not")) return TOKEN_NOT;
if (stringsEqual(text, length, "pass")) return TOKEN_PASS;
if (stringsEqual(text, length, "break")) return TOKEN_BREAK;
if (stringsEqual(text, length, "continue")) return TOKEN_CONTINUE;
if (stringsEqual(text, length, "import")) return TOKEN_IMPORT;
return TOKEN_IDENTIFIER;
}
static void skipInlineWhitespace(Scanner* scanner) {
while (1) {
char c = peekChar(scanner);
if (c == ' ' || c == '\t' || c == '\r') {
advanceChar(scanner);
} else {
break;
}
}
}
static void skipComment(Scanner* scanner) {
while (!isAtEnd(scanner) && peekChar(scanner) != '\n') {
advanceChar(scanner);
}
}
static void skipLeadingWhitespaceOnCurrentLine(Scanner* scanner) {
while (peekChar(scanner) == ' ' ||
peekChar(scanner) == '\t' ||
peekChar(scanner) == '\r') {
advanceChar(scanner);
}
}
static void skipBlankOrCommentOnlyLine(Scanner* scanner) {
skipLeadingWhitespaceOnCurrentLine(scanner);
if (peekChar(scanner) == '#') {
skipComment(scanner);
}
if (peekChar(scanner) == '\n') {
advanceChar(scanner);
}
}
static int handleIndentation(Scanner* scanner, Token* outToken) {
const char* probe;
int indent = 0;
int currentIndent;
if (!scanner->atLineStart) return 0;
if (scanner->groupDepth > 0) return 0;
probe = scanner->current;
while (*probe == ' ' || *probe == '\t') {
indent += (*probe == ' ') ? 1 : TAB_WIDTH;
probe++;
}
if (*probe == '\n' || *probe == '#' || *probe == '\0') {
return 0;
}
while (peekChar(scanner) == ' ' || peekChar(scanner) == '\t') {
advanceChar(scanner);
}
markTokenStart(scanner);
currentIndent = scanner->indentStack[scanner->indentCount - 1];
scanner->atLineStart = 0;
if (indent > currentIndent) {
if (scanner->indentCount >= MAX_INDENTS) {
*outToken = errorToken(scanner, "Indentation stack overflow");
return 1;
}
scanner->indentStack[scanner->indentCount++] = indent;
*outToken = makeSyntheticToken(scanner, TOKEN_INDENT);
return 1;
}
if (indent < currentIndent) {
while (scanner->indentCount > 1 &&
indent < scanner->indentStack[scanner->indentCount - 1]) {
scanner->indentCount--;
scanner->pendingDedents++;
}
if (indent != scanner->indentStack[scanner->indentCount - 1]) {
*outToken = errorToken(scanner, "Inconsistent indentation");
return 1;
}
if (scanner->pendingDedents > 0) {
scanner->pendingDedents--;
*outToken = makeSyntheticToken(scanner, TOKEN_DEDENT);
return 1;
}
}
return 0;
}
static Token identifier(Scanner* scanner) {
while (isAlphaNumeric(peekChar(scanner))) {
advanceChar(scanner);
}
return makeToken(scanner, identifierType(scanner));
}
static Token number(Scanner* scanner) {
while (isDigit(peekChar(scanner))) {
advanceChar(scanner);
}
if (peekChar(scanner) == '.' && isDigit(peekNextChar(scanner))) {
advanceChar(scanner);
while (isDigit(peekChar(scanner))) {
advanceChar(scanner);
}
}
return makeToken(scanner, TOKEN_NUMBER);
}
static Token string(Scanner* scanner, char quote) {
while (!isAtEnd(scanner)) {
char c = peekChar(scanner);
if (c == quote) {
advanceChar(scanner);
return makeToken(scanner, TOKEN_STRING);
}
if (c == '\n') {
return errorToken(scanner, "Unterminated string");
}
if (c == '\\') {
advanceChar(scanner);
if (isAtEnd(scanner)) {
return errorToken(scanner, "Unterminated escape sequence");
}
advanceChar(scanner);
continue;
}
advanceChar(scanner);
}
return errorToken(scanner, "Unterminated string");
}
static Token scanOperatorOrPunctuation(Scanner* scanner, char c) {
switch (c) {
case '(':
scanner->groupDepth++;
return makeToken(scanner, TOKEN_LPAREN);
case ')':
if (scanner->groupDepth > 0) scanner->groupDepth--;
return makeToken(scanner, TOKEN_RPAREN);
case '[':
scanner->groupDepth++;
return makeToken(scanner, TOKEN_LBRACKET);
case ']':
if (scanner->groupDepth > 0) scanner->groupDepth--;
return makeToken(scanner, TOKEN_RBRACKET);
case '{':
scanner->groupDepth++;
return makeToken(scanner, TOKEN_LBRACE);
case '}':
if (scanner->groupDepth > 0) scanner->groupDepth--;
return makeToken(scanner, TOKEN_RBRACE);
case ',':
return makeToken(scanner, TOKEN_COMMA);
case '.':
return makeToken(scanner, TOKEN_DOT);
case ':':
return makeToken(scanner, TOKEN_COLON);
case '+':
return makeToken(scanner, TOKEN_PLUS);
case '-':
return makeToken(scanner, TOKEN_MINUS);
case '*':
return makeToken(scanner, TOKEN_STAR);
case '/':
return makeToken(scanner, TOKEN_SLASH);
case '%':
return makeToken(scanner, TOKEN_PERCENT);
case '=':
return makeToken(
scanner,
matchChar(scanner, '=') ? TOKEN_EQUAL_EQUAL : TOKEN_EQUAL
);
case '<':
return makeToken(
scanner,
matchChar(scanner, '=') ? TOKEN_LESS_EQUAL : TOKEN_LESS
);
case '>':
return makeToken(
scanner,
matchChar(scanner, '=') ? TOKEN_GREATER_EQUAL : TOKEN_GREATER
);
case '!':
if (matchChar(scanner, '=')) {
return makeToken(scanner, TOKEN_NOT_EQUAL);
}
return errorToken(scanner, "Unexpected character '!'. Use 'not' or '!='");
}
return errorToken(scanner, "Unexpected character");
}
static int emitPendingDedent(Scanner* scanner, Token* outToken) {
if (scanner->pendingDedents <= 0) {
return 0;
}
syncSyntheticTokenPos(scanner);
scanner->pendingDedents--;
*outToken = makeSyntheticToken(scanner, TOKEN_DEDENT);
return 1;
}
static int emitEOFOrTrailingDedent(Scanner* scanner, Token* outToken) {
if (!isAtEnd(scanner)) {
return 0;
}
if (scanner->indentCount > 1) {
scanner->indentCount--;
syncSyntheticTokenPos(scanner);
*outToken = makeSyntheticToken(scanner, TOKEN_DEDENT);
return 1;
}
markTokenStart(scanner);
*outToken = makeToken(scanner, TOKEN_EOF);
return 1;
}
static void skipIgnoredInput(Scanner* scanner) {
for (;;) {
if (isAtEnd(scanner)) {
return;
}
if (scanner->atLineStart &&
scanner->groupDepth == 0 &&
isBlankOrCommentLine(scanner)) {
skipBlankOrCommentOnlyLine(scanner);
continue;
}
markTokenStart(scanner);
if (!(scanner->atLineStart && scanner->groupDepth == 0)) {
if (peekChar(scanner) == ' ' ||
peekChar(scanner) == '\t' ||
peekChar(scanner) == '\r') {
skipInlineWhitespace(scanner);
continue;
}
}
if (peekChar(scanner) == '#') {
skipComment(scanner);
continue;
}
return;
}
}
static Token scanSingleToken(Scanner* scanner) {
char c;
markTokenStart(scanner);
c = advanceChar(scanner);
if (c == '\n') {
if (scanner->groupDepth > 0) {
return errorToken(scanner, "Internal lexer state error on newline suppression");
}
return makeToken(scanner, TOKEN_NEWLINE);
}
scanner->atLineStart = 0;
if (isAlpha(c)) return identifier(scanner);
if (isDigit(c)) return number(scanner);
if (c == '"' || c == '\'') return string(scanner, c);
return scanOperatorOrPunctuation(scanner, c);
}
static Token scanToken(Scanner* scanner) {
Token token;
if (emitPendingDedent(scanner, &token)) {
return token;
}
if (emitEOFOrTrailingDedent(scanner, &token)) {
return token;
}
for (;;) {
Token indentToken;
skipIgnoredInput(scanner);
if (emitPendingDedent(scanner, &token)) {
return token;
}
if (emitEOFOrTrailingDedent(scanner, &token)) {
return token;
}
if (handleIndentation(scanner, &indentToken)) {
return indentToken;
}
if (peekChar(scanner) == '\n' && scanner->groupDepth > 0) {
advanceChar(scanner);
continue;
}
break;
}
return scanSingleToken(scanner);
}
static void lexAllTokens(Scanner* scanner, TokenArray* outTokens) {
for (;;) {
Token token = scanToken(scanner);
pushToken(outTokens, token);
if (token.type == TOKEN_ERROR || token.type == TOKEN_EOF) {
break;
}
}
}
void normalizeTokens(TokenArray* tokens) {
(void)tokens;
}
const char* tokenTypeToString(TokenType type) {
switch (type) {
case TOKEN_EOF: return "EOF";
case TOKEN_ERROR: return "ERROR";
case TOKEN_NEWLINE: return "NEWLINE";
case TOKEN_INDENT: return "INDENT";
case TOKEN_DEDENT: return "DEDENT";
case TOKEN_IDENTIFIER: return "IDENTIFIER";
case TOKEN_NUMBER: return "NUMBER";
case TOKEN_STRING: return "STRING";
case TOKEN_LPAREN: return "LPAREN";
case TOKEN_RPAREN: return "RPAREN";
case TOKEN_LBRACKET: return "LBRACKET";
case TOKEN_RBRACKET: return "RBRACKET";
case TOKEN_LBRACE: return "LBRACE";
case TOKEN_RBRACE: return "RBRACE";
case TOKEN_COMMA: return "COMMA";
case TOKEN_DOT: return "DOT";
case TOKEN_COLON: return "COLON";
case TOKEN_PLUS: return "PLUS";
case TOKEN_MINUS: return "MINUS";
case TOKEN_STAR: return "STAR";
case TOKEN_SLASH: return "SLASH";
case TOKEN_PERCENT: return "PERCENT";
case TOKEN_EQUAL: return "EQUAL";
case TOKEN_EQUAL_EQUAL: return "EQUAL_EQUAL";
case TOKEN_NOT_EQUAL: return "NOT_EQUAL";
case TOKEN_LESS: return "LESS";
case TOKEN_LESS_EQUAL: return "LESS_EQUAL";
case TOKEN_GREATER: return "GREATER";
case TOKEN_GREATER_EQUAL: return "GREATER_EQUAL";
case TOKEN_IF: return "IF";
case TOKEN_ELIF: return "ELIF";
case TOKEN_ELSE: return "ELSE";
case TOKEN_WHILE: return "WHILE";
case TOKEN_FOR: return "FOR";
case TOKEN_IN: return "IN";
case TOKEN_DEF: return "DEF";
case TOKEN_CLASS: return "CLASS";
case TOKEN_RETURN: return "RETURN";
case TOKEN_TRUE: return "TRUE";
case TOKEN_FALSE: return "FALSE";
case TOKEN_NONE: return "NONE";
case TOKEN_AND: return "AND";
case TOKEN_OR: return "OR";
case TOKEN_NOT: return "NOT";
case TOKEN_PASS: return "PASS";
case TOKEN_BREAK: return "BREAK";
case TOKEN_CONTINUE: return "CONTINUE";
case TOKEN_IMPORT: return "IMPORT";
}
return "INVALID";
}
void printToken(const Token* token) {
printf("%-14s line %-3d col %-3d off %-3d text: %.*s\n",
tokenTypeToString(token->type),
token->line,
token->column,
token->offset,
token->length,
token->start);
}
void printTokenArray(const TokenArray* array) {
int i;
for (i = 0; i < array->count; i++) {
printToken(&array->data[i]);
}
}
void printDiagnosticsSummary(const Diagnostics* diagnostics) {
printf("\n=== DIAGNOSTICS ===\n");
printf("Errors: %d\n", diagnostics->errorCount);
printf("Warnings: %d\n", diagnostics->warningCount);
}
int lexSource(const char* source, TokenArray* outTokens, Diagnostics* diagnostics) {
Scanner scanner;
initScanner(&scanner, source, diagnostics);
initTokenArray(outTokens);
lexAllTokens(&scanner, outTokens);
return diagnostics->errorCount == 0;
}