-
Notifications
You must be signed in to change notification settings - Fork 82
/
tokenizer.c
272 lines (251 loc) · 6.94 KB
/
tokenizer.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
/*
* Copyright (c) 2006, Adam Dunkels
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the author nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#define DEBUG 0
#if DEBUG
#define DEBUG_PRINTF(...) printf(__VA_ARGS__)
#else
#define DEBUG_PRINTF(...)
#endif
#include "tokenizer.h"
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
static char const *ptr, *nextptr;
#define MAX_NUMLEN 6
struct keyword_token {
char *keyword;
int token;
};
static int current_token = TOKENIZER_ERROR;
static const struct keyword_token keywords[] = {
{"let", TOKENIZER_LET},
{"print", TOKENIZER_PRINT},
{"if", TOKENIZER_IF},
{"then", TOKENIZER_THEN},
{"else", TOKENIZER_ELSE},
{"for", TOKENIZER_FOR},
{"to", TOKENIZER_TO},
{"next", TOKENIZER_NEXT},
{"goto", TOKENIZER_GOTO},
{"gosub", TOKENIZER_GOSUB},
{"return", TOKENIZER_RETURN},
{"call", TOKENIZER_CALL},
{"rem", TOKENIZER_REM},
{"peek", TOKENIZER_PEEK},
{"poke", TOKENIZER_POKE},
{"end", TOKENIZER_END},
{NULL, TOKENIZER_ERROR}
};
/*---------------------------------------------------------------------------*/
static int
singlechar(void)
{
if(*ptr == '\n') {
return TOKENIZER_CR;
} else if(*ptr == ',') {
return TOKENIZER_COMMA;
} else if(*ptr == ';') {
return TOKENIZER_SEMICOLON;
} else if(*ptr == '+') {
return TOKENIZER_PLUS;
} else if(*ptr == '-') {
return TOKENIZER_MINUS;
} else if(*ptr == '&') {
return TOKENIZER_AND;
} else if(*ptr == '|') {
return TOKENIZER_OR;
} else if(*ptr == '*') {
return TOKENIZER_ASTR;
} else if(*ptr == '/') {
return TOKENIZER_SLASH;
} else if(*ptr == '%') {
return TOKENIZER_MOD;
} else if(*ptr == '(') {
return TOKENIZER_LEFTPAREN;
} else if(*ptr == '#') {
return TOKENIZER_HASH;
} else if(*ptr == ')') {
return TOKENIZER_RIGHTPAREN;
} else if(*ptr == '<') {
return TOKENIZER_LT;
} else if(*ptr == '>') {
return TOKENIZER_GT;
} else if(*ptr == '=') {
return TOKENIZER_EQ;
}
return 0;
}
/*---------------------------------------------------------------------------*/
static int
get_next_token(void)
{
struct keyword_token const *kt;
int i;
DEBUG_PRINTF("get_next_token(): '%s'\n", ptr);
if(*ptr == 0) {
return TOKENIZER_ENDOFINPUT;
}
if(isdigit(*ptr)) {
for(i = 0; i < MAX_NUMLEN; ++i) {
if(!isdigit(ptr[i])) {
if(i > 0) {
nextptr = ptr + i;
return TOKENIZER_NUMBER;
} else {
DEBUG_PRINTF("get_next_token: error due to too short number\n");
return TOKENIZER_ERROR;
}
}
if(!isdigit(ptr[i])) {
DEBUG_PRINTF("get_next_token: error due to malformed number\n");
return TOKENIZER_ERROR;
}
}
DEBUG_PRINTF("get_next_token: error due to too long number\n");
return TOKENIZER_ERROR;
} else if(singlechar()) {
nextptr = ptr + 1;
return singlechar();
} else if(*ptr == '"') {
nextptr = ptr;
do {
++nextptr;
} while(*nextptr != '"');
++nextptr;
return TOKENIZER_STRING;
} else {
for(kt = keywords; kt->keyword != NULL; ++kt) {
if(strncmp(ptr, kt->keyword, strlen(kt->keyword)) == 0) {
nextptr = ptr + strlen(kt->keyword);
return kt->token;
}
}
}
if(*ptr >= 'a' && *ptr <= 'z') {
nextptr = ptr + 1;
return TOKENIZER_VARIABLE;
}
return TOKENIZER_ERROR;
}
/*---------------------------------------------------------------------------*/
void
tokenizer_goto(const char *program)
{
ptr = program;
current_token = get_next_token();
}
/*---------------------------------------------------------------------------*/
void
tokenizer_init(const char *program)
{
tokenizer_goto(program);
current_token = get_next_token();
}
/*---------------------------------------------------------------------------*/
int
tokenizer_token(void)
{
return current_token;
}
/*---------------------------------------------------------------------------*/
void
tokenizer_next(void)
{
if(tokenizer_finished()) {
return;
}
DEBUG_PRINTF("tokenizer_next: %p\n", nextptr);
ptr = nextptr;
while(*ptr == ' ') {
++ptr;
}
current_token = get_next_token();
if(current_token == TOKENIZER_REM) {
while(!(*nextptr == '\n' || tokenizer_finished())) {
++nextptr;
}
if(*nextptr == '\n') {
++nextptr;
}
tokenizer_next();
}
DEBUG_PRINTF("tokenizer_next: '%s' %d\n", ptr, current_token);
return;
}
/*---------------------------------------------------------------------------*/
VARIABLE_TYPE
tokenizer_num(void)
{
return atoi(ptr);
}
/*---------------------------------------------------------------------------*/
void
tokenizer_string(char *dest, int len)
{
char *string_end;
int string_len;
if(tokenizer_token() != TOKENIZER_STRING) {
return;
}
string_end = strchr(ptr + 1, '"');
if(string_end == NULL) {
return;
}
string_len = string_end - ptr - 1;
if(len < string_len) {
string_len = len;
}
memcpy(dest, ptr + 1, string_len);
dest[string_len] = 0;
}
/*---------------------------------------------------------------------------*/
void
tokenizer_error_print(void)
{
DEBUG_PRINTF("tokenizer_error_print: '%s'\n", ptr);
}
/*---------------------------------------------------------------------------*/
int
tokenizer_finished(void)
{
return *ptr == 0 || current_token == TOKENIZER_ENDOFINPUT;
}
/*---------------------------------------------------------------------------*/
int
tokenizer_variable_num(void)
{
return *ptr - 'a';
}
/*---------------------------------------------------------------------------*/
char const *
tokenizer_pos(void)
{
return ptr;
}