-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathparse.peg.go
More file actions
3843 lines (3799 loc) · 81.4 KB
/
parse.peg.go
File metadata and controls
3843 lines (3799 loc) · 81.4 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
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
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
package simpleSqlParser
import (
"fmt"
"math"
"sort"
"strconv"
)
const endSymbol rune = 1114112
/* The rule types inferred from the grammar are below. */
type pegRule uint8
const (
ruleUnknown pegRule = iota
ruleG
ruleDropStatement
ruleSelectStatement
ruleDeleteStatement
ruleInsertStatement
ruleCreateStatement
ruleColumns
ruleSelectParaColList
ruleSelectColList
ruleSelectColName
ruleInsertParaColList
ruleInsertColList
ruleInsertColName
ruleCreateParaColList
ruleCreateColList
ruleCreateColName
ruleInsertBody
ruleValues
ruleValuesBody
ruleValList
ruleInsertValue
ruleEachValue
ruleAsterisk
rulelineComment
ruleblockComment
rulews
rule_
ruleLetter
ruleNumber
ruleAlphaNum
ruleSelectTable
ruleSelectKeyspace
ruleSelectTableName
ruleInsertTable
ruleInsertKeyspace
ruleInsertTableName
ruleCreateTable
ruleCreateKeyspace
ruleCreateTableName
ruleDropTable
ruleDropTableKeyspace
ruleDropTableName
ruleDeleteTable
ruleDeleteKeyspace
ruleDeleteTableName
ruleWHERESELECT
ruleSELECTFILTERS
ruleSELECTFILTER
ruleSelectOperation
ruleSelectEquality
ruleSelectLessThan
ruleSelectGreaterThan
ruleSelectFilterColumn
ruleSelectFilterValue
ruleWHEREDELETE
ruleDELETEFILTER
ruleDeleteOperation
ruleDeleteEquality
ruleDeleteLessThan
ruleDeleteGreaterThan
ruleDeleteFilterColumn
ruleDeleteFilterValue
ruleLIMIT
ruleLimitVal
ruleAction0
ruleAction1
rulePegText
ruleAction2
ruleAction3
ruleAction4
ruleAction5
ruleAction6
ruleAction7
ruleAction8
ruleAction9
ruleAction10
ruleAction11
ruleAction12
ruleAction13
ruleAction14
ruleAction15
ruleAction16
ruleAction17
ruleAction18
ruleAction19
ruleAction20
ruleAction21
ruleAction22
ruleAction23
ruleAction24
ruleAction25
ruleAction26
ruleAction27
)
var rul3s = [...]string{
"Unknown",
"G",
"DropStatement",
"SelectStatement",
"DeleteStatement",
"InsertStatement",
"CreateStatement",
"Columns",
"SelectParaColList",
"SelectColList",
"SelectColName",
"InsertParaColList",
"InsertColList",
"InsertColName",
"CreateParaColList",
"CreateColList",
"CreateColName",
"InsertBody",
"Values",
"ValuesBody",
"ValList",
"InsertValue",
"EachValue",
"Asterisk",
"lineComment",
"blockComment",
"ws",
"_",
"Letter",
"Number",
"AlphaNum",
"SelectTable",
"SelectKeyspace",
"SelectTableName",
"InsertTable",
"InsertKeyspace",
"InsertTableName",
"CreateTable",
"CreateKeyspace",
"CreateTableName",
"DropTable",
"DropTableKeyspace",
"DropTableName",
"DeleteTable",
"DeleteKeyspace",
"DeleteTableName",
"WHERESELECT",
"SELECTFILTERS",
"SELECTFILTER",
"SelectOperation",
"SelectEquality",
"SelectLessThan",
"SelectGreaterThan",
"SelectFilterColumn",
"SelectFilterValue",
"WHEREDELETE",
"DELETEFILTER",
"DeleteOperation",
"DeleteEquality",
"DeleteLessThan",
"DeleteGreaterThan",
"DeleteFilterColumn",
"DeleteFilterValue",
"LIMIT",
"LimitVal",
"Action0",
"Action1",
"PegText",
"Action2",
"Action3",
"Action4",
"Action5",
"Action6",
"Action7",
"Action8",
"Action9",
"Action10",
"Action11",
"Action12",
"Action13",
"Action14",
"Action15",
"Action16",
"Action17",
"Action18",
"Action19",
"Action20",
"Action21",
"Action22",
"Action23",
"Action24",
"Action25",
"Action26",
"Action27",
}
type token32 struct {
pegRule
begin, end uint32
}
func (t *token32) String() string {
return fmt.Sprintf("\x1B[34m%v\x1B[m %v %v", rul3s[t.pegRule], t.begin, t.end)
}
type node32 struct {
token32
up, next *node32
}
func (node *node32) print(pretty bool, buffer string) {
var print func(node *node32, depth int)
print = func(node *node32, depth int) {
for node != nil {
for c := 0; c < depth; c++ {
fmt.Printf(" ")
}
rule := rul3s[node.pegRule]
quote := strconv.Quote(string(([]rune(buffer)[node.begin:node.end])))
if !pretty {
fmt.Printf("%v %v\n", rule, quote)
} else {
fmt.Printf("\x1B[34m%v\x1B[m %v\n", rule, quote)
}
if node.up != nil {
print(node.up, depth+1)
}
node = node.next
}
}
print(node, 0)
}
func (node *node32) Print(buffer string) {
node.print(false, buffer)
}
func (node *node32) PrettyPrint(buffer string) {
node.print(true, buffer)
}
type tokens32 struct {
tree []token32
}
func (t *tokens32) Trim(length uint32) {
t.tree = t.tree[:length]
}
func (t *tokens32) Print() {
for _, token := range t.tree {
fmt.Println(token.String())
}
}
func (t *tokens32) AST() *node32 {
type element struct {
node *node32
down *element
}
tokens := t.Tokens()
var stack *element
for _, token := range tokens {
if token.begin == token.end {
continue
}
node := &node32{token32: token}
for stack != nil && stack.node.begin >= token.begin && stack.node.end <= token.end {
stack.node.next = node.up
node.up = stack.node
stack = stack.down
}
stack = &element{node: node, down: stack}
}
if stack != nil {
return stack.node
}
return nil
}
func (t *tokens32) PrintSyntaxTree(buffer string) {
t.AST().Print(buffer)
}
func (t *tokens32) PrettyPrintSyntaxTree(buffer string) {
t.AST().PrettyPrint(buffer)
}
func (t *tokens32) Add(rule pegRule, begin, end, index uint32) {
if tree := t.tree; int(index) >= len(tree) {
expanded := make([]token32, 2*len(tree))
copy(expanded, tree)
t.tree = expanded
}
t.tree[index] = token32{
pegRule: rule,
begin: begin,
end: end,
}
}
func (t *tokens32) Tokens() []token32 {
return t.tree
}
type SQL struct {
sType
SelectStatement
InsertStatement
CreateStatement
DropStatement
DeleteStatement
Buffer string
buffer []rune
rules [94]func() bool
parse func(rule ...int) error
reset func()
Pretty bool
tokens32
}
func (p *SQL) Parse(rule ...int) error {
return p.parse(rule...)
}
func (p *SQL) Reset() {
p.reset()
}
type textPosition struct {
line, symbol int
}
type textPositionMap map[int]textPosition
func translatePositions(buffer []rune, positions []int) textPositionMap {
length, translations, j, line, symbol := len(positions), make(textPositionMap, len(positions)), 0, 1, 0
sort.Ints(positions)
search:
for i, c := range buffer {
if c == '\n' {
line, symbol = line+1, 0
} else {
symbol++
}
if i == positions[j] {
translations[positions[j]] = textPosition{line, symbol}
for j++; j < length; j++ {
if i != positions[j] {
continue search
}
}
break search
}
}
return translations
}
type parseError struct {
p *SQL
max token32
}
func (e *parseError) Error() string {
tokens, error := []token32{e.max}, "\n"
positions, p := make([]int, 2*len(tokens)), 0
for _, token := range tokens {
positions[p], p = int(token.begin), p+1
positions[p], p = int(token.end), p+1
}
translations := translatePositions(e.p.buffer, positions)
format := "parse error near %v (line %v symbol %v - line %v symbol %v):\n%v\n"
if e.p.Pretty {
format = "parse error near \x1B[34m%v\x1B[m (line %v symbol %v - line %v symbol %v):\n%v\n"
}
for _, token := range tokens {
begin, end := int(token.begin), int(token.end)
error += fmt.Sprintf(format,
rul3s[token.pegRule],
translations[begin].line, translations[begin].symbol,
translations[end].line, translations[end].symbol,
strconv.Quote(string(e.p.buffer[begin:end])))
}
return error
}
func (p *SQL) PrintSyntaxTree() {
if p.Pretty {
p.tokens32.PrettyPrintSyntaxTree(p.Buffer)
} else {
p.tokens32.PrintSyntaxTree(p.Buffer)
}
}
func (p *SQL) Execute() {
buffer, _buffer, text, begin, end := p.Buffer, p.buffer, "", 0, 0
for _, token := range p.Tokens() {
switch token.pegRule {
case rulePegText:
begin, end = int(token.begin), int(token.end)
text = string(_buffer[begin:end])
case ruleAction0:
p.validateInsert()
case ruleAction1:
p.setPartitionKey(buffer[begin:end])
case ruleAction2:
p.SelectStatement.Columns = append(p.SelectStatement.Columns, buffer[begin:end])
case ruleAction3:
p.InsertStatement.Columns = append(p.InsertStatement.Columns, buffer[begin:end])
case ruleAction4:
p.CreateStatement.Columns = append(p.CreateStatement.Columns, buffer[begin:end])
case ruleAction5:
p.captureValues(buffer[begin:end])
case ruleAction6:
p.SelectStatement.AllColumns = true
case ruleAction7:
p.SelectStatement.Keyspace = buffer[begin:end]
case ruleAction8:
p.SelectStatement.TableName = buffer[begin:end]
case ruleAction9:
p.InsertStatement.Keyspace = buffer[begin:end]
case ruleAction10:
p.InsertStatement.TableName = buffer[begin:end]
case ruleAction11:
p.CreateStatement.Keyspace = buffer[begin:end]
case ruleAction12:
p.CreateStatement.TableName = buffer[begin:end]
case ruleAction13:
p.DropStatement.Keyspace = buffer[begin:end]
case ruleAction14:
p.DropStatement.TableName = buffer[begin:end]
case ruleAction15:
p.DeleteStatement.Keyspace = buffer[begin:end]
case ruleAction16:
p.DeleteStatement.TableName = buffer[begin:end]
case ruleAction17:
p.SelectStatement.Operators = append(p.SelectStatement.Operators, buffer[begin:end])
case ruleAction18:
p.SelectStatement.Operators = append(p.SelectStatement.Operators, buffer[begin:end])
case ruleAction19:
p.SelectStatement.Operators = append(p.SelectStatement.Operators, buffer[begin:end])
case ruleAction20:
p.SelectStatement.WhereColumns = append(p.SelectStatement.WhereColumns, buffer[begin:end])
case ruleAction21:
p.SelectStatement.WhereValues = append(p.SelectStatement.WhereValues, buffer[begin:end])
case ruleAction22:
p.DeleteStatement.Operator = buffer[begin:end]
case ruleAction23:
p.DeleteStatement.Operator = buffer[begin:end]
case ruleAction24:
p.DeleteStatement.Operator = buffer[begin:end]
case ruleAction25:
p.DeleteStatement.WhereColumn = buffer[begin:end]
case ruleAction26:
p.DeleteStatement.WhereValue = buffer[begin:end]
case ruleAction27:
var err error
p.SelectStatement.Limit, err = strconv.Atoi(buffer[begin:end])
if err != nil {
p.SelectStatement.Limit = -1
}
}
}
_, _, _, _, _ = buffer, _buffer, text, begin, end
}
func (p *SQL) Init() {
var (
max token32
position, tokenIndex uint32
buffer []rune
)
p.reset = func() {
max = token32{}
position, tokenIndex = 0, 0
p.buffer = []rune(p.Buffer)
if len(p.buffer) == 0 || p.buffer[len(p.buffer)-1] != endSymbol {
p.buffer = append(p.buffer, endSymbol)
}
buffer = p.buffer
}
p.reset()
_rules := p.rules
tree := tokens32{tree: make([]token32, math.MaxInt16)}
p.parse = func(rule ...int) error {
r := 1
if len(rule) > 0 {
r = rule[0]
}
matches := p.rules[r]()
p.tokens32 = tree
if matches {
p.Trim(tokenIndex)
return nil
}
return &parseError{p, max}
}
add := func(rule pegRule, begin uint32) {
tree.Add(rule, begin, position, tokenIndex)
tokenIndex++
if begin != position && position > max.end {
max = token32{rule, begin, position}
}
}
matchDot := func() bool {
if buffer[position] != endSymbol {
position++
return true
}
return false
}
/*matchChar := func(c byte) bool {
if buffer[position] == c {
position++
return true
}
return false
}*/
/*matchRange := func(lower byte, upper byte) bool {
if c := buffer[position]; c >= lower && c <= upper {
position++
return true
}
return false
}*/
_rules = [...]func() bool{
nil,
/* 0 G <- <(SelectStatement / InsertStatement / CreateStatement / DropStatement / (DeleteStatement !.))> */
func() bool {
position0, tokenIndex0 := position, tokenIndex
{
position1 := position
{
position2, tokenIndex2 := position, tokenIndex
if !_rules[ruleSelectStatement]() {
goto l3
}
goto l2
l3:
position, tokenIndex = position2, tokenIndex2
if !_rules[ruleInsertStatement]() {
goto l4
}
goto l2
l4:
position, tokenIndex = position2, tokenIndex2
if !_rules[ruleCreateStatement]() {
goto l5
}
goto l2
l5:
position, tokenIndex = position2, tokenIndex2
if !_rules[ruleDropStatement]() {
goto l6
}
goto l2
l6:
position, tokenIndex = position2, tokenIndex2
if !_rules[ruleDeleteStatement]() {
goto l0
}
{
position7, tokenIndex7 := position, tokenIndex
if !matchDot() {
goto l7
}
goto l0
l7:
position, tokenIndex = position7, tokenIndex7
}
}
l2:
add(ruleG, position1)
}
return true
l0:
position, tokenIndex = position0, tokenIndex0
return false
},
/* 1 DropStatement <- <(_ (('d' / 'D') ('r' / 'R') ('o' / 'O') ('p' / 'P')) _ DropTable _ ';' _)> */
func() bool {
position8, tokenIndex8 := position, tokenIndex
{
position9 := position
if !_rules[rule_]() {
goto l8
}
{
position10, tokenIndex10 := position, tokenIndex
if buffer[position] != rune('d') {
goto l11
}
position++
goto l10
l11:
position, tokenIndex = position10, tokenIndex10
if buffer[position] != rune('D') {
goto l8
}
position++
}
l10:
{
position12, tokenIndex12 := position, tokenIndex
if buffer[position] != rune('r') {
goto l13
}
position++
goto l12
l13:
position, tokenIndex = position12, tokenIndex12
if buffer[position] != rune('R') {
goto l8
}
position++
}
l12:
{
position14, tokenIndex14 := position, tokenIndex
if buffer[position] != rune('o') {
goto l15
}
position++
goto l14
l15:
position, tokenIndex = position14, tokenIndex14
if buffer[position] != rune('O') {
goto l8
}
position++
}
l14:
{
position16, tokenIndex16 := position, tokenIndex
if buffer[position] != rune('p') {
goto l17
}
position++
goto l16
l17:
position, tokenIndex = position16, tokenIndex16
if buffer[position] != rune('P') {
goto l8
}
position++
}
l16:
if !_rules[rule_]() {
goto l8
}
if !_rules[ruleDropTable]() {
goto l8
}
if !_rules[rule_]() {
goto l8
}
if buffer[position] != rune(';') {
goto l8
}
position++
if !_rules[rule_]() {
goto l8
}
add(ruleDropStatement, position9)
}
return true
l8:
position, tokenIndex = position8, tokenIndex8
return false
},
/* 2 SelectStatement <- <(_ (('s' / 'S') ('e' / 'E') ('l' / 'L') ('e' / 'E') ('c' / 'C') ('t' / 'T')) _ Columns _ (('f' / 'F') ('r' / 'R') ('o' / 'O') ('m' / 'M')) _ SelectTable _ WHERESELECT* _ LIMIT* _ ';' _)> */
func() bool {
position18, tokenIndex18 := position, tokenIndex
{
position19 := position
if !_rules[rule_]() {
goto l18
}
{
position20, tokenIndex20 := position, tokenIndex
if buffer[position] != rune('s') {
goto l21
}
position++
goto l20
l21:
position, tokenIndex = position20, tokenIndex20
if buffer[position] != rune('S') {
goto l18
}
position++
}
l20:
{
position22, tokenIndex22 := position, tokenIndex
if buffer[position] != rune('e') {
goto l23
}
position++
goto l22
l23:
position, tokenIndex = position22, tokenIndex22
if buffer[position] != rune('E') {
goto l18
}
position++
}
l22:
{
position24, tokenIndex24 := position, tokenIndex
if buffer[position] != rune('l') {
goto l25
}
position++
goto l24
l25:
position, tokenIndex = position24, tokenIndex24
if buffer[position] != rune('L') {
goto l18
}
position++
}
l24:
{
position26, tokenIndex26 := position, tokenIndex
if buffer[position] != rune('e') {
goto l27
}
position++
goto l26
l27:
position, tokenIndex = position26, tokenIndex26
if buffer[position] != rune('E') {
goto l18
}
position++
}
l26:
{
position28, tokenIndex28 := position, tokenIndex
if buffer[position] != rune('c') {
goto l29
}
position++
goto l28
l29:
position, tokenIndex = position28, tokenIndex28
if buffer[position] != rune('C') {
goto l18
}
position++
}
l28:
{
position30, tokenIndex30 := position, tokenIndex
if buffer[position] != rune('t') {
goto l31
}
position++
goto l30
l31:
position, tokenIndex = position30, tokenIndex30
if buffer[position] != rune('T') {
goto l18
}
position++
}
l30:
if !_rules[rule_]() {
goto l18
}
if !_rules[ruleColumns]() {
goto l18
}
if !_rules[rule_]() {
goto l18
}
{
position32, tokenIndex32 := position, tokenIndex
if buffer[position] != rune('f') {
goto l33
}
position++
goto l32
l33:
position, tokenIndex = position32, tokenIndex32
if buffer[position] != rune('F') {
goto l18
}
position++
}
l32:
{
position34, tokenIndex34 := position, tokenIndex
if buffer[position] != rune('r') {
goto l35
}
position++
goto l34
l35:
position, tokenIndex = position34, tokenIndex34
if buffer[position] != rune('R') {
goto l18
}
position++
}
l34:
{
position36, tokenIndex36 := position, tokenIndex
if buffer[position] != rune('o') {
goto l37
}
position++
goto l36
l37:
position, tokenIndex = position36, tokenIndex36
if buffer[position] != rune('O') {
goto l18
}
position++
}
l36:
{
position38, tokenIndex38 := position, tokenIndex
if buffer[position] != rune('m') {
goto l39
}
position++
goto l38
l39:
position, tokenIndex = position38, tokenIndex38
if buffer[position] != rune('M') {
goto l18
}
position++
}
l38:
if !_rules[rule_]() {
goto l18
}
if !_rules[ruleSelectTable]() {
goto l18
}
if !_rules[rule_]() {
goto l18
}
l40:
{
position41, tokenIndex41 := position, tokenIndex
if !_rules[ruleWHERESELECT]() {
goto l41
}
goto l40
l41:
position, tokenIndex = position41, tokenIndex41
}
if !_rules[rule_]() {
goto l18
}
l42:
{
position43, tokenIndex43 := position, tokenIndex
if !_rules[ruleLIMIT]() {
goto l43
}
goto l42
l43:
position, tokenIndex = position43, tokenIndex43
}
if !_rules[rule_]() {
goto l18
}
if buffer[position] != rune(';') {
goto l18
}
position++
if !_rules[rule_]() {
goto l18
}
add(ruleSelectStatement, position19)
}
return true
l18:
position, tokenIndex = position18, tokenIndex18
return false
},
/* 3 DeleteStatement <- <(('d' / 'D') ('e' / 'E') ('l' / 'L') ('e' / 'E') ('t' / 'T') ('e' / 'E') _ (('f' / 'F') ('r' / 'R') ('o' / 'O') ('m' / 'M')) _ DeleteTable _ WHEREDELETE _ ';' _)> */
func() bool {
position44, tokenIndex44 := position, tokenIndex
{
position45 := position
{
position46, tokenIndex46 := position, tokenIndex
if buffer[position] != rune('d') {
goto l47
}
position++
goto l46
l47:
position, tokenIndex = position46, tokenIndex46
if buffer[position] != rune('D') {
goto l44
}
position++
}
l46:
{
position48, tokenIndex48 := position, tokenIndex
if buffer[position] != rune('e') {
goto l49
}
position++
goto l48
l49:
position, tokenIndex = position48, tokenIndex48
if buffer[position] != rune('E') {
goto l44
}
position++
}
l48:
{
position50, tokenIndex50 := position, tokenIndex
if buffer[position] != rune('l') {
goto l51
}
position++
goto l50
l51:
position, tokenIndex = position50, tokenIndex50
if buffer[position] != rune('L') {
goto l44
}
position++
}
l50:
{
position52, tokenIndex52 := position, tokenIndex
if buffer[position] != rune('e') {
goto l53
}
position++
goto l52
l53:
position, tokenIndex = position52, tokenIndex52
if buffer[position] != rune('E') {
goto l44
}
position++
}
l52:
{
position54, tokenIndex54 := position, tokenIndex
if buffer[position] != rune('t') {
goto l55
}
position++
goto l54
l55:
position, tokenIndex = position54, tokenIndex54
if buffer[position] != rune('T') {
goto l44
}
position++
}
l54:
{
position56, tokenIndex56 := position, tokenIndex
if buffer[position] != rune('e') {
goto l57
}
position++
goto l56
l57: