generated from WillAbides/goproject-tmpl
-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathread_machines.rl.go
More file actions
363 lines (346 loc) · 4.49 KB
/
read_machines.rl.go
File metadata and controls
363 lines (346 loc) · 4.49 KB
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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
// Code generated by script/generate-ragel-file read_machines.rl. DO NOT EDIT.
package rjson
func readNull(data []byte) (int, error) {
cs, p := 0, 0
pe := len(data)
eof := len(data)
const readNull_start int = 1
const readNull_first_final int = 6
const readNull_error int = 0
const readNull_en_main int = 1
{
cs = readNull_start
}
{
if p == pe {
goto _test_eof
}
switch cs {
case 1:
goto st_case_1
case 0:
goto st_case_0
case 2:
goto st_case_2
case 3:
goto st_case_3
case 4:
goto st_case_4
case 5:
goto st_case_5
case 6:
goto st_case_6
}
goto st_out
st_case_1:
switch data[p] {
case 13:
goto st2
case 32:
goto st2
case 110:
goto st3
}
if 9 <= data[p] && data[p] <= 10 {
goto st2
}
goto tr0
tr0:
return p, errNotNull
goto st0
st_case_0:
st0:
cs = 0
goto _out
st2:
if p++; p == pe {
goto _test_eof2
}
st_case_2:
switch data[p] {
case 13:
goto st2
case 32:
goto st2
case 110:
goto st3
}
if 9 <= data[p] && data[p] <= 10 {
goto st2
}
goto tr0
st3:
if p++; p == pe {
goto _test_eof3
}
st_case_3:
if data[p] == 117 {
goto st4
}
goto tr0
st4:
if p++; p == pe {
goto _test_eof4
}
st_case_4:
if data[p] == 108 {
goto st5
}
goto tr0
st5:
if p++; p == pe {
goto _test_eof5
}
st_case_5:
if data[p] == 108 {
goto st6
}
goto tr0
st6:
if p++; p == pe {
goto _test_eof6
}
st_case_6:
goto st0
st_out:
_test_eof2:
cs = 2
goto _test_eof
_test_eof3:
cs = 3
goto _test_eof
_test_eof4:
cs = 4
goto _test_eof
_test_eof5:
cs = 5
goto _test_eof
_test_eof6:
cs = 6
goto _test_eof
_test_eof:
{
}
if p == eof {
switch cs {
case 1, 2, 3, 4, 5:
return p, errNotNull
}
}
_out:
{
}
}
return p, nil
}
func readBool(data []byte) (bool, int, error) {
cs, p := 0, 0
pe := len(data)
eof := len(data)
var val bool
const readBool_start int = 1
const readBool_first_final int = 10
const readBool_error int = 0
const readBool_en_main int = 1
{
cs = readBool_start
}
{
if p == pe {
goto _test_eof
}
switch cs {
case 1:
goto st_case_1
case 0:
goto st_case_0
case 2:
goto st_case_2
case 3:
goto st_case_3
case 4:
goto st_case_4
case 5:
goto st_case_5
case 6:
goto st_case_6
case 10:
goto st_case_10
case 7:
goto st_case_7
case 8:
goto st_case_8
case 9:
goto st_case_9
case 11:
goto st_case_11
}
goto st_out
st_case_1:
switch data[p] {
case 13:
goto st2
case 32:
goto st2
case 102:
goto st3
case 116:
goto st7
}
if 9 <= data[p] && data[p] <= 10 {
goto st2
}
goto tr0
tr0:
return false, p, errNotBool
goto st0
st_case_0:
st0:
cs = 0
goto _out
st2:
if p++; p == pe {
goto _test_eof2
}
st_case_2:
switch data[p] {
case 13:
goto st2
case 32:
goto st2
case 102:
goto st3
case 116:
goto st7
}
if 9 <= data[p] && data[p] <= 10 {
goto st2
}
goto tr0
st3:
if p++; p == pe {
goto _test_eof3
}
st_case_3:
if data[p] == 97 {
goto st4
}
goto tr0
st4:
if p++; p == pe {
goto _test_eof4
}
st_case_4:
if data[p] == 108 {
goto st5
}
goto tr0
st5:
if p++; p == pe {
goto _test_eof5
}
st_case_5:
if data[p] == 115 {
goto st6
}
goto tr0
st6:
if p++; p == pe {
goto _test_eof6
}
st_case_6:
if data[p] == 101 {
goto tr7
}
goto tr0
tr7:
val = false
goto st10
st10:
if p++; p == pe {
goto _test_eof10
}
st_case_10:
goto st0
st7:
if p++; p == pe {
goto _test_eof7
}
st_case_7:
if data[p] == 114 {
goto st8
}
goto tr0
st8:
if p++; p == pe {
goto _test_eof8
}
st_case_8:
if data[p] == 117 {
goto st9
}
goto tr0
st9:
if p++; p == pe {
goto _test_eof9
}
st_case_9:
if data[p] == 101 {
goto tr10
}
goto tr0
tr10:
val = true
goto st11
st11:
if p++; p == pe {
goto _test_eof11
}
st_case_11:
goto st0
st_out:
_test_eof2:
cs = 2
goto _test_eof
_test_eof3:
cs = 3
goto _test_eof
_test_eof4:
cs = 4
goto _test_eof
_test_eof5:
cs = 5
goto _test_eof
_test_eof6:
cs = 6
goto _test_eof
_test_eof10:
cs = 10
goto _test_eof
_test_eof7:
cs = 7
goto _test_eof
_test_eof8:
cs = 8
goto _test_eof
_test_eof9:
cs = 9
goto _test_eof
_test_eof11:
cs = 11
goto _test_eof
_test_eof:
{
}
if p == eof {
switch cs {
case 1, 2, 3, 4, 5, 6, 7, 8, 9:
return false, p, errNotBool
}
}
_out:
{
}
}
return val, p, nil
}