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
|
/* Generated by re2c */
// re2c $INPUT -o $OUTPUT --recursive-functions -i
#include <assert.h>
#include <stdio.h>
#include <string.h>
#define SIZE 4096
typedef struct {
FILE *file;
char buf[SIZE + 1], *lim, *cur, *mar, *tok;
int eof;
} Input;
static int fill(Input *in)
{
if (in->eof) {
return 1;
}
const size_t free = in->tok - in->buf;
if (free < 1) {
return 2;
}
memmove(in->buf, in->tok, in->lim - in->tok);
in->lim -= free;
in->cur -= free;
in->mar -= free;
in->tok -= free;
in->lim += fread(in->lim, 1, free, in->file);
in->lim[0] = 0;
in->eof |= in->lim < in->buf + SIZE;
return 0;
}
static void init(Input *in, FILE *file)
{
in->file = file;
in->cur = in->mar = in->tok = in->lim = in->buf + SIZE;
in->eof = 0;
fill(in);
}
static int lex_loop(Input *in, int count);
static int yy0(Input* in, int count);
static int yy1(Input* in, int count);
static int yy2(Input* in, int count);
static int yy3(Input* in, int count);
static int yy4(Input* in, int count);
static int yy5(Input* in, int count);
static int yy6(Input* in, int count);
static int yy7(Input* in, int count, char yych);
static int yy8(Input* in, int count);
static int yy9(Input* in, int count);
static int yy10(Input* in, int count);
static int yy11(Input* in, int count);
static int lex(Input* in, int count);
static int yy0(Input* in, int count) {
char yych = *in->cur;
switch (yych) {
case ' ':
++in->cur;
return yy3(in, count);
case '\'':
++in->cur;
return yy5(in, count);
default:
if (in->lim <= in->cur) {
if (fill(in) == 0) return yy0(in, count);
else return yy10(in, count);
} else {
++in->cur;
return yy1(in, count);
}
}
}
static int yy1(Input* in, int count) {
return yy2(in, count);
}
static int yy2(Input* in, int count) {
return -1;
}
static int yy3(Input* in, int count) {
char yych = *in->cur;
switch (yych) {
case ' ':
++in->cur;
return yy3(in, count);
default:
if (in->lim <= in->cur) {
if (fill(in) == 0) return yy3(in, count);
else return yy4(in, count);
} else {
return yy4(in, count);
}
}
}
static int yy4(Input* in, int count) {
return lex_loop(in, count);
}
static int yy5(Input* in, int count) {
char yych = *(in->mar = in->cur);
if (yych <= 0x00) {
if (in->lim <= in->cur) {
if (fill(in) == 0) return yy5(in, count);
else return yy2(in, count);
} else {
++in->cur;
return yy6(in, count);
}
} else {
return yy7(in, count, yych);
}
}
static int yy6(Input* in, int count) {
char yych = *in->cur;
return yy7(in, count, yych);
}
static int yy7(Input* in, int count, char yych) {
switch (yych) {
case '\'':
++in->cur;
return yy8(in, count);
case '\\':
++in->cur;
return yy9(in, count);
default:
if (in->lim <= in->cur) {
if (fill(in) == 0) return yy6(in, count);
else return yy11(in, count);
} else {
++in->cur;
return yy6(in, count);
}
}
}
static int yy8(Input* in, int count) {
return lex_loop(in, count + 1);
}
static int yy9(Input* in, int count) {
char yych = *in->cur;
if (yych <= 0x00) {
if (in->lim <= in->cur) {
if (fill(in) == 0) return yy9(in, count);
else return yy11(in, count);
} else {
++in->cur;
return yy6(in, count);
}
} else {
++in->cur;
return yy6(in, count);
}
}
static int yy10(Input* in, int count) {
return count;
}
static int yy11(Input* in, int count) {
in->cur = in->mar;
return yy2(in, count);
}
static int lex(Input* in, int count) {
return yy0(in, count);
}
static int lex_loop(Input *in, int count)
{
in->tok = in->cur;
return lex(in, count);
}
int main()
{
const char *fname = "input";
const char str[] = "'qu\0tes' 'are' 'fine: \\'' ";
FILE *f;
Input in;
// prepare input file: a few times the size of the buffer,
// containing strings with zeroes and escaped quotes
f = fopen(fname, "w");
for (int i = 0; i < SIZE; ++i) {
fwrite(str, 1, sizeof(str) - 1, f);
}
fclose(f);
f = fopen(fname, "r");
init(&in, f);
assert(lex_loop(&in, 0) == SIZE * 3);
fclose(f);
remove(fname);
return 0;
}
|
