-
Notifications
You must be signed in to change notification settings - Fork 0
/
lexer.go
520 lines (489 loc) · 8.37 KB
/
lexer.go
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
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
//line lexer.rl:1
package sql
import (
"fmt"
)
//line lexer.go:11
const sql_parser_start int = 1
const sql_parser_first_final int = 1
const sql_parser_error int = 0
const sql_parser_en_main int = 1
//line lexer.rl:15
type lexer struct {
// It must be an array containting the data to process.
data []byte
// Data end pointer. This should be initialized to p plus the data length on every run of the machine. In Java and Ruby code this should be initialized to the data length.
pe int
// Data pointer. In C/D code this variable is expected to be a pointer to the character data to process. It should be initialized to the beginning of the data block on every run of the machine. In Java and Ruby it is used as an offset to data and must be an integer. In this case it should be initialized to zero on every run of the machine.
p int
// This must be a pointer to character data. In Java and Ruby code this must be an integer. See Section 6.3 for more information.
ts int
// Also a pointer to character data.
te int
// This must be an integer value. It is a variable sometimes used by scanner code to keep track of the most recent successful pattern match.
act int
// Current state. This must be an integer and it should persist across invocations of the machine when the data is broken into blocks that are processed independently. This variable may be modified from outside the execution loop, but not from within.
cs int
// This must be an integer value and will be used as an offset to stack, giving the next available spot on the top of the stack.
top int
}
func newLexer(data []byte) *lexer {
lex := &lexer{
data: data,
pe: len(data),
}
//line lexer.go:56
{
lex.cs = sql_parser_start
lex.ts = 0
lex.te = 0
lex.act = 0
}
//line lexer.rl:51
return lex
}
func (lex *lexer) Lex(out *yySymType) int {
eof := lex.pe
tok := 0
//line lexer.go:72
{
if (lex.p) == (lex.pe) {
goto _test_eof
}
switch lex.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 7:
goto st_case_7
case 8:
goto st_case_8
case 9:
goto st_case_9
case 10:
goto st_case_10
case 11:
goto st_case_11
}
goto st_out
tr0:
//line lexer.rl:68
lex.te = (lex.p) + 1
goto st1
tr2:
//line lexer.rl:62
lex.te = (lex.p) + 1
{
tok = COMMA
{
(lex.p)++
lex.cs = 1
goto _out
}
}
goto st1
tr7:
//line lexer.rl:63
lex.te = (lex.p)
(lex.p)--
{
out.str = string(lex.data[lex.ts:lex.te])
tok = STRING
{
(lex.p)++
lex.cs = 1
goto _out
}
}
goto st1
tr9:
//line NONE:1
switch lex.act {
case 1:
{
(lex.p) = (lex.te) - 1
tok = SELECT
{
(lex.p)++
lex.cs = 1
goto _out
}
}
case 2:
{
(lex.p) = (lex.te) - 1
tok = FROM
{
(lex.p)++
lex.cs = 1
goto _out
}
}
case 3:
{
(lex.p) = (lex.te) - 1
tok = AS
{
(lex.p)++
lex.cs = 1
goto _out
}
}
case 5:
{
(lex.p) = (lex.te) - 1
out.str = string(lex.data[lex.ts:lex.te])
tok = STRING
{
(lex.p)++
lex.cs = 1
goto _out
}
}
}
goto st1
st1:
//line NONE:1
lex.ts = 0
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof1
}
st_case_1:
//line NONE:1
lex.ts = (lex.p)
//line lexer.go:157
switch lex.data[(lex.p)] {
case 32:
goto tr0
case 44:
goto tr2
case 65:
goto st2
case 70:
goto st4
case 83:
goto st7
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] < 66:
if 9 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 13 {
goto tr0
}
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
default:
goto tr4
}
goto st0
st_case_0:
st0:
lex.cs = 0
goto _out
st2:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof2
}
st_case_2:
switch lex.data[(lex.p)] {
case 83:
goto tr8
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
tr4:
//line NONE:1
lex.te = (lex.p) + 1
//line lexer.rl:63
lex.act = 5
goto st3
tr8:
//line NONE:1
lex.te = (lex.p) + 1
//line lexer.rl:61
lex.act = 3
goto st3
tr12:
//line NONE:1
lex.te = (lex.p) + 1
//line lexer.rl:60
lex.act = 2
goto st3
tr17:
//line NONE:1
lex.te = (lex.p) + 1
//line lexer.rl:59
lex.act = 1
goto st3
st3:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof3
}
st_case_3:
//line lexer.go:242
if lex.data[(lex.p)] == 95 {
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr9
st4:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof4
}
st_case_4:
switch lex.data[(lex.p)] {
case 82:
goto st5
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st5:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof5
}
st_case_5:
switch lex.data[(lex.p)] {
case 79:
goto st6
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st6:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof6
}
st_case_6:
switch lex.data[(lex.p)] {
case 77:
goto tr12
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st7:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof7
}
st_case_7:
switch lex.data[(lex.p)] {
case 69:
goto st8
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st8:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof8
}
st_case_8:
switch lex.data[(lex.p)] {
case 76:
goto st9
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st9:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof9
}
st_case_9:
switch lex.data[(lex.p)] {
case 69:
goto st10
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st10:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof10
}
st_case_10:
switch lex.data[(lex.p)] {
case 67:
goto st11
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st11:
if (lex.p)++; (lex.p) == (lex.pe) {
goto _test_eof11
}
st_case_11:
switch lex.data[(lex.p)] {
case 84:
goto tr17
case 95:
goto tr4
}
switch {
case lex.data[(lex.p)] > 90:
if 97 <= lex.data[(lex.p)] && lex.data[(lex.p)] <= 122 {
goto tr4
}
case lex.data[(lex.p)] >= 65:
goto tr4
}
goto tr7
st_out:
_test_eof1:
lex.cs = 1
goto _test_eof
_test_eof2:
lex.cs = 2
goto _test_eof
_test_eof3:
lex.cs = 3
goto _test_eof
_test_eof4:
lex.cs = 4
goto _test_eof
_test_eof5:
lex.cs = 5
goto _test_eof
_test_eof6:
lex.cs = 6
goto _test_eof
_test_eof7:
lex.cs = 7
goto _test_eof
_test_eof8:
lex.cs = 8
goto _test_eof
_test_eof9:
lex.cs = 9
goto _test_eof
_test_eof10:
lex.cs = 10
goto _test_eof
_test_eof11:
lex.cs = 11
goto _test_eof
_test_eof:
{
}
if (lex.p) == eof {
switch lex.cs {
case 2:
goto tr7
case 3:
goto tr9
case 4:
goto tr7
case 5:
goto tr7
case 6:
goto tr7
case 7:
goto tr7
case 8:
goto tr7
case 9:
goto tr7
case 10:
goto tr7
case 11:
goto tr7
}
}
_out:
{
}
}
//line lexer.rl:72
return tok
}
func (lex *lexer) Error(e string) {
fmt.Println("error:", e)
}