-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathparser.rs
More file actions
1457 lines (1314 loc) · 55.3 KB
/
parser.rs
File metadata and controls
1457 lines (1314 loc) · 55.3 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
//! Parser:Token 串 → AST
//!
//! 使用遞迴下降解析器(Recursive Descent Parser)將 token 流轉換為抽象語法樹。
//!
//! ## 解析流程
//!
//! ```text
//! SQL 字串 → Lexer → Token 流 → Parser → AST
//! ```
//!
//! ## 設計模式
//!
//! 採用 Pratt Parser(表達式解析)與傳統遞迴下降(語句解析)相結合:
//! - **語句層級**:使用遞迴下降(SELECT、INSERT 等)
//! - **表達式層級**:使用 Pratt Parser 處理運算子優先順序
//!
//! ## 運算子優先順序(由低到高)
//!
//! 1. OR
//! 2. AND
//! 3. NOT
//! 4. 比較(=, !=, <, <=, >, >=, IS, BETWEEN, IN, LIKE)
//! 5. 加減(+, -, ||)
//! 6. 乘除(*, /, %)
//! 7. 一元(-, NOT)
//! 8. 主值(literal, column, function, subquery)
use super::ast::*;
use super::lexer::Token;
/// Parser 結構
///
/// 持有 token 陣列與目前解析位置
pub struct Parser {
/// 輸入的 token 序列
tokens: Vec<Token>,
/// 目前解析位置
pos: usize,
}
impl Parser {
/// 建立新的 Parser
pub fn new(tokens: Vec<Token>) -> Self {
Parser { tokens, pos: 0 }
}
// ── 基本操作 ──────────────────────────────────────────────────────────
/// 查看目前 token(不移動)
fn peek(&self) -> &Token {
self.tokens.get(self.pos).unwrap_or(&Token::Eof)
}
/// 查看下個 token(不移動)
fn peek2(&self) -> &Token {
self.tokens.get(self.pos + 1).unwrap_or(&Token::Eof)
}
/// 取出目前 token 並移動到下一個
fn advance(&mut self) -> Token {
let t = self.tokens.get(self.pos).cloned().unwrap_or(Token::Eof);
if self.pos < self.tokens.len() { self.pos += 1; }
t
}
/// 檢查目前 token 是否為指定類型
fn check(&self, tok: &Token) -> bool { self.peek() == tok }
/// 吃掉指定 token,若匹配則移動並返回 Ok
fn eat(&mut self, tok: &Token) -> Result<(), String> {
if self.peek() == tok {
self.advance();
Ok(())
} else {
Err(format!("expected {:?}, got {:?}", tok, self.peek()))
}
}
/// 吃掉一個識別符
///
/// 允許某些關鍵字(如 TEXT、INTEGER)作為識別符使用
fn eat_ident(&mut self) -> Result<String, String> {
match self.advance() {
Token::Ident(s) => Ok(s),
// 允許關鍵字當作識別符(常見情形:表名叫 "order")
t => {
if let Some(s) = token_as_ident(&t) { Ok(s) }
else { Err(format!("expected identifier, got {:?}", t)) }
}
}
}
/// 可選匹配:若目前 token 匹配則吃掉並返回 true
fn maybe(&mut self, tok: &Token) -> bool {
if self.peek() == tok { self.advance(); true } else { false }
}
// ── 頂層解析 ──────────────────────────────────────────────────────────
/// 解析多個語句(以分號分隔)
///
/// 持續解析直到遇到 EOF
pub fn parse(&mut self) -> Result<Vec<Statement>, String> {
let mut stmts = Vec::new();
while self.peek() != &Token::Eof {
// 吃掉可選的分號
self.maybe(&Token::Semicolon);
if self.peek() == &Token::Eof { break; }
stmts.push(self.parse_statement()?);
self.maybe(&Token::Semicolon);
}
Ok(stmts)
}
/// 根據第一個 token 判斷語句類型並解析
fn parse_statement(&mut self) -> Result<Statement, String> {
match self.peek().clone() {
Token::Select | Token::With => Ok(Statement::Select(self.parse_select()?)),
Token::Insert => Ok(Statement::Insert(self.parse_insert()?)),
Token::Update => Ok(Statement::Update(self.parse_update()?)),
Token::Delete => Ok(Statement::Delete(self.parse_delete()?)),
Token::Create => self.parse_create(),
Token::Drop => self.parse_drop(),
Token::Begin => { self.advance(); Ok(Statement::Begin) }
Token::Commit => { self.advance(); Ok(Statement::Commit) }
Token::Rollback => { self.advance(); Ok(Statement::Rollback) }
Token::Alter => Ok(Statement::AlterTable(self.parse_alter_table()?)),
Token::Pragma => Ok(Statement::Pragma(self.parse_pragma()?)),
Token::Explain => Ok(Statement::Explain(self.parse_explain()?)),
Token::Reindex => Ok(Statement::Reindex(self.parse_reindex()?)),
Token::Analyze => Ok(Statement::Analyze(self.parse_analyze()?)),
Token::Attach => self.parse_attach(),
Token::Detach => self.parse_detach(),
Token::Vacuum => { self.advance(); Ok(Statement::Vacuum) }
t => Err(format!("unexpected token {:?}", t)),
}
}
// ── SELECT ────────────────────────────────────────────────────────────
fn parse_select(&mut self) -> Result<SelectStmt, String> {
// WITH ctes
let with = self.parse_with_clause()?;
self.eat(&Token::Select)?;
let distinct = self.maybe(&Token::Distinct);
let columns = self.parse_select_items()?;
let from = if self.maybe(&Token::From) {
Some(self.parse_from_item()?)
} else { None };
let joins = self.parse_joins()?;
let where_ = if self.maybe(&Token::Where) {
Some(self.parse_expr()?)
} else { None };
let group_by = if self.check(&Token::Group) && self.peek2() == &Token::By {
self.advance(); self.advance();
self.parse_expr_list()?
} else { vec![] };
let having = if self.maybe(&Token::Having) {
Some(self.parse_expr()?)
} else { None };
let order_by = if self.check(&Token::Order) && self.peek2() == &Token::By {
self.advance(); self.advance();
self.parse_order_items()?
} else { vec![] };
let (limit, offset) = if self.maybe(&Token::Limit) {
let first = self.parse_expr()?;
// LIMIT n, m - MySQL style (n = offset, m = limit)
// LIMIT n OFFSET m - standard (n = limit, m = offset)
if self.check(&Token::Comma) {
self.advance();
let limit = self.parse_expr()?;
let offset = Some(first);
(Some(limit), offset)
} else if self.maybe(&Token::Offset) {
let offset = Some(self.parse_expr()?);
(Some(first), offset)
} else {
(Some(first), None)
}
} else {
let offset = if self.maybe(&Token::Offset) {
Some(self.parse_expr()?)
} else { None };
(None, offset)
};
let union_with = if self.maybe(&Token::Union) {
let is_all = self.maybe(&Token::All);
let right = self.parse_select()?;
Some(Box::new((right, is_all)))
} else { None };
Ok(SelectStmt { with, distinct, columns, from, joins, where_, group_by, having, order_by, limit, offset, union_with })
}
fn parse_select_items(&mut self) -> Result<Vec<SelectItem>, String> {
let mut items = Vec::new();
loop {
let item = if self.check(&Token::Star) {
self.advance();
SelectItem::Star
} else {
let expr = self.parse_expr()?;
// table.*
if let Expr::Column { table: None, name } = &expr {
if self.check(&Token::Dot) && self.peek2() == &Token::Star {
let t = name.clone();
self.advance(); self.advance();
items.push(SelectItem::TableStar(t));
if !self.maybe(&Token::Comma) { break; }
continue;
}
}
let alias = if self.maybe(&Token::As) {
Some(self.eat_ident()?)
} else if let Token::Ident(_) = self.peek() {
Some(self.eat_ident()?)
} else { None };
SelectItem::Expr { expr, alias }
};
items.push(item);
if !self.maybe(&Token::Comma) { break; }
}
Ok(items)
}
fn parse_table_ref(&mut self) -> Result<TableRef, String> {
let name = self.eat_ident()?;
if self.maybe(&Token::Dot) {
let table = self.eat_ident()?;
let full_name = format!("{}.{}", name, table);
let alias = if self.maybe(&Token::As) {
Some(self.eat_ident()?)
} else { None };
Ok(TableRef { name: full_name, alias })
} else {
let alias = if self.maybe(&Token::As) {
Some(self.eat_ident()?)
} else if let Token::Ident(_) = self.peek() {
Some(self.eat_ident()?)
} else { None };
Ok(TableRef { name, alias })
}
}
fn parse_joins(&mut self) -> Result<Vec<Join>, String> {
let mut joins = Vec::new();
loop {
let kind = match self.peek().clone() {
Token::Join | Token::Inner => {
if self.peek().clone() == Token::Inner { self.advance(); }
self.eat(&Token::Join)?;
JoinKind::Inner
}
Token::Left => {
self.advance();
self.maybe(&Token::Outer);
self.eat(&Token::Join)?;
JoinKind::Left
}
Token::Right => {
self.advance();
self.maybe(&Token::Outer);
self.eat(&Token::Join)?;
JoinKind::Right
}
Token::Cross => {
self.advance();
self.eat(&Token::Join)?;
JoinKind::Cross
}
Token::Natural => {
self.advance();
self.eat(&Token::Join)?;
JoinKind::Natural
}
_ => break,
};
let table = self.parse_table_ref()?;
let condition = if self.maybe(&Token::On) {
JoinCondition::On(self.parse_expr()?)
} else if self.maybe(&Token::Using) {
self.eat(&Token::LParen)?;
let cols = self.parse_ident_list()?;
self.eat(&Token::RParen)?;
JoinCondition::Using(cols)
} else {
JoinCondition::None
};
joins.push(Join { kind, table, condition });
}
Ok(joins)
}
fn parse_order_items(&mut self) -> Result<Vec<OrderItem>, String> {
let mut items = Vec::new();
loop {
let expr = self.parse_expr()?;
let asc = !self.maybe(&Token::Desc);
if self.check(&Token::Asc) { self.advance(); }
items.push(OrderItem { expr, asc });
if !self.maybe(&Token::Comma) { break; }
}
Ok(items)
}
// ── INSERT ────────────────────────────────────────────────────────────
fn parse_insert(&mut self) -> Result<InsertStmt, String> {
self.eat(&Token::Insert)?;
self.eat(&Token::Into)?;
let table = self.eat_ident()?;
let columns = if self.check(&Token::LParen) && self.is_values_next() {
self.eat(&Token::LParen)?;
let cols = self.parse_ident_list()?;
self.eat(&Token::RParen)?;
cols
} else { vec![] };
// INSERT DEFAULT VALUES
let (values, default_values) = if self.check(&Token::Default) {
self.advance();
self.eat(&Token::Values)?;
(vec![vec![]], true)
} else {
self.eat(&Token::Values)?;
let mut vals = Vec::new();
loop {
self.eat(&Token::LParen)?;
vals.push(self.parse_expr_list()?);
self.eat(&Token::RParen)?;
if !self.maybe(&Token::Comma) { break; }
}
(vals, false)
};
let on_conflict = if self.maybe(&Token::On) {
self.eat(&Token::Conflict)?;
self.eat(&Token::Do)?;
if self.check(&Token::Nothing) {
self.advance();
Some(crate::parser::ast::OnConflict::DoNothing)
} else {
self.eat(&Token::Update)?;
self.eat(&Token::Set)?;
let col = self.eat_ident()?;
self.eat(&Token::Eq)?;
let val = self.parse_expr()?;
Some(crate::parser::ast::OnConflict::DoUpdate { column: col, value: val })
}
} else { None };
Ok(InsertStmt { table, columns, values, default_values, on_conflict })
}
fn is_values_next(&self) -> bool {
// 往前掃 ) 之後是否接 VALUES
let mut i = self.pos + 1;
let mut depth = 1;
while i < self.tokens.len() {
match &self.tokens[i] {
Token::LParen => depth += 1,
Token::RParen => { depth -= 1; if depth == 0 { break; } }
_ => {}
}
i += 1;
}
self.tokens.get(i + 1) == Some(&Token::Values)
}
// ── UPDATE ────────────────────────────────────────────────────────────
fn parse_update(&mut self) -> Result<UpdateStmt, String> {
self.eat(&Token::Update)?;
let table = self.eat_ident()?;
self.eat(&Token::Set)?;
let mut sets = Vec::new();
loop {
let col = self.eat_ident()?;
self.eat(&Token::Eq)?;
let val = self.parse_expr()?;
sets.push((col, val));
if !self.maybe(&Token::Comma) { break; }
}
let where_ = if self.maybe(&Token::Where) { Some(self.parse_expr()?) } else { None };
Ok(UpdateStmt { table, sets, where_ })
}
// ── DELETE ────────────────────────────────────────────────────────────
fn parse_delete(&mut self) -> Result<DeleteStmt, String> {
self.eat(&Token::Delete)?;
self.eat(&Token::From)?;
let table = self.eat_ident()?;
let where_ = if self.maybe(&Token::Where) { Some(self.parse_expr()?) } else { None };
Ok(DeleteStmt { table, where_ })
}
// ── CREATE ────────────────────────────────────────────────────────────
fn parse_create(&mut self) -> Result<Statement, String> {
self.eat(&Token::Create)?;
let unique = self.maybe(&Token::Unique);
match self.peek().clone() {
Token::Table => Ok(Statement::CreateTable(self.parse_create_table()?)),
Token::Index => Ok(Statement::CreateIndex(self.parse_create_index(unique)?)),
Token::View => Ok(Statement::CreateView(self.parse_create_view()?)),
Token::Trigger => Ok(Statement::CreateTrigger(self.parse_create_trigger()?)),
t => Err(format!("expected TABLE, INDEX, VIEW, or TRIGGER after CREATE, got {:?}", t)),
}
}
fn parse_create_view(&mut self) -> Result<CreateViewStmt, String> {
self.eat(&Token::View)?;
let if_not_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Not)?;
self.eat(&Token::Exists)?;
true
} else { false };
let temp = self.check(&Token::Temp);
if temp { self.advance(); }
let name = self.eat_ident()?;
self.eat(&Token::As)?;
let query = Box::new(self.parse_select()?);
Ok(CreateViewStmt { if_not_exists, temp, name, query })
}
fn parse_create_table(&mut self) -> Result<CreateTableStmt, String> {
self.eat(&Token::Table)?;
let if_not_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Not)?;
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
self.eat(&Token::LParen)?;
let mut columns = Vec::new();
let mut constraints = Vec::new();
loop {
if self.check(&Token::Primary) || self.check(&Token::Unique) {
constraints.push(self.parse_table_constraint()?);
} else {
columns.push(self.parse_column_def()?);
}
if !self.maybe(&Token::Comma) { break; }
// 允許尾隨逗號前的 ) 結束
if self.check(&Token::RParen) { break; }
}
self.eat(&Token::RParen)?;
Ok(CreateTableStmt { if_not_exists, name, columns, constraints })
}
fn parse_column_def(&mut self) -> Result<ColumnDef, String> {
let name = self.eat_ident()?;
let data_type = self.parse_sql_type()?;
let mut cons = Vec::new();
loop {
match self.peek().clone() {
Token::Not => {
self.advance();
self.eat(&Token::LitNull)?;
cons.push(ColumnConstraint::NotNull);
}
Token::Primary => {
self.advance();
self.eat(&Token::Key)?;
let autoincrement = matches!(self.peek(), Token::AutoIncrement);
if autoincrement { self.advance(); }
cons.push(ColumnConstraint::PrimaryKey { autoincrement });
}
Token::Unique => { self.advance(); cons.push(ColumnConstraint::Unique); }
Token::Check => {
self.advance();
self.eat(&Token::LParen)?;
let expr = self.parse_expr()?;
self.eat(&Token::RParen)?;
cons.push(ColumnConstraint::Check(expr));
}
Token::References => {
self.advance();
let table = self.eat_ident()?;
// 處理可選的欄位名:REFERENCES table(column)
let column = if matches!(self.peek(), Token::LParen) {
self.advance(); // (
let col = self.eat_ident()?;
self.eat(&Token::RParen)?;
Some(col)
} else {
None
};
cons.push(ColumnConstraint::References { table, column });
}
Token::Default => {
self.advance();
let default_expr = if self.check(&Token::LParen) {
self.eat(&Token::LParen)?;
let expr = self.parse_expr()?;
self.eat(&Token::RParen)?;
expr
} else if self.check(&Token::LitNull) {
self.advance();
Expr::LitNull
} else {
self.parse_primary()?
};
cons.push(ColumnConstraint::Default(default_expr));
}
_ => break,
}
}
Ok(ColumnDef { name, data_type, constraints: cons })
}
fn parse_sql_type(&mut self) -> Result<SqlType, String> {
match self.advance() {
Token::KwInteger => Ok(SqlType::Integer),
Token::Real => Ok(SqlType::Real),
Token::KwText => Ok(SqlType::Text),
Token::Blob => Ok(SqlType::Blob),
Token::Boolean => Ok(SqlType::Boolean),
Token::LitNull => Ok(SqlType::Null),
t => Err(format!("expected type, got {:?}", t)),
}
}
fn parse_table_constraint(&mut self) -> Result<TableConstraint, String> {
match self.peek().clone() {
Token::Primary => {
self.advance(); self.eat(&Token::Key)?;
self.eat(&Token::LParen)?;
let cols = self.parse_ident_list()?;
self.eat(&Token::RParen)?;
Ok(TableConstraint::PrimaryKey(cols))
}
Token::Unique => {
self.advance();
self.eat(&Token::LParen)?;
let cols = self.parse_ident_list()?;
self.eat(&Token::RParen)?;
Ok(TableConstraint::Unique(cols))
}
t => Err(format!("expected table constraint, got {:?}", t)),
}
}
fn parse_create_index(&mut self, unique: bool) -> Result<CreateIndexStmt, String> {
self.eat(&Token::Index)?;
let name = self.eat_ident()?;
self.eat(&Token::On)?;
let table = self.eat_ident()?;
self.eat(&Token::LParen)?;
let columns = self.parse_ident_list()?;
self.eat(&Token::RParen)?;
Ok(CreateIndexStmt { unique, name, table, columns })
}
// ── DROP TABLE / DROP INDEX / DROP VIEW ─────────────────────────────────
fn parse_drop(&mut self) -> Result<Statement, String> {
self.eat(&Token::Drop)?;
match self.peek().clone() {
Token::Table => Ok(Statement::DropTable(self.parse_drop_table()?)),
Token::Index => Ok(Statement::DropIndex(self.parse_drop_index()?)),
Token::View => Ok(Statement::DropView(self.parse_drop_view()?)),
Token::Trigger=> Ok(Statement::DropTrigger(self.parse_drop_trigger()?)),
t => Err(format!("expected TABLE, INDEX, VIEW, or TRIGGER after DROP, got {:?}", t)),
}
}
fn parse_drop_table(&mut self) -> Result<DropTableStmt, String> {
self.eat(&Token::Table)?;
let if_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
Ok(DropTableStmt { if_exists, name })
}
fn parse_drop_index(&mut self) -> Result<DropIndexStmt, String> {
self.eat(&Token::Index)?;
let if_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
Ok(DropIndexStmt { if_exists, name })
}
fn parse_drop_view(&mut self) -> Result<DropViewStmt, String> {
self.eat(&Token::View)?;
let if_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
Ok(DropViewStmt { if_exists, name })
}
// ── TRIGGER ─────────────────────────────────────────────────────────────
fn parse_create_trigger(&mut self) -> Result<CreateTriggerStmt, String> {
self.eat(&Token::Trigger)?;
let if_not_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Not)?;
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
let timing = if self.check(&Token::Before) {
self.advance();
TriggerTiming::Before
} else if self.check(&Token::After) {
self.advance();
TriggerTiming::After
} else if self.check(&Token::Instead) {
self.advance();
self.eat(&Token::Of)?;
TriggerTiming::InsteadOf
} else {
return Err("expected BEFORE, AFTER, or INSTEAD OF".into());
};
let event = if self.check(&Token::Delete) {
self.advance();
TriggerEvent::Delete
} else if self.check(&Token::Insert) {
self.advance();
TriggerEvent::Insert
} else if self.check(&Token::Update) {
self.advance();
let cols = if self.check(&Token::Of) {
self.advance();
let mut columns = Vec::new();
loop {
columns.push(self.eat_ident()?);
if !self.maybe(&Token::Comma) { break; }
}
Some(columns)
} else {
None
};
TriggerEvent::Update(cols)
} else {
return Err("expected DELETE, INSERT, or UPDATE".into());
};
self.eat(&Token::On)?;
let table = self.eat_ident()?;
let for_each_row = if self.check(&Token::For) {
self.advance();
self.eat(&Token::Each)?;
self.eat(&Token::Row)?;
true
} else { false };
let when = if self.check(&Token::When) {
self.advance();
Some(Box::new(self.parse_expr()?))
} else {
None
};
self.eat(&Token::Begin)?;
let body = self.parse_trigger_body()?;
self.eat(&Token::End)?;
Ok(CreateTriggerStmt {
if_not_exists,
name,
table,
timing,
event,
for_each_row,
when,
body,
})
}
fn parse_trigger_body(&mut self) -> Result<String, String> {
let mut depth = 0;
let start = self.pos;
loop {
match self.peek() {
Token::Eof => return Err("unterminated TRIGGER body".into()),
Token::Begin => { self.advance(); depth += 1; }
Token::End if depth == 0 => break,
Token::End => { self.advance(); if depth == 0 { break; } else { depth -= 1; } }
_ => { self.advance(); }
}
}
let tokens = &self.tokens[start..self.pos];
let mut sql = String::new();
for t in tokens {
if let Some(s) = self.token_to_string(t) {
if !sql.is_empty() { sql.push(' '); }
sql.push_str(&s);
}
}
Ok(sql)
}
fn token_to_string(&self, token: &Token) -> Option<String> {
match token {
Token::Select | Token::From | Token::Where | Token::Insert | Token::Into
| Token::Values | Token::Update | Token::Set | Token::Delete | Token::Create
| Token::Table | Token::Index | Token::Drop | Token::As | Token::On
| Token::And | Token::Or | Token::Not | Token::Null | Token::True | Token::False
| Token::Eq | Token::NotEq | Token::Lt | Token::LtEq | Token::Gt | Token::GtEq
| Token::Plus | Token::Minus | Token::Star | Token::Slash | Token::Percent
| Token::LParen | Token::RParen | Token::Comma | Token::Dot | Token::Semicolon
| Token::Like | Token::GLOB | Token::Is | Token::In | Token::Between
| Token::Order | Token::By | Token::Asc | Token::Desc | Token::Limit
| Token::Offset | Token::Join | Token::Inner | Token::Left | Token::Outer
| Token::Cross | Token::Natural | Token::Using | Token::Group | Token::Having
| Token::Distinct | Token::All | Token::Exists | Token::Begin | Token::Commit
| Token::Rollback | Token::Transaction | Token::Union | Token::Cast | Token::When
| Token::For | Token::Each | Token::Row | Token::Trigger | Token::Before
| Token::After | Token::Instead | Token::Of | Token::View | Token::Index
| Token::Primary | Token::Key | Token::Unique | Token::If | Token::Temp
| Token::Reindex | Token::Analyze | Token::Pragma | Token::Explain
| Token::Alter | Token::Rename | Token::To | Token::Add | Token::Column
| Token::AutoIncrement | Token::Default | Token::Check | Token::Conflict
| Token::Virtual | Token::Match | Token::With | Token::Recursive
| Token::References | Token::KwInteger | Token::Real | Token::Blob
| Token::Boolean | Token::Nothing | Token::Do | Token::Attach
| Token::Detach | Token::Database | Token::Vacuum => {
Some(format!("{:?}", token).to_uppercase())
}
Token::Ident(s) => Some(s.clone()),
Token::LitInt(i) => Some(i.to_string()),
Token::LitFloat(f) => Some(f.to_string()),
Token::LitStr(s) => Some(format!("'{}'", s)),
Token::Right => Some("RIGHT".to_string()),
Token::KwText => Some("TEXT".to_string()),
Token::End => Some("END".to_string()),
Token::Concat => Some("||".to_string()),
Token::LitNull => Some("NULL".to_string()),
Token::Eof => None,
}
}
fn parse_drop_trigger(&mut self) -> Result<DropTriggerStmt, String> {
self.eat(&Token::Trigger)?;
let if_exists = if self.check(&Token::If) {
self.advance();
self.eat(&Token::Exists)?;
true
} else { false };
let name = self.eat_ident()?;
Ok(DropTriggerStmt { if_exists, name })
}
// ── REINDEX ─────────────────────────────────────────────────────────────
fn parse_reindex(&mut self) -> Result<ReindexStmt, String> {
self.eat(&Token::Reindex)?;
let name = if self.peek().is_ident() {
Some(self.eat_ident()?)
} else { None };
Ok(ReindexStmt { name })
}
// ── ANALYZE ─────────────────────────────────────────────────────────────
fn parse_analyze(&mut self) -> Result<AnalyzeStmt, String> {
self.eat(&Token::Analyze)?;
let name = if self.peek().is_ident() {
Some(self.eat_ident()?)
} else { None };
Ok(AnalyzeStmt { name })
}
// ── ATTACH ─────────────────────────────────────────────────────────────
fn parse_attach(&mut self) -> Result<Statement, String> {
self.eat(&Token::Attach)?;
self.eat(&Token::Database)?;
let tok = self.peek().clone();
let path = match tok {
Token::LitStr(s) => { self.advance(); s }
_ => return Err(format!("expected string literal for path, got {:?}", self.peek())),
};
self.eat(&Token::As)?;
let alias = self.eat_ident()?;
Ok(Statement::Attach { path, alias })
}
// ── DETACH ─────────────────────────────────────────────────────────────
fn parse_detach(&mut self) -> Result<Statement, String> {
self.eat(&Token::Detach)?;
self.eat(&Token::Database)?;
let alias = self.eat_ident()?;
Ok(Statement::Detach { alias })
}
// ── ALTER TABLE ───────────────────────────────────────────────────────
fn parse_alter_table(&mut self) -> Result<AlterTableStmt, String> {
self.eat(&Token::Alter)?;
self.eat(&Token::Table)?;
let table = self.eat_ident()?;
match self.peek().clone() {
Token::Rename => {
self.advance();
self.eat(&Token::To)?;
let to = self.eat_ident()?;
Ok(AlterTableStmt { table, op: AlterTableOp::RenameTo(to) })
}
Token::Add => {
self.advance();
self.eat(&Token::Column)?;
let name = self.eat_ident()?;
let data_type = self.parse_sql_type()?;
Ok(AlterTableStmt { table, op: AlterTableOp::AddColumn { name, data_type } })
}
t => Err(format!("expected RENAME or ADD after ALTER TABLE, got {:?}", t)),
}
}
// ── PRAGMA ─────────────────────────────────────────────────────────────
fn parse_pragma(&mut self) -> Result<PragmaStmt, String> {
self.eat(&Token::Pragma)?;
let name = self.eat_ident()?;
let value = if self.maybe(&Token::Eq) {
Some(self.parse_expr()?)
} else { None };
Ok(PragmaStmt { name, value })
}
// ── EXPLAIN ────────────────────────────────────────────────────────────
fn parse_explain(&mut self) -> Result<ExplainStmt, String> {
self.eat(&Token::Explain)?;
let inner = Box::new(self.parse_statement()?);
Ok(ExplainStmt { inner })
}
// ── 運算式解析(Pratt Parser)────────────────────────────────────────────
//
// Pratt Parser 的核心思想:根據 token 的 "binding power" 決定解析方式
// 每個運算子有左結合性和優先順序
//
// 解析層級(由低到高):
// parse_or → parse_and → parse_not → parse_comparison → ...
// ── 運算式 (Pratt parser) ─────────────────────────────────────────────
/// 解析表達式的入口點
///
/// 從最高優先順序開始解析(parse_or)
fn parse_expr(&mut self) -> Result<Expr, String> {
self.parse_or()
}
/// 解析 OR 運算(最低優先順序)
///
/// # 語法
/// ```text
/// expr ::= expr OR expr
/// ```
fn parse_or(&mut self) -> Result<Expr, String> {
let mut left = self.parse_and()?;
while self.check(&Token::Or) {
self.advance();
let right = self.parse_and()?;
left = Expr::BinOp { left: Box::new(left), op: BinOp::Or, right: Box::new(right) };
}
Ok(left)
}
/// 解析 AND 運算
fn parse_and(&mut self) -> Result<Expr, String> {
let mut left = self.parse_not()?;
while self.check(&Token::And) {
self.advance();
let right = self.parse_not()?;
left = Expr::BinOp { left: Box::new(left), op: BinOp::And, right: Box::new(right) };
}
Ok(left)
}
/// 解析 NOT 運算
fn parse_not(&mut self) -> Result<Expr, String> {
if self.check(&Token::Not) {
self.advance();
let expr = self.parse_comparison()?;
return Ok(Expr::UnaryOp { op: UnaryOp::Not, expr: Box::new(expr) });
}
self.parse_comparison()
}
/// 解析比較運算
///
/// 包含:=, !=, <, <=, >, >=, IS, BETWEEN, IN, LIKE, GLOB
fn parse_comparison(&mut self) -> Result<Expr, String> {
let left = self.parse_addition()?;
// IS [NOT] NULL
if self.check(&Token::Is) {
self.advance();
let negated = self.maybe(&Token::Not);
self.eat(&Token::LitNull)?;
return Ok(Expr::IsNull { expr: Box::new(left), negated });
}
// [NOT] BETWEEN
let negated_between = if self.check(&Token::Not) && self.peek2() == &Token::Between {
self.advance(); true
} else { false };
if self.maybe(&Token::Between) {
let low = self.parse_addition()?;
self.eat(&Token::And)?;
let high = self.parse_addition()?;
return Ok(Expr::Between { expr: Box::new(left), low: Box::new(low), high: Box::new(high), negated: negated_between });
}
// [NOT] IN (...)
let negated_in = if !negated_between && self.check(&Token::Not) && self.peek2() == &Token::In {
self.advance(); true
} else { false };
if self.maybe(&Token::In) {
self.eat(&Token::LParen)?;
// IN (SELECT ...) 子查詢
if self.check(&Token::Select) || self.check(&Token::With) {
let query = self.parse_select()?;
self.eat(&Token::RParen)?;
return Ok(Expr::InSubquery { expr: Box::new(left), query: Box::new(query), negated: negated_in });
}
let list = self.parse_expr_list()?;
self.eat(&Token::RParen)?;
return Ok(Expr::InList { expr: Box::new(left), list, negated: negated_in });
}
// [NOT] LIKE
let negated_like = if !negated_in && self.check(&Token::Not) && self.peek2() == &Token::Like {
self.advance(); true
} else { false };
if self.maybe(&Token::Like) {
let pattern = self.parse_addition()?;
return Ok(Expr::Like { expr: Box::new(left), pattern: Box::new(pattern), negated: negated_like });
}
// [NOT] GLOB
let negated_glob = if !negated_in && self.check(&Token::Not) && self.peek2() == &Token::GLOB {
self.advance(); true
} else { false };
if self.maybe(&Token::GLOB) {
let pattern = self.parse_addition()?;
return Ok(Expr::Glob { expr: Box::new(left), pattern: Box::new(pattern), negated: negated_glob });
}
// 比較運算子
let op = match self.peek() {
Token::Eq => BinOp::Eq,
Token::NotEq => BinOp::NotEq,
Token::Lt => BinOp::Lt,
Token::LtEq => BinOp::LtEq,
Token::Gt => BinOp::Gt,
Token::GtEq => BinOp::GtEq,
_ => return Ok(left),
};
self.advance();
let right = self.parse_addition()?;
Ok(Expr::BinOp { left: Box::new(left), op, right: Box::new(right) })
}
/// 解析加法/減法(+、-、||)
fn parse_addition(&mut self) -> Result<Expr, String> {
let mut left = self.parse_multiplication()?;
loop {
let op = match self.peek() {
Token::Plus => BinOp::Add,
Token::Minus => BinOp::Sub,
Token::Concat => BinOp::Concat,
_ => break,
};
self.advance();
let right = self.parse_multiplication()?;