aletheiadb 0.1.0

A high-performance bi-temporal graph database for LLM integration
Documentation
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
//! Cypher Query Language Recursive Descent Parser
//!
//! Transforms a token stream (produced by [`CypherLexer`]) into an AST
//! ([`CypherStatement`]). The parser is a classic LL(1) recursive descent
//! parser -- each grammar rule maps to a method, and the current token
//! determines which production to use.
//!
//! # Grammar (simplified)
//!
//! ```text
//! statement    := [temporal] match_stmt
//! match_stmt   := [OPTIONAL] MATCH pattern_list [where_clause] [temporal] with_clauses return_clause
//! with_clauses := (WITH return_items [WHERE expr])*
//! pattern_list := pattern (',' pattern)*
//! pattern      := node_pattern (rel_pattern node_pattern)*
//! node_pattern := '(' [var] [':' label]* ['{' props '}'] ')'
//! rel_pattern  := '-' '[' ... ']' '->' | '<-' '[' ... ']' '-' | '-' '[' ... ']' '-'
//! where_clause := WHERE expr
//! return_clause:= RETURN [DISTINCT] return_items [order_by] [SKIP n] [LIMIT n]
//! expr         := or_expr
//! or_expr      := and_expr (OR and_expr)*
//! and_expr     := not_expr (AND not_expr)*
//! not_expr     := NOT not_expr | comparison
//! comparison   := primary (comp_op primary)?
//! primary      := value | var '.' prop | '(' expr ')' | func_call | var
//! ```
//!
//! # Usage
//!
//! ```rust,ignore
//! use aletheiadb::cypher::CypherParser;
//!
//! let ast = CypherParser::parse("MATCH (n:Person) RETURN n")?;
//! ```

use super::ast::*;
use super::error::CypherError;
use super::lexer::{CypherLexer, Token, TokenKind};

/// Recursive descent parser for Cypher queries.
///
/// Created internally by [`CypherParser::parse`]; callers never need to
/// construct one directly.
pub struct CypherParser {
    /// The complete token stream (always ends with `Eof`).
    tokens: Vec<Token>,
    /// Current position in the token stream.
    pos: usize,
}

impl CypherParser {
    /// Parse a Cypher query string into an AST.
    ///
    /// This is the main entry point. It lexes the input and then runs the
    /// recursive descent parser over the resulting token stream.
    ///
    /// # Errors
    ///
    /// Returns [`CypherError::LexError`] if tokenization fails, or
    /// [`CypherError::ParseError`] if the token stream does not form a valid
    /// Cypher statement.
    pub fn parse(input: &str) -> Result<CypherStatement, CypherError> {
        let tokens = CypherLexer::tokenize(input)?;
        let mut parser = Self { tokens, pos: 0 };
        let stmt = parser.parse_statement()?;

        // Ensure we consumed everything (except the trailing Eof).
        if parser.peek().kind != TokenKind::Eof {
            return Err(parser.error("unexpected tokens after end of statement"));
        }
        Ok(stmt)
    }

    // =======================================================================
    // Utility helpers
    // =======================================================================

    /// Return a reference to the current token without advancing.
    fn peek(&self) -> &Token {
        &self.tokens[self.pos]
    }

    /// Return a reference to the current token and advance by one.
    fn advance(&mut self) -> &Token {
        let tok = &self.tokens[self.pos];
        if tok.kind != TokenKind::Eof {
            self.pos += 1;
        }
        tok
    }

    /// Assert that the current token is `kind`, consume it, and return it.
    ///
    /// # Errors
    ///
    /// Returns a parse error if the current token does not match.
    fn expect(&mut self, kind: TokenKind) -> Result<Token, CypherError> {
        if self.peek().kind == kind {
            Ok(self.advance().clone())
        } else {
            Err(self.error(&format!("expected {kind:?}, found {:?}", self.peek().kind)))
        }
    }

    /// Check whether the current token is `kind` without consuming it.
    fn at(&self, kind: TokenKind) -> bool {
        self.peek().kind == kind
    }

