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
|
/*
Copyright (C) 2017 Paweł Redman
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 3
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "shared.h"
#include <ctype.h>
void vstr_init(vstr_t *vstr)
{
memset(vstr, 0, sizeof(*vstr));
}
void vstr_destroy(vstr_t *vstr)
{
free(vstr->data);
}
void vstr_clear(vstr_t *vstr)
{
vstr->size = 0;
}
static int vstr_enlarge(vstr_t *vstr)
{
size_t new_alloc;
new_alloc = (vstr->alloc + 4) * 3 / 2;
vstr->data = realloc(vstr->data, new_alloc);
if (!vstr->data)
return 1;
vstr->alloc = new_alloc;
return 0;
}
int vstr_putc(vstr_t *vstr, char ch)
{
// note: keep at least one character free at all times for vstr_termz
if (vstr->size + 2 > vstr->alloc)
if (vstr_enlarge(vstr))
return -ENOMEM;
vstr->data[vstr->size] = ch;
vstr->size++;
return 0;
}
int vstr_cmp(vstr_t *vstr, const char *str)
{
size_t len;
len = strlen(str);
if (vstr->size < len)
len = vstr->size;
return memcmp(vstr->data, str, len);
}
char *vstr_strdup(vstr_t *vstr)
{
char *str;
str = malloc(vstr->size + 1);
if (!str)
return NULL;
memcpy(str, vstr->data, vstr->size);
str[vstr->size] = 0;
return str;
}
char *vstr_to_cstr(vstr_t *vstr)
{
vstr->data[vstr->size] = '\0';
return vstr->data;
}
int lexer_open(lexer_state_t *ls, const char *path, vstr_t *token)
{
ls->error = 0;
ls->path = path;
ls->fp = fopen(path, "r");
if (!ls->fp)
return -errno;
ls->eof = false;
ls->token = token;
ls->buf_e = ls->buf_c = ls->buf;
ls->cc = ls->lc = ls->Cc = 0;
ls->in_token = false;
ls->in_quote = false;
ls->in_comment = false;
return 0;
}
void lexer_close(lexer_state_t *ls)
{
vstr_destroy(ls->token);
fclose(ls->fp);
}
//RETURN VALUES
// <0 on error
// 0 on success
// note: sets ls->eof to true if there's no more data left
static int fill_buffer(lexer_state_t *ls)
{
size_t read;
read = fread(ls->buf, 1, sizeof(ls->buf), ls->fp);
if (read < sizeof(ls->buf)) {
if (ferror(ls->fp))
return -errno;
ls->eof = true;
}
ls->buf_c = ls->buf;
ls->buf_e = ls->buf + read;
return 0;
}
//RETURN VALUES
// -ENOMEM
// -EAGAIN when the buffer runs out
// 0 on success
// 1 when no data is left
static int read_buffer(lexer_state_t *ls)
{
while (ls->buf_c < ls->buf_e) {
bool ret_token = false;
if (*ls->buf_c == '\n') {
ls->lc++;
ls->Cc = 0;
}
if (ls->in_comment) {
if (*ls->buf_c == '\n')
ls->in_comment = false;
} else if (isspace(*ls->buf_c) && !ls->in_quote) {
if (ls->in_token) {
ls->in_token = false;
ret_token = true;
}
} else if (*ls->buf_c == '/' && (ls->cc && ls->last == '/')) {
ls->in_comment = true;
ls->in_token = false;
ls->token->size--; // remove the first slash
if (ls->token->size)
ret_token = true;
} else if (*ls->buf_c == '\"' &&
(ls->cc && ls->last != '\\')) {
ls->in_quote = !ls->in_quote;
if (!ls->in_quote) {
ls->in_token = false;
ret_token = true;
}
} else {
if (!ls->in_token) {
ls->in_token = true;
}
}
if (ls->in_token)
if (vstr_putc(ls->token, *ls->buf_c)) {
ls->error = ENOMEM;
return -ENOMEM;
}
ls->last = *ls->buf_c;
ls->buf_c++;
ls->cc++;
ls->Cc++;
if (ret_token)
return 0;
}
if (ls->eof) {
if (ls->token->size > 0)
return 0;
return 1;
}
return -EAGAIN;
}
//RETURN VALUES
// <0 on error
// 0 on success
// 1 when no data is left
int lexer_get_token(lexer_state_t *ls)
{
int ret;
vstr_clear(ls->token);
while (1) {
ret = read_buffer(ls);
if (ret != -EAGAIN)
return ret;
ret = fill_buffer(ls);
if (ret < 0)
return ret;
}
}
void lexer_perror(lexer_state_t *ls, const char *fmt, ...)
{
va_list vl;
eprintf("%s:%zu:%zu: ", ls->path, ls->lc + 1, ls->Cc + 1);
if (ls->error) {
perror(NULL);
} else {
va_start(vl, fmt);
vfprintf(stderr, fmt, vl);
va_end(vl);
}
}
void lexer_perror_eg(lexer_state_t *ls, const char *expected)
{
if (ls->eof && ls->buf_c == ls->buf_e)
lexer_perror(ls, "expected %s, got EOF\n", expected);
else
lexer_perror(ls, "expected %s, got \"%s\"\n", expected,
vstr_to_cstr(ls->token));
}
|
