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
|
/* Generated by re2c */
// re2c $INPUT -o $OUTPUT --recursive-functions -i
#include <assert.h>
#include <stdio.h>
#include <string.h>
#define YYMAXFILL 1
#define SIZE 4096
typedef struct {
FILE *file;
char buf[SIZE + YYMAXFILL], *lim, *cur, *mar, *tok;
int eof;
} Input;
static int fill(Input *in, size_t need)
{
if (in->eof) {
return 1;
}
const size_t free = in->tok - in->buf;
if (free < need) {
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);
if (in->lim < in->buf + SIZE) {
in->eof = 1;
memset(in->lim, 0, YYMAXFILL);
in->lim += YYMAXFILL;
}
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, 1);
}
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);
static int lex(Input* in, int count);
static int yy0(Input* in, int count) {
if (in->lim <= in->cur) if (fill(in, 1) != 0) return -1;
char yych = *in->cur++;
switch (yych) {
case 0x00: return yy1(in, count);
case ' ': return yy3(in, count);
case '\'': return yy5(in, count);
default: return yy2(in, count);
}
}
static int yy1(Input* in, int count) {
return (in->lim - in->cur == YYMAXFILL - 1) ? count : -1;
}
static int yy2(Input* in, int count) {
return -1;
}
static int yy3(Input* in, int count) {
if (in->lim <= in->cur) if (fill(in, 1) != 0) return -1;
char yych = *in->cur;
switch (yych) {
case ' ':
++in->cur;
return yy3(in, count);
default: return yy4(in, count);
}
}
static int yy4(Input* in, int count) {
return lex_loop(in, count);
}
static int yy5(Input* in, int count) {
if (in->lim <= in->cur) if (fill(in, 1) != 0) return -1;
char yych = *in->cur++;
switch (yych) {
case '\'': return yy6(in, count);
case '\\': return yy7(in, count);
default: return yy5(in, count);
}
}
static int yy6(Input* in, int count) {
return lex_loop(in, ++count);
}
static int yy7(Input* in, int count) {
if (in->lim <= in->cur) if (fill(in, 1) != 0) return -1;
++in->cur;
return yy5(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;
}
|