    /// If the current token is `kind`, consume it and return `true`.
    fn eat(&mut self, kind: TokenKind) -> bool {
        if self.at(kind) {
            self.advance();
            true
        } else {
            false
        }
    }

    /// Build a [`CypherError::ParseError`] at the current token position.
    fn error(&self, message: &str) -> CypherError {
        CypherError::ParseError {
            position: self.peek().position,
            message: message.to_string(),
        }
    }

    // =======================================================================
    // Grammar rules
    // =======================================================================

    /// ```text
    /// statement := [temporal] match_stmt
    /// ```
    fn parse_statement(&mut self) -> Result<CypherStatement, CypherError> {
        // Check for leading temporal clause (AS OF / FOR / BETWEEN).
        let temporal = self.try_parse_temporal()?;

        // Now expect a MATCH (or OPTIONAL MATCH).
        let stmt = self.parse_match(temporal)?;
        Ok(stmt)
    }

    /// ```text
    /// match_stmt := [OPTIONAL] MATCH pattern_list [where_clause] [temporal_clause] return_clause
    /// ```
    fn parse_match(
        &mut self,
        temporal: Option<CypherTemporal>,
    ) -> Result<CypherStatement, CypherError> {
        let optional = self.eat(TokenKind::OptionalMatch);
        self.expect(TokenKind::Match)?;

        let pattern = self.parse_pattern_list()?;

        let where_clause = if self.at(TokenKind::Where) {
            Some(self.parse_where()?)
        } else {
            None
        };

        // Check for post-pattern temporal clause (between WHERE and RETURN).
        // If a leading temporal clause was already parsed, this is skipped.
        let temporal = if temporal.is_some() {
            temporal
        } else {
            self.try_parse_post_pattern_temporal()?
        };

        // Parse zero or more WITH clauses between pattern/WHERE/temporal and RETURN.
        let with_clauses = self.parse_with_clauses()?;

        let return_clause = self.parse_return()?;

        Ok(CypherStatement::Match {
            optional,
            pattern,
            where_clause,
            return_clause,
            temporal,
            with_clauses,
        })
    }

    // -- Patterns -----------------------------------------------------------

    /// ```text
    /// pattern_list := pattern (',' pattern)*
    /// ```
    fn parse_pattern_list(&mut self) -> Result<Vec<CypherPattern>, CypherError> {
        let mut patterns = vec![self.parse_pattern()?];
        while self.eat(TokenKind::Comma) {
            patterns.push(self.parse_pattern()?);
        }
        Ok(patterns)
    }

    /// ```text
    /// pattern := node_pattern (rel_pattern node_pattern)*
    /// ```
    fn parse_pattern(&mut self) -> Result<CypherPattern, CypherError> {
        let mut elements = Vec::new();
        elements.push(CypherPatternElement::Node(self.parse_node_pattern()?));

        // While we see the start of a relationship (`-` or `<-`), keep parsing
        // relationship + node pairs.
        while self.at(TokenKind::Dash) || self.at(TokenKind::LeftArrow) {
            elements.push(CypherPatternElement::Relationship(
                self.parse_relationship_pattern()?,
            ));
            elements.push(CypherPatternElement::Node(self.parse_node_pattern()?));
        }

        Ok(CypherPattern { elements })
    }

    /// ```text
    /// node_pattern := '(' [var] [':' label]* ['{' props '}'] ')'
    /// ```
    fn parse_node_pattern(&mut self) -> Result<CypherNodePattern, CypherError> {
        self.expect(TokenKind::LParen)?;

        let variable = if self.at(TokenKind::Identifier) {
            let tok = self.advance().clone();
            Some(tok.text)
        } else {
            None
        };

        let mut labels = Vec::new();
        while self.eat(TokenKind::Colon) {
            let label_tok = self.expect(TokenKind::Identifier)?;
            labels.push(label_tok.text);
        }

        let properties = if self.at(TokenKind::LBrace) {
            self.parse_properties()?
        } else {
            Vec::new()
        };

        self.expect(TokenKind::RParen)?;

        Ok(CypherNodePattern {
            variable,
            labels,
            properties,
        })
    }

