-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsyntax.c
More file actions
368 lines (337 loc) · 12.2 KB
/
syntax.c
File metadata and controls
368 lines (337 loc) · 12.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
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
#include "prose_code.h"
COLORREF token_color(SynToken t) {
switch (t) {
case TOK_KEYWORD: return CLR_MAUVE;
case TOK_STRING: return CLR_GREEN;
case TOK_COMMENT: return CLR_OVERLAY0;
case TOK_NUMBER: return CLR_PEACH;
case TOK_PREPROCESSOR: return CLR_PINK;
case TOK_TYPE: return CLR_YELLOW;
case TOK_FUNCTION: return CLR_BLUE;
case TOK_OPERATOR: return CLR_SKY;
case TOK_MD_HEADING: return CLR_MAUVE;
case TOK_MD_BOLD: return CLR_PEACH;
case TOK_MD_ITALIC: return CLR_FLAMINGO;
case TOK_MD_CODE: return CLR_GREEN;
case TOK_MD_LINK: return CLR_BLUE;
case TOK_MD_BLOCKQUOTE: return CLR_OVERLAY0;
case TOK_MD_LIST: return CLR_TEAL;
case TOK_MISSPELLED: return CLR_MISSPELLED;
default: return CLR_TEXT;
}
}
static const wchar_t *c_keywords[] = {
L"auto",L"break",L"case",L"char",L"const",L"continue",L"default",
L"do",L"double",L"else",L"enum",L"extern",L"float",L"for",L"goto",
L"if",L"inline",L"int",L"long",L"register",L"restrict",L"return",
L"short",L"signed",L"sizeof",L"static",L"struct",L"switch",
L"typedef",L"union",L"unsigned",L"void",L"volatile",L"while",
L"bool",L"true",L"false",L"NULL",L"nullptr",
L"class",L"namespace",L"template",L"typename",L"virtual",L"override",
L"public",L"private",L"protected",L"new",L"delete",L"this",
L"try",L"catch",L"throw",L"using",L"const_cast",L"dynamic_cast",
L"static_cast",L"reinterpret_cast",L"noexcept",L"constexpr",
L"decltype",L"explicit",L"friend",L"mutable",
L"def",L"import",L"from",L"as",L"pass",L"lambda",
L"with",L"yield",L"assert",L"raise",L"except",L"finally",
L"global",L"nonlocal",L"del",L"in",L"not",L"and",L"or",L"is",
L"None",L"True",L"False",L"self",L"elif",L"async",L"await",
L"function",L"var",L"let",
L"export",L"extends",L"implements",
L"interface",L"type",L"declare",L"module",L"require",
L"undefined",L"NaN",L"Infinity",L"arguments",L"of",
L"fn",L"mut",L"pub",L"crate",L"mod",L"use",L"impl",
L"trait",L"where",L"loop",L"match",L"ref",L"move",L"unsafe",
L"dyn",L"Box",L"Vec",L"String",L"Option",L"Result",L"Some",
L"Ok",L"Err",L"Self",L"super",
NULL
};
static KwNode *g_kw_table[KW_HASH_BUCKETS];
static KwNode g_kw_pool[256];
static unsigned int kw_hash(const wchar_t *word, int len) {
unsigned int h = 5381;
for (int i = 0; i < len; i++) h = ((h << 5) + h) + word[i];
return h;
}
void kw_table_init(void) {
int pool_idx = 0;
for (int i = 0; c_keywords[i]; i++) {
int len = (int)wcslen(c_keywords[i]);
unsigned int h = kw_hash(c_keywords[i], len) & KW_HASH_MASK;
int dup = 0;
for (KwNode *n = g_kw_table[h]; n; n = n->next) {
if (n->len == len && wcsncmp(n->word, c_keywords[i], len) == 0) { dup = 1; break; }
}
if (dup) continue;
if (pool_idx >= 256) break;
KwNode *n = &g_kw_pool[pool_idx++];
n->word = c_keywords[i];
n->len = len;
n->next = g_kw_table[h];
g_kw_table[h] = n;
}
}
int is_c_keyword(const wchar_t *word, int len) {
unsigned int h = kw_hash(word, len) & KW_HASH_MASK;
for (KwNode *n = g_kw_table[h]; n; n = n->next) {
if (n->len == len && wcsncmp(n->word, word, len) == 0) return 1;
}
return 0;
}
/* Single-pass line tokenizer for code — O(n) per line */
int tokenize_line_code(const wchar_t *chars, int line_len, SynToken *out, int in_block_comment) {
int i = 0;
for (i = 0; i < line_len; i++) out[i] = TOK_NORMAL;
if (in_block_comment) {
for (i = 0; i < line_len - 1; i++) {
out[i] = TOK_COMMENT;
if (chars[i] == L'*' && chars[i + 1] == L'/') {
out[i + 1] = TOK_COMMENT;
i += 2;
goto normal_scan;
}
}
if (i < line_len) out[i] = TOK_COMMENT;
return 1;
}
{
int j = 0;
while (j < line_len && iswspace(chars[j])) j++;
if (j < line_len && chars[j] == L'#') {
if (j + 1 < line_len && iswalpha(chars[j + 1])) {
for (int k = 0; k < line_len; k++) out[k] = TOK_PREPROCESSOR;
return 0;
}
}
}
i = 0;
normal_scan:
while (i < line_len) {
wchar_t c = chars[i];
if (c == L'/' && i + 1 < line_len && chars[i + 1] == L'*') {
out[i] = TOK_COMMENT;
out[i + 1] = TOK_COMMENT;
i += 2;
while (i < line_len) {
if (i + 1 < line_len && chars[i] == L'*' && chars[i + 1] == L'/') {
out[i] = TOK_COMMENT;
out[i + 1] = TOK_COMMENT;
i += 2;
goto normal_scan;
}
out[i] = TOK_COMMENT;
i++;
}
return 1;
}
if (c == L'/' && i + 1 < line_len && chars[i + 1] == L'/') {
for (int j = i; j < line_len; j++) out[j] = TOK_COMMENT;
return 0;
}
if (c == L'#' && (i == 0 || !iswalpha(chars[i - 1]))) {
for (int j = i; j < line_len; j++) out[j] = TOK_COMMENT;
return 0;
}
if (c == L'"' || c == L'\'') {
wchar_t q = c;
out[i] = TOK_STRING;
i++;
while (i < line_len) {
wchar_t sc = chars[i];
out[i] = TOK_STRING;
if (sc == q) { i++; break; }
if (sc == L'\\' && i + 1 < line_len) { i++; out[i] = TOK_STRING; }
i++;
}
continue;
}
if (iswdigit(c) || (c == L'.' && i + 1 < line_len && iswdigit(chars[i + 1]))) {
int ns = i;
if (c == L'0' && i + 1 < line_len) {
wchar_t next = chars[i + 1];
if (next == L'x' || next == L'X') {
i += 2;
while (i < line_len && iswxdigit(chars[i])) i++;
} else if (next == L'b' || next == L'B') {
i += 2;
while (i < line_len && (chars[i] == L'0' || chars[i] == L'1')) i++;
} else {
goto decimal;
}
} else {
decimal:
while (i < line_len && (iswdigit(chars[i]) || chars[i] == L'.')) i++;
if (i < line_len && (chars[i] == L'e' || chars[i] == L'E')) {
i++;
if (i < line_len && (chars[i] == L'+' || chars[i] == L'-')) i++;
while (i < line_len && iswdigit(chars[i])) i++;
}
}
while (i < line_len && (chars[i] == L'u' || chars[i] == L'U' ||
chars[i] == L'l' || chars[i] == L'L' ||
chars[i] == L'f' || chars[i] == L'F')) i++;
for (int j = ns; j < i; j++) out[j] = TOK_NUMBER;
continue;
}
if (iswalpha(c) || c == L'_') {
int ws = i;
wchar_t word[64];
int wl = 0;
while (i < line_len && (iswalnum(chars[i]) || chars[i] == L'_')) {
if (wl < 63) word[wl++] = chars[i];
i++;
}
word[wl] = 0;
SynToken tok = TOK_NORMAL;
if (is_c_keyword(word, wl)) {
tok = TOK_KEYWORD;
} else if (i < line_len && chars[i] == L'(') {
tok = TOK_FUNCTION;
} else if (iswupper(word[0])) {
tok = TOK_TYPE;
}
for (int j = ws; j < i; j++) out[j] = tok;
continue;
}
if (wcschr(L"+-*/%=<>!&|^~?:", c)) {
out[i] = TOK_OPERATOR;
i++;
continue;
}
i++;
}
return 0;
}
/* Single-pass line tokenizer for prose/markdown — O(n) per line */
void tokenize_line_prose(const wchar_t *chars, int line_len, SynToken *out) {
for (int i = 0; i < line_len; i++) out[i] = TOK_NORMAL;
if (line_len == 0) return;
wchar_t first = chars[0];
if (first == L'#') {
for (int i = 0; i < line_len; i++) out[i] = TOK_MD_HEADING;
return;
}
if (first == L'>') {
for (int i = 0; i < line_len; i++) out[i] = TOK_MD_BLOCKQUOTE;
return;
}
if ((first == L'-' || first == L'*' || first == L'+') &&
line_len > 1 && chars[1] == L' ') {
out[0] = TOK_MD_LIST;
}
if (iswdigit(first)) {
int j = 0;
while (j < line_len && iswdigit(chars[j])) j++;
if (j < line_len && chars[j] == L'.' && j + 1 < line_len && chars[j + 1] == L' ') {
for (int k = 0; k <= j; k++) out[k] = TOK_MD_LIST;
}
}
if (first == L'-' || first == L'*' || first == L'_') {
wchar_t rule_ch = first;
int rule_count = 0;
int is_rule = 1;
for (int i = 0; i < line_len; i++) {
if (chars[i] == rule_ch) rule_count++;
else if (chars[i] != L' ') { is_rule = 0; break; }
}
if (is_rule && rule_count >= 3) {
for (int i = 0; i < line_len; i++) out[i] = TOK_MD_HEADING;
}
}
/* Inline code: `...` */
{
int i = 0;
while (i < line_len) {
if (chars[i] == L'`') {
out[i] = TOK_MD_CODE;
i++;
while (i < line_len && chars[i] != L'`') {
out[i] = TOK_MD_CODE;
i++;
}
if (i < line_len) { out[i] = TOK_MD_CODE; i++; }
} else {
i++;
}
}
}
/* Bold: **text** */
{
int i = 0;
while (i < line_len - 1) {
if (out[i] != TOK_MD_CODE &&
chars[i] == L'*' && chars[i + 1] == L'*') {
out[i] = TOK_MD_BOLD;
out[i + 1] = TOK_MD_BOLD;
i += 2;
while (i < line_len - 1) {
if (chars[i] == L'*' && chars[i + 1] == L'*') {
out[i] = TOK_MD_BOLD;
out[i + 1] = TOK_MD_BOLD;
i += 2;
break;
}
out[i] = TOK_MD_BOLD;
i++;
}
} else {
i++;
}
}
}
/* Italic: *text* or _text_ */
{
int i = 0;
while (i < line_len) {
if (out[i] != TOK_MD_CODE && out[i] != TOK_MD_BOLD &&
(chars[i] == L'*' || chars[i] == L'_')) {
wchar_t delim = chars[i];
if (i + 1 < line_len && chars[i + 1] != delim && chars[i + 1] != L' ') {
int start = i;
i++;
while (i < line_len && chars[i] != delim &&
out[i] != TOK_MD_CODE && out[i] != TOK_MD_BOLD) {
i++;
}
if (i < line_len && chars[i] == delim) {
for (int j = start; j <= i; j++) {
if (out[j] == TOK_NORMAL) out[j] = TOK_MD_ITALIC;
}
i++;
}
} else {
i++;
}
} else {
i++;
}
}
}
/* Links: [text](url) */
{
int i = 0;
while (i < line_len) {
if (out[i] == TOK_MD_CODE) { i++; continue; }
if (chars[i] == L'[') {
int bracket_start = i;
i++;
while (i < line_len && chars[i] != L']') i++;
if (i < line_len && i + 1 < line_len && chars[i + 1] == L'(') {
int paren_start = i + 1;
i = paren_start + 1;
while (i < line_len && chars[i] != L')') i++;
if (i < line_len) {
for (int j = bracket_start; j <= i; j++) {
if (out[j] == TOK_NORMAL) out[j] = TOK_MD_LINK;
}
i++;
}
} else {
i++;
}
} else {
i++;
}
}
}
}