-
Notifications
You must be signed in to change notification settings - Fork 93
Expand file tree
/
Copy pathlexer.c
More file actions
202 lines (180 loc) · 6.24 KB
/
lexer.c
File metadata and controls
202 lines (180 loc) · 6.24 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
#include <assert.h>
#include <stdbool.h>
#include <ctype.h>
#include <string.h>
#include "common.h"
#include "lexer.h"
typedef struct {
Token_Kind kind;
const char *text;
} Literal_Token;
Literal_Token literal_tokens[] = {
{.text = "(", .kind = TOKEN_OPEN_PAREN},
{.text = ")", .kind = TOKEN_CLOSE_PAREN},
{.text = "{", .kind = TOKEN_OPEN_CURLY},
{.text = "}", .kind = TOKEN_CLOSE_CURLY},
{.text = ";", .kind = TOKEN_SEMICOLON},
};
#define literal_tokens_count (sizeof(literal_tokens)/sizeof(literal_tokens[0]))
const char *keywords[] = {
"auto", "break", "case", "char", "const", "continue", "default", "do", "double",
"else", "enum", "extern", "float", "for", "goto", "if", "int", "long", "register",
"return", "short", "signed", "sizeof", "static", "struct", "switch", "typedef",
"union", "unsigned", "void", "volatile", "while", "alignas", "alignof", "and",
"and_eq", "asm", "atomic_cancel", "atomic_commit", "atomic_noexcept", "bitand",
"bitor", "bool", "catch", "char16_t", "char32_t", "char8_t", "class", "co_await",
"co_return", "co_yield", "compl", "concept", "const_cast", "consteval", "constexpr",
"constinit", "decltype", "delete", "dynamic_cast", "explicit", "export", "false",
"friend", "inline", "mutable", "namespace", "new", "noexcept", "not", "not_eq",
"nullptr", "operator", "or", "or_eq", "private", "protected", "public", "reflexpr",
"reinterpret_cast", "requires", "static_assert", "static_cast", "synchronized",
"template", "this", "thread_local", "throw", "true", "try", "typeid", "typename",
"using", "virtual", "wchar_t", "xor", "xor_eq",
};
#define keywords_count (sizeof(keywords)/sizeof(keywords[0]))
const char *token_kind_name(Token_Kind kind)
{
char *toknames[] = {
"end of content", "invalid token", "preprocessor directive",
"symbol", "open paren", "close paren", "open curly", "close curly",
"semicolon", "keyword", "comment", "string"
};
return toknames[kind];
}
Lexer lexer_new(Free_Glyph_Atlas *atlas, const char *content, size_t content_len)
{
Lexer l = {0};
l.atlas = atlas;
l.content = content;
l.content_len = content_len;
return l;
}
bool lexer_starts_with(Lexer *l, const char *prefix)
{
size_t prefix_len = strlen(prefix);
if (prefix_len == 0) {
return true;
}
if (l->cursor + prefix_len - 1 >= l->content_len) {
return false;
}
for (size_t i = 0; i < prefix_len; ++i) {
if (prefix[i] != l->content[l->cursor + i]) {
return false;
}
}
return true;
}
void lexer_chop_char(Lexer *l, size_t len)
{
for (size_t i = 0; i < len; ++i) {
// TODO: get rid of this assert by checking the length of the choped prefix upfront
assert(l->cursor < l->content_len);
char x = l->content[l->cursor];
l->cursor += 1;
if (x == '\n') {
l->line += 1;
l->bol = l->cursor;
l->x = 0;
} else {
if (l->atlas) {
size_t glyph_index = x;
// TODO: support for glyphs outside of ASCII range
if (glyph_index >= GLYPH_METRICS_CAPACITY) {
glyph_index = '?';
}
Glyph_Metric metric = l->atlas->metrics[glyph_index];
l->x += metric.ax;
}
}
}
}
void lexer_trim_left(Lexer *l)
{
while (l->cursor < l->content_len && isspace(l->content[l->cursor])) {
lexer_chop_char(l, 1);
}
}
bool is_symbol_start(char x)
{
return isalpha(x) || x == '_';
}
bool is_symbol(char x)
{
return isalnum(x) || x == '_';
}
Token lexer_next(Lexer *l)
{
lexer_trim_left(l);
Token token = {
.text = &l->content[l->cursor],
};
token.position.x = l->x;
token.position.y = -(float)l->line * FREE_GLYPH_FONT_SIZE;
if (l->cursor >= l->content_len) return token;
if (l->content[l->cursor] == '"') {
// TODO: TOKEN_STRING should also handle escape sequences
token.kind = TOKEN_STRING;
lexer_chop_char(l, 1);
while (l->cursor < l->content_len && l->content[l->cursor] != '"' && l->content[l->cursor] != '\n') {
lexer_chop_char(l, 1);
}
if (l->cursor < l->content_len) {
lexer_chop_char(l, 1);
}
token.text_len = &l->content[l->cursor] - token.text;
return token;
}
if (l->content[l->cursor] == '#') {
// TODO: preproc should also handle newlines
token.kind = TOKEN_PREPROC;
while (l->cursor < l->content_len && l->content[l->cursor] != '\n') {
lexer_chop_char(l, 1);
}
if (l->cursor < l->content_len) {
lexer_chop_char(l, 1);
}
token.text_len = &l->content[l->cursor] - token.text;
return token;
}
if (lexer_starts_with(l, "//")) {
token.kind = TOKEN_COMMENT;
while (l->cursor < l->content_len && l->content[l->cursor] != '\n') {
lexer_chop_char(l, 1);
}
if (l->cursor < l->content_len) {
lexer_chop_char(l, 1);
}
token.text_len = &l->content[l->cursor] - token.text;
return token;
}
for (size_t i = 0; i < literal_tokens_count; ++i) {
if (lexer_starts_with(l, literal_tokens[i].text)) {
// NOTE: this code assumes that there is no newlines in literal_tokens[i].text
size_t text_len = strlen(literal_tokens[i].text);
token.kind = literal_tokens[i].kind;
token.text_len = text_len;
lexer_chop_char(l, text_len);
return token;
}
}
if (is_symbol_start(l->content[l->cursor])) {
token.kind = TOKEN_SYMBOL;
while (l->cursor < l->content_len && is_symbol(l->content[l->cursor])) {
lexer_chop_char(l, 1);
token.text_len += 1;
}
for (size_t i = 0; i < keywords_count; ++i) {
size_t keyword_len = strlen(keywords[i]);
if (keyword_len == token.text_len && memcmp(keywords[i], token.text, keyword_len) == 0) {
token.kind = TOKEN_KEYWORD;
break;
}
}
return token;
}
lexer_chop_char(l, 1);
token.kind = TOKEN_INVALID;
token.text_len = 1;
return token;
}