    /// Parse a relationship pattern. Handles three direction forms:
    ///
    /// - Outgoing: `-[...]->`
    /// - Incoming: `<-[...]- `
    /// - Both: `-[...]-`
    fn parse_relationship_pattern(&mut self) -> Result<CypherRelPattern, CypherError> {
        // Determine direction prefix.
        let incoming = self.eat(TokenKind::LeftArrow); // `<-`

        if !incoming {
            // Must start with `-`
            self.expect(TokenKind::Dash)?;
        }

        // Parse the bracket contents: `[var :TYPE|TYPE *depth {props}]`
        self.expect(TokenKind::LBracket)?;

        let variable = if self.at(TokenKind::Identifier) {
            let tok = self.advance().clone();
            Some(tok.text)
        } else {
            None
        };

        let mut rel_types = Vec::new();
        if self.eat(TokenKind::Colon) {
            let type_tok = self.expect(TokenKind::Identifier)?;
            rel_types.push(type_tok.text);
            while self.eat(TokenKind::Pipe) {
                let type_tok = self.expect(TokenKind::Identifier)?;
                rel_types.push(type_tok.text);
            }
        }

        let depth = if self.eat(TokenKind::Star) {
            Some(self.parse_depth()?)
        } else {
            None
        };

        let properties = if self.at(TokenKind::LBrace) {
            self.parse_properties()?
        } else {
            Vec::new()
        };

        self.expect(TokenKind::RBracket)?;

        // Determine direction suffix.
        let direction = if incoming {
            // We already consumed `<-` ... `]`, now expect trailing `-`.
            self.expect(TokenKind::Dash)?;
            CypherDirection::Incoming
        } else if self.eat(TokenKind::Arrow) {
            // `-[...]->`
            CypherDirection::Outgoing
        } else {
            // `-[...]-`
            self.expect(TokenKind::Dash)?;
            CypherDirection::Both
        };

        Ok(CypherRelPattern {
            variable,
            rel_types,
            direction,
            depth,
            properties,
        })
    }

    /// Parse a variable-length depth specifier (everything after `*`).
    ///
    /// ```text
    /// depth := ε | N | N '..' M | '..' M | N '..'
    /// ```
    fn parse_depth(&mut self) -> Result<CypherDepth, CypherError> {
        // After `*`, we may see:
        //   nothing        => Unbounded
        //   N              => Exact(N) or start of Range
        //   ..M            => Max(M)
        //   N..            => Min(N)
        //   N..M           => Range{min, max}

        if self.at(TokenKind::DotDot) {
            // `*..M`
            self.advance();
            let max = self.parse_usize("expected integer after '..'")?;
            return Ok(CypherDepth::Max(max));
        }

        if self.at(TokenKind::IntegerLiteral) {
            let n = self.parse_usize("expected integer for depth")?;
            if self.eat(TokenKind::DotDot) {
                // `*N..` or `*N..M`
                if self.at(TokenKind::IntegerLiteral) {
                    let m = self.parse_usize("expected integer after '..'")?;
                    Ok(CypherDepth::Range { min: n, max: m })
                } else {
                    Ok(CypherDepth::Min(n))
                }
            } else {
                Ok(CypherDepth::Exact(n))
            }
        } else {
            // Bare `*` with no number or `..` following.
            Ok(CypherDepth::Unbounded)
        }
    }

    /// Parse `{key: value, ...}` property map.
    fn parse_properties(&mut self) -> Result<Vec<(String, CypherValue)>, CypherError> {
        self.expect(TokenKind::LBrace)?;
        let mut props = Vec::new();

        if !self.at(TokenKind::RBrace) {
            loop {
                let key = self.expect(TokenKind::Identifier)?;
                self.expect(TokenKind::Colon)?;
                let value = self.parse_value()?;
                props.push((key.text, value));
                if !self.eat(TokenKind::Comma) {
                    break;
                }
            }
        }

        self.expect(TokenKind::RBrace)?;
        Ok(props)
    }

    // -- WHERE / expressions ------------------------------------------------

