-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlexer.jai
298 lines (243 loc) · 7.02 KB
/
lexer.jai
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
/// General purpose lexing
/*
A lexer can be instantiated like so:
lexer: Lexer;
By default it uses predefined values for:
- classes of tokens (TOKEN_KIND)
- how the classes are mapped to Jai values (TOKEN_VALUE)
- if unicode is valid in the source text (UNICODE)
- if whitespace should be ignored (IGNORE_WHITESPACE)
Lexer makes no notion of how tokens are captured, and only
makes assumptions (which can be overridden) about what
whitespace and newlines are.
The capturing and classification of tokens is done via
'Handlers' implemented through:
- a predicate: what constitues a valid starting token for the scanner
- a scanner: what a valid capture is from the point of the predicate
Handlers are created with 'register_handler.' An example handler for
scanning identifiers could be implemented like so:
register_handler(*lexer, starts_identifier, (lexer: *$L) {
identifier := capture_while(lexer, continues_identifier);
token := array_add(*lexer.tokens);
token.kind = .Identifier;
token._string = identifier;
});
starts_identifier :: (char: u8) -> bool {
return is_lettr(char) || char == #char "_";
}
continues_identifier :: (char: u8) -> bool {
return starts_identifier(char) || is_number(char);
}
Handlers are checked *in order* of their registration, so precedence
is defined through the order in which 'register_handler' is called.
Once all handlers are registered, the lexing process can be started
via 'lex' like so:
ok := lex(*lexer);
if !ok {
// errors occured during lexing
// and can be formatted/output through lexer.errors
}
For more examples, take a look at the test suite below.
*/
Lexer :: struct(
TOKEN_VALUE := Default_Value,
TOKEN_KIND := Default_Kind,
UNICODE := true,
IGNORE_WHITESPACE := true)
{
source: string;
tokens: [..]Token;
handlers: [..]Handler;
errors: [..]Error;
position: Position;
#if UNICODE {
current: rune;
}
else {
current: u8;
}
Token :: struct {
kind: TOKEN_KIND;
using value: TOKEN_VALUE;
}
Handler :: struct {
predicate: Predicate;
scanner: Scanner;
}
Error :: struct {
message: string;
hints: [..]string;
position: Position;
}
Position :: struct {
filename: string;
line: int = 1;
column: int = 1;
source: struct {
data: *u8;
start: int;
end: int;
};
}
Scanner :: #type (lexer: *Lexer(TOKEN_VALUE, TOKEN_KIND, UNICODE, IGNORE_WHITESPACE)) -> (ok: bool);
#if UNICODE {
Predicate :: #type (lexeme: rune) -> bool;
}
else {
Predicate :: #type (lexeme: u8) -> bool;
}
}
Default_Kind :: enum {
Invalid;
Bool;
Rune;
Byte;
Integer;
Float;
String;
Identifier;
}
Default_Value :: union {
_bool: bool;
_byte: u8;
_rune: rune;
_string: string;
_int: s64;
_float: float64;
}
register_handler :: (lexer: *Lexer, predicate: lexer.Predicate, scanner: lexer.Scanner) {
handler := array_add(*lexer.handlers);
handler.predicate = predicate;
handler.scanner = scanner;
}
lex :: (lexer: *Lexer, filename: string) -> (ok: bool) {
contents, ok := read_entire_file(file);
if !ok {
error(lexer, "Unable to read file '%'", filename);
return false;
}
lexer.source = contents;
return lex(lexer);
}
lex :: (lexer: *Lexer) -> (ok: bool) {
decl_peek(lexer);
while lexer.source.count {
#if lexer.IGNORE_WHITESPACE skip_while(lexer, is_whitespace);
if !lexer.source.count break;
token := peek(lexer);
had_valid_handler := false;
for handler: lexer.handlers if handler.predicate(token) {
if !handler.scanner(lexer) return false;
had_valid_handler = true;
break handler;
}
if !had_valid_handler {
error(lexer, sprint("Unexpected character '%'", to_string(token)));
return false;
}
}
return true;
}
error :: (lexer: *Lexer, message: string, hints: ..string) {
error := array_add(*lexer.errors);
error.message = message;
array_add(*error.hints, ..hints);
}
capture_while :: (lexer: *Lexer, predicate: lexer.Predicate) -> string {
decl_peek(lexer);
decl_next(lexer);
builder: String_Builder;
while lexer.source.count {
token := peek(lexer);
if !predicate(token) break;
append(*builder, to_string(token));
next(lexer);
}
return builder_to_string(*builder);
}
skip_while :: (lexer: *Lexer, predicate: lexer.Predicate) {
decl_peek(lexer);
decl_next(lexer);
while lexer.source.count {
token := peek(lexer);
if !predicate(token) break;
next(lexer);
}
}
decl_next :: (lexer: *Lexer) #expand {
#if lexer.UNICODE {
`next :: next_rune;
}
else {
`next :: next_char;
}
}
next_rune :: (lexer: *Lexer) -> rune, bool {
rune, width, status := character_utf8_to_utf32(lexer.source.data, lexer.source.count);
if status != .CONVERSION_OK {
return 0, false;
}
if rune == #char "\n" {
lexer.position.line += 1;
lexer.position.column = 1;
}
else {
lexer.position.column += 1;
}
lexer.current = rune;
lexer.source.data += width;
lexer.source.count -= width;
return rune, true;
}
next_char :: (lexer: *Lexer) -> u8, bool {
if !lexer.source.count return 0, false;
char := lexer.source.data[0];
if char == #char "\n" {
lexer.position.line += 1;
lexer.position.column = 1;
}
else {
lexer.position.column += 1;
}
lexer.current = char;
lexer.source.data += 1;
lexer.source.count -= 1;
return char, true;
}
decl_peek :: (lexer: *Lexer) #expand {
#if lexer.UNICODE {
`peek :: peek_rune;
}
else {
`peek :: peek_char;
}
}
peek_rune :: (lexer: *Lexer) -> rune, bool {
rune, width, status := character_utf8_to_utf32(lexer.source.data, lexer.source.count);
if status != .CONVERSION_OK return 0, false;
lexer.current = rune;
return rune, true;
}
peek_char :: (lexer: *Lexer) -> u8, bool {
if !lexer.source.count return 0, false;
char := lexer.source.data[0];
lexer.current = char;
return char, true;
}
// @TODO: Make this more robust for unicode
is_whitespace :: (r: rune) -> bool {
return r == #char " " ||
r == #char "\t" ||
r == #char "\n";
};
// @NOTE: Maybe add vertical tab?
is_whitespace :: (chr: u8) -> bool {
return chr == #char " " ||
chr == #char "\t" ||
chr == #char "\n";
};
#scope_file
#import,file "utilities.jai";
#import "String";
#import "Unicode";
#import "Sloppy_Math";