forked from DoctorWkt/acwj
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathscan.c
366 lines (340 loc) · 7.42 KB
/
scan.c
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
#include "defs.h"
#include "data.h"
#include "decl.h"
// Lexical scanning
// Copyright (c) 2019 Warren Toomey, GPL3
// Return the position of character c
// in string s, or -1 if c not found
static int chrpos(char *s, int c) {
char *p;
p = strchr(s, c);
return (p ? p - s : -1);
}
// Get the next character from the input file.
static int next(void) {
int c;
if (Putback) { // Use the character put
c = Putback; // back if there is one
Putback = 0;
return (c);
}
c = fgetc(Infile); // Read from input file
if ('\n' == c)
Line++; // Increment line count
return (c);
}
// Put back an unwanted character
static void putback(int c) {
Putback = c;
}
// Skip past input that we don't need to deal with,
// i.e. whitespace, newlines. Return the first
// character we do need to deal with.
static int skip(void) {
int c;
c = next();
while (' ' == c || '\t' == c || '\n' == c || '\r' == c || '\f' == c) {
c = next();
}
return (c);
}
// Return the next character from a character
// or string literal
static int scanch(void) {
int c;
// Get the next input character and interpret
// metacharacters that start with a backslash
c = next();
if (c == '\\') {
switch (c = next()) {
case 'a':
return '\a';
case 'b':
return '\b';
case 'f':
return '\f';
case 'n':
return '\n';
case 'r':
return '\r';
case 't':
return '\t';
case 'v':
return '\v';
case '\\':
return '\\';
case '"':
return '"';
case '\'':
return '\'';
default:
fatalc("unknown escape sequence", c);
}
}
return (c); // Just an ordinary old character!
}
// Scan and return an integer literal
// value from the input file.
static int scanint(int c) {
int k, val = 0;
// Convert each character into an int value
while ((k = chrpos("0123456789", c)) >= 0) {
val = val * 10 + k;
c = next();
}
// We hit a non-integer character, put it back.
putback(c);
return (val);
}
// Scan in a string literal from the input file,
// and store it in buf[]. Return the length of
// the string.
static int scanstr(char *buf) {
int i, c;
// Loop while we have enough buffer space
for (i = 0; i < TEXTLEN - 1; i++) {
// Get the next char and append to buf
// Return when we hit the ending double quote
if ((c = scanch()) == '"') {
buf[i] = 0;
return (i);
}
buf[i] = c;
}
// Ran out of buf[] space
fatal("String literal too long");
return (0);
}
// Scan an identifier from the input file and
// store it in buf[]. Return the identifier's length
static int scanident(int c, char *buf, int lim) {
int i = 0;
// Allow digits, alpha and underscores
while (isalpha(c) || isdigit(c) || '_' == c) {
// Error if we hit the identifier length limit,
// else append to buf[] and get next character
if (lim - 1 == i) {
fatal("Identifier too long");
} else if (i < lim - 1) {
buf[i++] = c;
}
c = next();
}
// We hit a non-valid character, put it back.
// NUL-terminate the buf[] and return the length
putback(c);
buf[i] = '\0';
return (i);
}
// Given a word from the input, return the matching
// keyword token number or 0 if it's not a keyword.
// Switch on the first letter so that we don't have
// to waste time strcmp()ing against all the keywords.
static int keyword(char *s) {
switch (*s) {
case 'c':
if (!strcmp(s, "char"))
return (T_CHAR);
break;
case 'e':
if (!strcmp(s, "else"))
return (T_ELSE);
break;
case 'f':
if (!strcmp(s, "for"))
return (T_FOR);
break;
case 'i':
if (!strcmp(s, "if"))
return (T_IF);
if (!strcmp(s, "int"))
return (T_INT);
break;
case 'l':
if (!strcmp(s, "long"))
return (T_LONG);
break;
case 'r':
if (!strcmp(s, "return"))
return (T_RETURN);
break;
case 'w':
if (!strcmp(s, "while"))
return (T_WHILE);
break;
case 'v':
if (!strcmp(s, "void"))
return (T_VOID);
break;
}
return (0);
}
// A pointer to a rejected token
static struct token *Rejtoken = NULL;
// Reject the token that we just scanned
void reject_token(struct token *t) {
if (Rejtoken != NULL)
fatal("Can't reject token twice");
Rejtoken = t;
}
// Scan and return the next token found in the input.
// Return 1 if token valid, 0 if no tokens left.
int scan(struct token *t) {
int c, tokentype;
// If we have any rejected token, return it
if (Rejtoken != NULL) {
t = Rejtoken;
Rejtoken = NULL;
return (1);
}
// Skip whitespace
c = skip();
// Determine the token based on
// the input character
switch (c) {
case EOF:
t->token = T_EOF;
return (0);
case '+':
if ((c = next()) == '+') {
t->token = T_INC;
} else {
putback(c);
t->token = T_PLUS;
}
break;
case '-':
if ((c = next()) == '-') {
t->token = T_DEC;
} else {
putback(c);
t->token = T_MINUS;
}
break;
case '*':
t->token = T_STAR;
break;
case '/':
t->token = T_SLASH;
break;
case ';':
t->token = T_SEMI;
break;
case '{':
t->token = T_LBRACE;
break;
case '}':
t->token = T_RBRACE;
break;
case '(':
t->token = T_LPAREN;
break;
case ')':
t->token = T_RPAREN;
break;
case '[':
t->token = T_LBRACKET;
break;
case ']':
t->token = T_RBRACKET;
break;
case '~':
t->token = T_INVERT;
break;
case '^':
t->token = T_XOR;
break;
case ',':
t->token = T_COMMA;
break;
case '=':
if ((c = next()) == '=') {
t->token = T_EQ;
} else {
putback(c);
t->token = T_ASSIGN;
}
break;
case '!':
if ((c = next()) == '=') {
t->token = T_NE;
} else {
putback(c);
t->token = T_LOGNOT;
}
break;
case '<':
if ((c = next()) == '=') {
t->token = T_LE;
} else if (c == '<') {
t->token = T_LSHIFT;
} else {
putback(c);
t->token = T_LT;
}
break;
case '>':
if ((c = next()) == '=') {
t->token = T_GE;
} else if (c == '>') {
t->token = T_RSHIFT;
} else {
putback(c);
t->token = T_GT;
}
break;
case '&':
if ((c = next()) == '&') {
t->token = T_LOGAND;
} else {
putback(c);
t->token = T_AMPER;
}
break;
case '|':
if ((c = next()) == '|') {
t->token = T_LOGOR;
} else {
putback(c);
t->token = T_OR;
}
break;
case '\'':
// If it's a quote, scan in the
// literal character value and
// the trailing quote
t->intvalue = scanch();
t->token = T_INTLIT;
if (next() != '\'')
fatal("Expected '\\'' at end of char literal");
break;
case '"':
// Scan in a literal string
scanstr(Text);
t->token = T_STRLIT;
break;
default:
// If it's a digit, scan the
// literal integer value in
if (isdigit(c)) {
t->intvalue = scanint(c);
t->token = T_INTLIT;
break;
} else if (isalpha(c) || '_' == c) {
// Read in a keyword or identifier
scanident(c, Text, TEXTLEN);
// If it's a recognised keyword, return that token
if ((tokentype = keyword(Text)) != 0) {
t->token = tokentype;
break;
}
// Not a recognised keyword, so it must be an identifier
t->token = T_IDENT;
break;
}
// The character isn't part of any recognised token, error
fatalc("Unrecognised character", c);
}
// We found a token
return (1);
}