    /// ```text
    /// where_clause := WHERE expr
    /// ```
    fn parse_where(&mut self) -> Result<CypherExpr, CypherError> {
        self.expect(TokenKind::Where)?;
        self.parse_expression()
    }

    /// Entry point for expression parsing.
    ///
    /// ```text
    /// expr := or_expr
    /// ```
    fn parse_expression(&mut self) -> Result<CypherExpr, CypherError> {
        self.parse_or_expr()
    }

    /// ```text
    /// or_expr := and_expr (OR and_expr)*
    /// ```
    fn parse_or_expr(&mut self) -> Result<CypherExpr, CypherError> {
        let mut left = self.parse_and_expr()?;
        while self.eat(TokenKind::Or) {
            let right = self.parse_and_expr()?;
            left = CypherExpr::Or(Box::new(left), Box::new(right));
        }
        Ok(left)
    }

    /// ```text
    /// and_expr := not_expr (AND not_expr)*
    /// ```
    fn parse_and_expr(&mut self) -> Result<CypherExpr, CypherError> {
        let mut left = self.parse_not_expr()?;
        while self.eat(TokenKind::And) {
            let right = self.parse_not_expr()?;
            left = CypherExpr::And(Box::new(left), Box::new(right));
        }
        Ok(left)
    }

    /// ```text
    /// not_expr := NOT not_expr | comparison
    /// ```
    fn parse_not_expr(&mut self) -> Result<CypherExpr, CypherError> {
        if self.eat(TokenKind::Not) {
            let inner = self.parse_not_expr()?;
            Ok(CypherExpr::Not(Box::new(inner)))
        } else {
            self.parse_comparison()
        }
    }

    /// ```text
    /// comparison := primary (comp_op primary | IS [NOT] NULL | IN '[' expr_list ']'
    ///            | CONTAINS string | STARTS WITH string | ENDS WITH string)?
    /// ```
    fn parse_comparison(&mut self) -> Result<CypherExpr, CypherError> {
        let left = self.parse_primary_expr()?;

        // Standard comparison operators
        let op = match self.peek().kind {
            TokenKind::Eq => Some(CypherCompOp::Eq),
            TokenKind::Ne => Some(CypherCompOp::Ne),
            TokenKind::Lt => Some(CypherCompOp::Lt),
            TokenKind::Le => Some(CypherCompOp::Le),
            TokenKind::Gt => Some(CypherCompOp::Gt),
            TokenKind::Ge => Some(CypherCompOp::Ge),
            _ => None,
        };

        if let Some(op) = op {
            self.advance();
            let right = self.parse_primary_expr()?;
            return Ok(CypherExpr::Comparison {
                left: Box::new(left),
                op,
                right: Box::new(right),
            });
        }

        // IS NULL / IS NOT NULL
        if self.at(TokenKind::Is) {
            self.advance();
            if self.eat(TokenKind::Not) {
                self.expect(TokenKind::Null)?;
                return Ok(CypherExpr::IsNotNull(Box::new(left)));
            }
            self.expect(TokenKind::Null)?;
            return Ok(CypherExpr::IsNull(Box::new(left)));
        }

        // IN [values]
        if self.at(TokenKind::In) {
            self.advance();
            self.expect(TokenKind::LBracket)?;
            let mut values = vec![];
            if !self.at(TokenKind::RBracket) {
                values.push(self.parse_expression()?);
                while self.eat(TokenKind::Comma) {
                    values.push(self.parse_expression()?);
                }
            }
            self.expect(TokenKind::RBracket)?;
            return Ok(CypherExpr::In {
                expr: Box::new(left),
                values,
            });
        }

        // CONTAINS string
        if self.at(TokenKind::Contains) {
            self.advance();
            let right = self.parse_primary_expr()?;
            if let CypherExpr::Value(CypherValue::String(s)) = right {
                return Ok(CypherExpr::Contains {
                    expr: Box::new(left),
                    substring: s,
                });
            }
            return Err(self.error("CONTAINS requires a string argument"));
        }

        // STARTS WITH string
        if self.at(TokenKind::StartsWith) {
            self.advance(); // consume STARTS
            self.expect(TokenKind::With)?; // consume WITH
            let right = self.parse_primary_expr()?;
            if let CypherExpr::Value(CypherValue::String(s)) = right {
                return Ok(CypherExpr::StartsWith {
                    expr: Box::new(left),
                    prefix: s,
                });
            }
            return Err(self.error("STARTS WITH requires a string argument"));
        }

        // ENDS WITH string
        if self.at(TokenKind::EndsWith) {
            self.advance(); // consume ENDS
            self.expect(TokenKind::With)?; // consume WITH
            let right = self.parse_primary_expr()?;
            if let CypherExpr::Value(CypherValue::String(s)) = right {
                return Ok(CypherExpr::EndsWith {
                    expr: Box::new(left),
                    suffix: s,
                });
            }
            return Err(self.error("ENDS WITH requires a string argument"));
        }

        Ok(left)
    }

