5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 * Keywords are multichar, punctuation lexing is a bit more complicated
32 * than keyword lexing.
34 static const char *const lex_keywords[] = {
35 "do", "else", "if", "while",
36 "break", "continue", "return", "goto",
48 struct lex_file *lex_open(FILE *fp) {
49 struct lex_file *lex = mem_a(sizeof(struct lex_file));
52 fseek(lex->file, 0, SEEK_END);
53 lex->length = ftell(lex->file);
54 lex->size = lex->length; /* copy, this is never changed */
55 fseek(lex->file, 0, SEEK_SET);
58 memset(lex->peek, 0, sizeof(lex->peek));
63 int lex_close(struct lex_file *file) {
66 ret = fclose(file->file);
72 static void lex_addch(int ch, struct lex_file *file) {
73 if (file->current < sizeof(file->lastok)-1)
74 file->lastok[file->current++] = (char)ch;
75 if (file->current == sizeof(file->lastok)-1)
76 file->lastok[file->current] = (char)'\0';
78 static inline void lex_clear(struct lex_file *file) {
83 * read in inget/unget character from a lexer stream.
84 * This doesn't play with file streams, the lexer has
85 * it's own internal state for this.
87 static int lex_inget(struct lex_file *file) {
90 return file->peek[--file->last];
91 return fgetc(file->file);
93 static void lex_unget(int ch, struct lex_file *file) {
94 if (file->last < sizeof(file->peek))
95 file->peek[file->last++] = ch;
100 * This is trigraph and digraph support, a feature not qc compiler
101 * supports. Moving up in this world!
103 static int lex_trigraph(struct lex_file *file) {
105 if ((ch = lex_inget(file)) != '?') {
110 ch = lex_inget(file);
112 case '(' : return '[' ;
113 case ')' : return ']' ;
114 case '/' : return '\\';
115 case '\'': return '^' ;
116 case '<' : return '{' ;
117 case '>' : return '}' ;
118 case '!' : return '|' ;
119 case '-' : return '~' ;
120 case '=' : return '#' ;
122 lex_unget('?', file);
123 lex_unget(ch , file);
128 static int lex_digraph(struct lex_file *file, int first) {
129 int ch = lex_inget(file);
132 if (ch == '%') return '{';
133 if (ch == ':') return '[';
136 if (ch == '>') return '}';
137 if (ch == ':') return '#';
140 if (ch == '>') return ']';
148 static int lex_getch(struct lex_file *file) {
149 int ch = lex_inget(file);
151 return lex_trigraph(file);
152 if (ch == '<' || ch == ':' || ch == '%')
153 return lex_digraph (file, ch);
158 static int lex_get(struct lex_file *file) {
160 if (!isspace(ch = lex_getch(file)))
163 /* skip over all spaces */
164 while (isspace(ch) && ch != '\n')
165 ch = lex_getch(file);
176 static int lex_skipchr(struct lex_file *file) {
181 lex_addch('\'', file);
183 for (it = 0; it < 2 && ((ch = lex_inget(file)) != '\''); it++) {
189 lex_addch(lex_getch(file), file);
191 lex_addch('\'', file);
192 lex_addch('\0', file);
200 static int lex_skipstr(struct lex_file *file) {
203 lex_addch('"', file);
205 while ((ch = lex_getch(file)) != '"') {
206 if (ch == '\n' || ch == EOF)
211 lex_addch(lex_inget(file), file);
214 lex_addch('"', file);
215 lex_addch('\0', file);
219 static int lex_skipcmt(struct lex_file *file) {
222 ch = lex_getch(file);
225 lex_addch('/', file);
226 lex_addch('/', file);
228 while ((ch = lex_getch(file)) != '\n') {
231 lex_addch(lex_getch(file), file);
236 lex_addch('\0', file);
245 lex_addch('/', file);
250 while ((ch = lex_getch(file)) != '*') {
252 return error(ERROR_LEX, "malformatted comment", " ");
257 } while ((ch = lex_getch(file)) != '/');
259 lex_addch('/', file);
260 lex_addch('\0', file);
265 static int lex_getsource(struct lex_file *file) {
266 int ch = lex_get(file);
268 /* skip char/string/comment */
270 case '\'': return lex_skipchr(file);
271 case '"': return lex_skipstr(file);
272 case '/': return lex_skipcmt(file);
277 int lex_token(struct lex_file *file) {
278 int ch = lex_getsource(file);
281 /* valid identifier */
282 if (ch > 0 && (ch == '_' || isalpha(ch))) {
284 while (ch > 0 && (isalpha(ch) || ch == '_')) {
286 ch = lex_getsource(file);
289 lex_addch('\0', file);
291 /* look inside the table for a keyword .. */
292 for (it = 0; it < sizeof(lex_keywords)/sizeof(*lex_keywords); it++)
293 if (!strncmp(file->lastok, lex_keywords[it], sizeof(lex_keywords[it])))
296 /* try the hashtable for typedefs? */
297 if (typedef_find(file->lastok))
298 for (it = 0; it < sizeof(lex_keywords)/sizeof(*lex_keywords); it++)
299 if (!strncmp(typedef_find(file->lastok)->name, lex_keywords[it], sizeof(lex_keywords[it])))
307 void lex_reset(struct lex_file *file) {
310 file->length = file->size;
311 fseek(file->file, 0, SEEK_SET);
313 memset(file->peek, 0, sizeof(file->peek ));
314 memset(file->lastok, 0, sizeof(file->lastok));
317 int lex_debug(struct lex_file *file) {
323 int list_continue = 0;
328 printf("===========================\nTOKENS: \n===========================\n");
329 while ((token = lex_token(file)) != ERROR_LEX && file->length >= 0) {
332 case 0: list_do ++; break;
333 case 1: list_else ++; break;
334 case 2: list_if ++; break;
335 case 3: list_while ++; break;
336 case 4: list_break ++; break;
337 case 5: list_continue++; break;
338 case 6: list_return ++; break;
339 case 7: list_goto ++; break;
340 case 8: list_for ++; break;
343 if (token >= 33 && token <= 126)
346 printf("\n===========================\nBRANCHES \n===========================\n");
347 printf("\t if % 8d\n", list_if);
348 printf("\t else % 8d\n", list_else);
349 printf("===========================\nLOOPS \n===========================\n");
350 printf("\t for % 8d\n", list_for);
351 printf("\t while % 8d\n", list_while);
352 printf("\t do % 8d\n", list_do);
353 printf("===========================\nSTATEMENTS \n===========================\n");
354 printf("\t break % 8d\n", list_break);
355 printf("\t continue % 8d\n", list_continue);
356 printf("\t return % 8d\n", list_return);
357 printf("\t goto % 8d\n", list_goto);
358 printf("===========================\nIDENTIFIERS\n===========================\n");
360 while ((token = lex_token(file)) != ERROR_LEX && file->length >= 0)
361 if (token == LEX_IDENT)
362 printf("%s ", file->lastok);