    /// ```text
    /// primary := value | var '.' prop | '(' expr ')' | func_call | var
    /// ```
    fn parse_primary_expr(&mut self) -> Result<CypherExpr, CypherError> {
        match self.peek().kind.clone() {
            // Parenthesized sub-expression
            TokenKind::LParen => {
                self.advance();
                let inner = self.parse_expression()?;
                self.expect(TokenKind::RParen)?;
                Ok(CypherExpr::Grouped(Box::new(inner)))
            }

            // Identifier: could be variable, property access, dot-qualified function call,
            // or simple function call
            TokenKind::Identifier => {
                let name_tok = self.advance().clone();
                let name = name_tok.text;

                if self.at(TokenKind::Dot) {
                    // Could be property access: var.prop
                    // Or dot-qualified function call: namespace.func(args...)
                    self.advance(); // consume '.'
                    let next_tok = self.expect(TokenKind::Identifier)?;

                    if self.at(TokenKind::LParen) {
                        // Dot-qualified function call: namespace.func(args...)
                        // e.g., vector.similarity(d.embedding, $query)
                        self.advance(); // consume '('
                        let args = self.parse_function_args()?;
                        self.expect(TokenKind::RParen)?;
                        let qualified_name = format!("{name}.{}", next_tok.text);
                        Ok(CypherExpr::FunctionCall {
                            name: qualified_name,
                            args,
                        })
                    } else {
                        // Property access: var.prop
                        Ok(CypherExpr::Property {
                            variable: name,
                            property: next_tok.text,
                        })
                    }
                } else if self.at(TokenKind::LParen) {
                    // Function call: name(args...)
                    self.advance();
                    let args = self.parse_function_args()?;
                    self.expect(TokenKind::RParen)?;
                    Ok(CypherExpr::FunctionCall { name, args })
                } else {
                    // Bare variable
                    Ok(CypherExpr::Variable(name))
                }
            }

            // Aggregation functions (COUNT, AVG, etc.) that are keywords, not identifiers
            TokenKind::Count
            | TokenKind::Collect
            | TokenKind::Avg
            | TokenKind::Sum
            | TokenKind::Min
            | TokenKind::Max => {
                let name_tok = self.advance().clone();
                let name = name_tok.text.to_uppercase();
                self.expect(TokenKind::LParen)?;
                let args = self.parse_function_args()?;
                self.expect(TokenKind::RParen)?;
                Ok(CypherExpr::FunctionCall { name, args })
            }

            // Literal values
            TokenKind::IntegerLiteral
            | TokenKind::FloatLiteral
            | TokenKind::StringLiteral
            | TokenKind::True
            | TokenKind::False
            | TokenKind::Null
            | TokenKind::Parameter => {
                let val = self.parse_value()?;
                Ok(CypherExpr::Value(val))
            }

            _ => Err(self.error(&format!(
                "expected expression, found {:?}",
                self.peek().kind
            ))),
        }
    }

    /// Parse comma-separated function arguments (may be empty).
    fn parse_function_args(&mut self) -> Result<Vec<CypherExpr>, CypherError> {
        let mut args = Vec::new();
        if !self.at(TokenKind::RParen) {
            args.push(self.parse_expression()?);
            while self.eat(TokenKind::Comma) {
                args.push(self.parse_expression()?);
            }
        }
        Ok(args)
    }

    // -- WITH clause --------------------------------------------------------

    /// Parse zero or more `WITH` clauses.
    ///
    /// ```text
    /// with_clauses := (WITH return_items [WHERE expr])*
    /// ```
    fn parse_with_clauses(&mut self) -> Result<Vec<CypherWith>, CypherError> {
        let mut clauses = Vec::new();
        while self.at(TokenKind::With) {
            clauses.push(self.parse_with()?);
        }
        Ok(clauses)
    }

    /// Parse a single `WITH` clause.
    ///
    /// ```text
    /// with_clause := WITH return_items [WHERE expr]
    /// ```
    fn parse_with(&mut self) -> Result<CypherWith, CypherError> {
        self.expect(TokenKind::With)?;

        let items = self.parse_return_items()?;

        let where_clause = if self.at(TokenKind::Where) {
            Some(self.parse_where()?)
        } else {
            None
        };

        Ok(CypherWith {
            items,
            where_clause,
        })
    }

    // -- RETURN clause ------------------------------------------------------

    /// ```text
    /// return_clause := RETURN [DISTINCT] return_items [order_by] [SKIP n] [LIMIT n]
    /// ```
    fn parse_return(&mut self) -> Result<CypherReturn, CypherError> {
        self.expect(TokenKind::Return)?;

        let distinct = self.eat(TokenKind::Distinct);

        let items = self.parse_return_items()?;

        let order_by = if self.at(TokenKind::Order) {
            self.parse_order_by()?
        } else {
            Vec::new()
        };

        let skip = if self.eat(TokenKind::Skip) {
            Some(self.parse_usize("expected integer after SKIP")?)
        } else {
            None
        };

        let limit = if self.eat(TokenKind::Limit) {
            Some(self.parse_usize("expected integer after LIMIT")?)
        } else {
            None
        };

        Ok(CypherReturn {
            distinct,
            items,
            order_by,
            skip,
            limit,
        })
    }

    /// ```text
    /// return_items := '*' | return_item (',' return_item)*
    /// ```
    fn parse_return_items(&mut self) -> Result<Vec<CypherReturnItem>, CypherError> {
        if self.eat(TokenKind::Star) {
            return Ok(vec![CypherReturnItem::Star]);
        }

        let mut items = vec![self.parse_return_item()?];
        while self.eat(TokenKind::Comma) {
            items.push(self.parse_return_item()?);
        }
        Ok(items)
    }

    /// ```text
    /// return_item := expr [AS identifier]
    /// ```
    fn parse_return_item(&mut self) -> Result<CypherReturnItem, CypherError> {
        let expr = self.parse_expression()?;

        let alias = if self.eat(TokenKind::As) {
            let alias_tok = self.expect(TokenKind::Identifier)?;
            Some(alias_tok.text)
        } else {
            None
        };

        Ok(CypherReturnItem::Expression { expr, alias })
    }

    /// ```text
    /// order_by := ORDER BY order_item (',' order_item)*
    /// ```
    fn parse_order_by(&mut self) -> Result<Vec<CypherOrderItem>, CypherError> {
        self.expect(TokenKind::Order)?;
        self.expect(TokenKind::By)?;

        let mut items = vec![self.parse_order_item()?];
        while self.eat(TokenKind::Comma) {
            items.push(self.parse_order_item()?);
        }
        Ok(items)
    }

    /// ```text
    /// order_item := expr [ASC | DESC]
    /// ```
    fn parse_order_item(&mut self) -> Result<CypherOrderItem, CypherError> {
        let expr = self.parse_expression()?;

        let descending = if self.eat(TokenKind::Desc) {
            true
        } else {
            self.eat(TokenKind::Asc);
            false
        };

        Ok(CypherOrderItem { expr, descending })
    }

    // -- Values -------------------------------------------------------------

    /// Parse a single literal value or parameter.
    fn parse_value(&mut self) -> Result<CypherValue, CypherError> {
        match self.peek().kind.clone() {
            TokenKind::IntegerLiteral => {
                let tok = self.advance().clone();
                let n: i64 = tok
                    .text
                    .parse()
                    .map_err(|_| self.error("invalid integer literal"))?;
                Ok(CypherValue::Int(n))
            }
            TokenKind::FloatLiteral => {
                let tok = self.advance().clone();
                let f: f64 = tok
                    .text
                    .parse()
                    .map_err(|_| self.error("invalid float literal"))?;
                Ok(CypherValue::Float(f))
            }
            TokenKind::StringLiteral => {
                let tok = self.advance().clone();
                Ok(CypherValue::String(tok.text))
            }
            TokenKind::True => {
                self.advance();
                Ok(CypherValue::Bool(true))
            }
            TokenKind::False => {
                self.advance();
                Ok(CypherValue::Bool(false))
            }
            TokenKind::Null => {
                self.advance();
                Ok(CypherValue::Null)
            }
            TokenKind::Parameter => {
                let tok = self.advance().clone();
                Ok(CypherValue::Parameter(tok.text))
            }
            _ => Err(self.error(&format!("expected value, found {:?}", self.peek().kind))),
        }
    }

    // -- Temporal -----------------------------------------------------------

    /// Try to parse a leading temporal clause. Returns `None` if the next token
    /// is not the start of a temporal clause.
    ///
    /// Supported forms:
    /// - `AS OF TIMESTAMP '...'`
    /// - `FOR VALID_TIME AS OF '...'`
    /// - `FOR SYSTEM_TIME AS OF '...'`
    /// - `BETWEEN '...' AND '...'`
    fn try_parse_temporal(&mut self) -> Result<Option<CypherTemporal>, CypherError> {
        match self.peek().kind {
            TokenKind::As => {
                // AS OF TIMESTAMP '...'
                self.advance(); // AS
                self.expect(TokenKind::Of)?;
                self.expect(TokenKind::Timestamp)?;
                let ts_tok = self.expect(TokenKind::StringLiteral)?;
                Ok(Some(CypherTemporal::AsOfTimestamp(ts_tok.text)))
            }
            TokenKind::For => {
                // FOR VALID_TIME/SYSTEM_TIME AS OF '...'
                self.advance(); // FOR
                match self.peek().kind {
                    TokenKind::ValidTime => {
                        self.advance();
                        self.expect(TokenKind::As)?;
                        self.expect(TokenKind::Of)?;
                        let ts_tok = self.expect(TokenKind::StringLiteral)?;
                        Ok(Some(CypherTemporal::AsOfValidTime(ts_tok.text)))
                    }
                    TokenKind::SystemTime => {
                        self.advance();
                        self.expect(TokenKind::As)?;
                        self.expect(TokenKind::Of)?;
                        let ts_tok = self.expect(TokenKind::StringLiteral)?;
                        Ok(Some(CypherTemporal::AsOfSystemTime(ts_tok.text)))
                    }
                    _ => Err(self.error("expected VALID_TIME or SYSTEM_TIME after FOR")),
                }
            }
            TokenKind::Between => {
                // BETWEEN '...' AND '...'
                self.advance(); // BETWEEN
                let start_tok = self.expect(TokenKind::StringLiteral)?;
                self.expect(TokenKind::And)?;
                let end_tok = self.expect(TokenKind::StringLiteral)?;
                Ok(Some(CypherTemporal::Between {
                    start: start_tok.text,
                    end: end_tok.text,
                }))
            }
            _ => Ok(None),
        }
    }

    // -- Post-pattern temporal -----------------------------------------------

    /// Try to parse a temporal clause that appears after the pattern/WHERE
    /// but before RETURN. Returns `None` if the next token is not the start
    /// of a temporal clause.
    ///
    /// Supported forms (post-pattern position):
    /// - `AS OF TIMESTAMP '...'`
    /// - `AS OF VALID_TIME '...'`
    /// - `AS OF SYSTEM_TIME '...'`
    /// - `AS OF VALID_TIME '...' AS OF SYSTEM_TIME '...'`
    /// - `FOR SYSTEM_TIME AS OF '...'`
    /// - `BETWEEN '...' AND '...'`
    fn try_parse_post_pattern_temporal(&mut self) -> Result<Option<CypherTemporal>, CypherError> {
        match self.peek().kind {
            TokenKind::As => {
                self.advance(); // AS
                self.expect(TokenKind::Of)?;

                match self.peek().kind {
                    TokenKind::Timestamp => {
                        // AS OF TIMESTAMP '...'
                        self.advance();
                        let ts_tok = self.expect(TokenKind::StringLiteral)?;
                        Ok(Some(CypherTemporal::AsOfTimestamp(ts_tok.text)))
                    }
                    TokenKind::ValidTime => {
                        // AS OF VALID_TIME '...' [AS OF SYSTEM_TIME '...']
                        self.advance();
                        let vt_tok = self.expect(TokenKind::StringLiteral)?;

                        // Check for bi-temporal: AS OF SYSTEM_TIME '...'
                        if self.at(TokenKind::As) {
                            let saved_pos = self.pos;
                            self.advance(); // AS
                            if self.at(TokenKind::Of) {
                                self.advance(); // OF
                                if self.at(TokenKind::SystemTime) {
                                    self.advance(); // SYSTEM_TIME
                                    let st_tok = self.expect(TokenKind::StringLiteral)?;
                                    return Ok(Some(CypherTemporal::BiTemporal {
                                        valid_time: vt_tok.text,
                                        system_time: st_tok.text,
                                    }));
                                }
                                // Not SYSTEM_TIME -- backtrack
                                self.pos = saved_pos;
                            } else {
                                // Not OF -- backtrack
                                self.pos = saved_pos;
                            }
                        }

                        Ok(Some(CypherTemporal::AsOfValidTime(vt_tok.text)))
                    }
                    TokenKind::SystemTime => {
                        // AS OF SYSTEM_TIME '...'
                        self.advance();
                        let ts_tok = self.expect(TokenKind::StringLiteral)?;
                        Ok(Some(CypherTemporal::AsOfSystemTime(ts_tok.text)))
                    }
                    _ => {
                        Err(self
                            .error("expected TIMESTAMP, VALID_TIME, or SYSTEM_TIME after AS OF"))
                    }
                }
            }
            TokenKind::For => {
                self.advance(); // FOR
                if self.at(TokenKind::SystemTime) {
                    // FOR SYSTEM_TIME AS OF '...'
                    self.advance(); // SYSTEM_TIME
                    self.expect(TokenKind::As)?;
                    self.expect(TokenKind::Of)?;
                    let ts_tok = self.expect(TokenKind::StringLiteral)?;
                    Ok(Some(CypherTemporal::AsOfSystemTime(ts_tok.text)))
                } else if self.at(TokenKind::ValidTime) {
                    // FOR VALID_TIME AS OF '...'
                    self.advance(); // VALID_TIME
                    self.expect(TokenKind::As)?;
                    self.expect(TokenKind::Of)?;
                    let ts_tok = self.expect(TokenKind::StringLiteral)?;
                    Ok(Some(CypherTemporal::AsOfValidTime(ts_tok.text)))
                } else {
                    Err(self.error("expected SYSTEM_TIME or VALID_TIME after FOR"))
                }
            }
            TokenKind::Between => {
                self.advance(); // BETWEEN
                let start_tok = self.expect(TokenKind::StringLiteral)?;
                self.expect(TokenKind::And)?;
                let end_tok = self.expect(TokenKind::StringLiteral)?;
                Ok(Some(CypherTemporal::Between {
                    start: start_tok.text,
                    end: end_tok.text,
                }))
            }
            _ => Ok(None),
        }
    }

    // -- Numeric helpers ----------------------------------------------------

    /// Parse the current token as a `usize`.
    fn parse_usize(&mut self, msg: &str) -> Result<usize, CypherError> {
        let tok = self.expect(TokenKind::IntegerLiteral)?;
        tok.text
            .parse::<usize>()
            .map_err(|_| self.error(&format!("{msg}: '{}'", tok.text)))
    }
}