ruchy 4.1.1

A systems scripting language that transpiles to idiomatic Rust with extreme quality engineering
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
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
//! Error recovery parser for better error messages and IDE support
#![allow(clippy::items_after_statements)] // Recovery parser needs constants in local scopes
use crate::frontend::ast::{
    BinaryOp, Expr, ExprKind, Literal, Param, Pattern, Span, Type, TypeKind,
};
use crate::frontend::lexer::{Token, TokenStream};
use anyhow::Result;
use std::fmt;
/// Parse error with recovery information
#[derive(Debug, Clone)]
pub struct ParseError {
    pub message: String,
    pub span: Span,
    pub recovery_hint: Option<String>,
    pub expected: Vec<Token>,
    pub found: Option<Token>,
    pub severity: ErrorSeverity,
    pub error_code: ErrorCode,
    pub context: Vec<String>, // Stack of parsing contexts for better error messages
}
/// Error severity levels
#[derive(Debug, Clone, PartialEq)]
pub enum ErrorSeverity {
    Error,
    Warning,
    Info,
    Hint,
}
/// Error codes for categorizing different types of errors
#[derive(Debug, Clone, PartialEq)]
pub enum ErrorCode {
    // Syntax errors
    UnexpectedToken,
    MissingToken,
    InvalidSyntax,
    // Type errors
    TypeMismatch,
    UndefinedVariable,
    DuplicateDefinition,
    // Pattern matching errors
    UnreachablePattern,
    NonExhaustivePattern,
    // Import/module errors
    ModuleNotFound,
    SymbolNotFound,
    CircularImport,
    // General errors
    InvalidOperation,
    InternalError,
}
impl fmt::Display for ParseError {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        // Write severity and error code
        write!(f, "[{:?}:{:?}] ", self.severity, self.error_code)?;
        // Write context if available
        if !self.context.is_empty() {
            write!(f, "In {}: ", self.context.join(" -> "))?;
        }
        // Write main message
        write!(f, "{}", self.message)?;
        // Write location info
        write!(
            f,
            " at line {}, column {}",
            self.span.start + 1, // Convert to 1-based indexing for user display
            self.span.end - self.span.start + 1
        )?;
        // Write expected vs found tokens if available
        if !self.expected.is_empty() {
            write!(f, " (expected: {:?}", self.expected)?;
            if let Some(ref found) = self.found {
                write!(f, ", found: {found:?}")?;
            }
            write!(f, ")")?;
        }
        // Write recovery hint
        if let Some(ref hint) = self.recovery_hint {
            write!(f, "\n  💡 Hint: {hint}")?;
        }
        Ok(())
    }
}
impl std::error::Error for ParseError {}
impl ParseError {
    /// Create a new parse error with basic information
    pub fn new(message: String, span: Span) -> Self {
        Self {
            message,
            span,
            recovery_hint: None,
            expected: Vec::new(),
            found: None,
            severity: ErrorSeverity::Error,
            error_code: ErrorCode::InvalidSyntax,
            context: Vec::new(),
        }
    }
    /// Create an error for unexpected token
    pub fn unexpected_token(expected: Vec<Token>, found: Token, span: Span) -> Self {
        let message = format!("Unexpected token '{found:?}'");
        Self {
            message,
            span,
            recovery_hint: Some(
                "Check for missing operators, parentheses, or semicolons".to_string(),
            ),
            expected,
            found: Some(found),
            severity: ErrorSeverity::Error,
            error_code: ErrorCode::UnexpectedToken,
            context: Vec::new(),
        }
    }
    /// Create an error for missing token
    pub fn missing_token(expected: Token, span: Span) -> Self {
        let message = format!("Missing '{expected:?}'");
        Self {
            message,
            span,
            recovery_hint: Some(format!("Insert '{expected:?}' here")),
            expected: vec![expected],
            found: None,
            severity: ErrorSeverity::Error,
            error_code: ErrorCode::MissingToken,
            context: Vec::new(),
        }
    }
    /// Add parsing context to the error
    #[must_use]
    pub fn with_context(mut self, context: String) -> Self {
        self.context.push(context);
        self
    }
    /// Add recovery hint
    #[must_use]
    pub fn with_hint(mut self, hint: String) -> Self {
        self.recovery_hint = Some(hint);
        self
    }
    /// Set severity level
    #[must_use]
    pub fn with_severity(mut self, severity: ErrorSeverity) -> Self {
        self.severity = severity;
        self
    }
    /// Set error code
    #[must_use]
    pub fn with_code(mut self, code: ErrorCode) -> Self {
        self.error_code = code;
        self
    }
}
/// Result of parsing with error recovery
#[derive(Debug)]
pub struct ParseResult {
    pub ast: Option<Expr>,
    pub errors: Vec<ParseError>,
    pub partial_ast: bool,
}
/// Parser with error recovery capabilities
pub struct RecoveryParser<'a> {
    tokens: TokenStream<'a>,
    errors: Vec<ParseError>,
    recovery_mode: bool,
    ghost_node_count: usize,
    recursion_depth: usize,
}
impl<'a> RecoveryParser<'a> {
    #[must_use]
    pub fn new(input: &'a str) -> Self {
        Self {
            tokens: TokenStream::new(input),
            errors: Vec::new(),
            recovery_mode: false,
            ghost_node_count: 0,
            recursion_depth: 0,
        }
    }
    /// Parse with error recovery, always producing some AST
    pub fn parse_with_recovery(&mut self) -> ParseResult {
        match self.parse_expr_recovery() {
            Ok(ast) => ParseResult {
                ast: Some(ast),
                errors: self.errors.clone(),
                partial_ast: !self.errors.is_empty(),
            },
            Err(_) if !self.errors.is_empty() => {
                // We have errors but can produce a partial AST
                let ghost = self.create_ghost_node("Failed to parse expression");
                ParseResult {
                    ast: Some(ghost),
                    errors: self.errors.clone(),
                    partial_ast: true,
                }
            }
            Err(e) => {
                // Fatal error, no recovery possible
                self.errors.push(
                    ParseError::new(e.to_string(), Span::new(0, 0))
                        .with_code(ErrorCode::InternalError),
                );
                ParseResult {
                    ast: None,
                    errors: self.errors.clone(),
                    partial_ast: false,
                }
            }
        }
    }
    fn parse_expr_recovery(&mut self) -> Result<Expr> {
        self.parse_expr_with_precedence_recovery(0)
    }
    fn parse_expr_with_precedence_recovery(&mut self, min_prec: i32) -> Result<Expr> {
        let mut left = self.parse_prefix_recovery()?;
        const MAX_ITERATIONS: usize = 1000; // Prevent infinite loops
        let mut iteration_count = 0;
        loop {
            iteration_count += 1;
            if iteration_count > MAX_ITERATIONS {
                self.record_error(
                    "Expression too complex or malformed".to_string(),
                    Some("Simplify the expression".to_string()),
                );
                break;
            }
            let Some((token, _)) = self.tokens.peek() else {
                break;
            };
            if !token.is_binary_op() {
                break;
            }
            let token_clone = token.clone();
            let prec = Self::precedence(&token_clone);
            if prec < min_prec {
                break;
            }
            match self.tokens.advance() {
                Some((op_token, _op_span)) => {
                    let op = match Self::token_to_binary_op(&op_token) {
                        Ok(op) => op,
                        Err(e) => {
                            self.record_error(format!("Invalid operator: {e}"), None);
                            // Skip the invalid operator and continue
                            continue;
                        }
                    };
                    let right = if let Ok(expr) = self.parse_expr_with_precedence_recovery(prec + 1)
                    {
                        expr
                    } else {
                        // Create ghost node for missing right operand
                        let ghost = self.create_ghost_node("Missing right operand");
                        self.record_error(
                            format!("Expected expression after '{op_token:?}'"),
                            Some("Add the right side of the operation".to_string()),
                        );
                        ghost
                    };
                    let span = left.span.merge(right.span);
                    left = Expr::new(
                        ExprKind::Binary {
                            left: Box::new(left),
                            op,
                            right: Box::new(right),
                        },
                        span,
                    );
                }
                None => break,
            }
        }
        Ok(left)
    }
    fn parse_prefix_recovery(&mut self) -> Result<Expr> {
        const MAX_RECURSION_DEPTH: usize = 100;
        self.recursion_depth += 1;
        if self.recursion_depth > MAX_RECURSION_DEPTH {
            self.recursion_depth -= 1;
            self.record_error(
                "Expression too deeply nested".to_string(),
                Some("Simplify the expression".to_string()),
            );
            return Ok(self.create_ghost_node("Max recursion depth"));
        }
        let result = match self.tokens.peek() {
            Some((Token::Integer(n_str), span)) => {
                let n_str = n_str.clone();
                let span = *span;
                self.tokens.advance();
                // Parse integer value and optional type suffix
                let (num_part, type_suffix) =
                    if let Some(pos) = n_str.find(|c: char| c.is_alphabetic()) {
                        (&n_str[..pos], Some(n_str[pos..].to_string()))
                    } else {
                        (n_str.as_str(), None)
                    };
                let value = num_part.parse::<i64>().map_err(|_| {
                    ParseError::new(format!("Invalid integer literal: {num_part}"), span)
                })?;
                Ok(Expr::new(
                    ExprKind::Literal(Literal::Integer(value, type_suffix)),
                    span,
                ))
            }
            Some((Token::Float(f), span)) => {
                let f = *f;
                let span = *span;
                self.tokens.advance();
                Ok(Expr::new(ExprKind::Literal(Literal::Float(f)), span))
            }
            Some((Token::String(s) | Token::RawString(s), span)) => {
                let s = s.clone();
                let span = *span;
                self.tokens.advance();
                Ok(Expr::new(ExprKind::Literal(Literal::String(s)), span))
            }
            Some((Token::Bool(b), span)) => {
                let b = *b;
                let span = *span;
                self.tokens.advance();
                Ok(Expr::new(ExprKind::Literal(Literal::Bool(b)), span))
            }
            Some((Token::Identifier(name), span)) => {
                let name = name.clone();
                let span = *span;
                self.tokens.advance();
                Ok(Expr::new(ExprKind::Identifier(name), span))
            }
            Some((Token::If, _)) => Ok(self.parse_if_recovery()),
            Some((Token::Let, _)) => Ok(self.parse_let_recovery()),
            Some((Token::Fun, _)) => Ok(self.parse_function_recovery()),
            Some((Token::LeftBracket, _)) => Ok(self.parse_list_recovery()),
            Some((Token::LeftParen, _)) => self.parse_paren_recovery(),
            Some((token, _span)) => {
                let token_clone = token.clone();
                // Special handling for binary operators in prefix position
                if token.is_binary_op() {
                    self.tokens.advance(); // Consume the misplaced operator
                    self.record_error(
                        format!("Unexpected operator: {token_clone:?}"),
                        Some("An expression was expected here, not an operator".to_string()),
                    );
                    // Don't recurse infinitely - return a ghost node
                    return Ok(self.create_ghost_node("Misplaced operator"));
                }
                self.tokens.advance(); // Advance before recording error
                self.record_error(
                    format!("Unexpected token: {token_clone:?}"),
                    Some("Expected an expression".to_string()),
                );
                // Try to recover
                self.synchronize();
                Ok(self.create_ghost_node("Unexpected token"))
            }
            None => {
                self.record_error(
                    "Unexpected end of input".to_string(),
                    Some("Add more code to complete the expression".to_string()),
                );
                Ok(self.create_ghost_node("Unexpected EOF"))
            }
        };
        self.recursion_depth -= 1;
        result
    }
    fn parse_if_recovery(&mut self) -> Expr {
        let start_span = self.expect_or_recover(&Token::If);
        let condition = if let Ok(expr) = self.parse_expr_recovery() {
            Box::new(expr)
        } else {
            self.record_error(
                "Missing condition in if expression".to_string(),
                Some("Add a condition after 'if'".to_string()),
            );
            Box::new(self.create_ghost_node("Missing condition"))
        };
        let _ = self.expect_or_recover(&Token::LeftBrace);
        let then_branch = Box::new(self.parse_block_recovery());
        let else_branch = if matches!(self.tokens.peek(), Some((Token::Else, _))) {
            self.tokens.advance();
            let _ = self.expect_or_recover(&Token::LeftBrace);
            Some(Box::new(self.parse_block_recovery()))
        } else {
            None
        };
        let span = if let Some(ref else_br) = else_branch {
            start_span.merge(else_br.span)
        } else {
            start_span.merge(then_branch.span)
        };
        Expr::new(
            ExprKind::If {
                condition,
                then_branch,
                else_branch,
            },
            span,
        )
    }
    fn parse_let_recovery(&mut self) -> Expr {
        let start_span = self.expect_or_recover(&Token::Let);
        let name = if let Some((Token::Identifier(name), _)) = self.tokens.advance() {
            name
        } else {
            self.record_error(
                "Expected identifier after 'let'".to_string(),
                Some("Add a variable name".to_string()),
            );
            format!("_ghost_{}", self.ghost_node_count)
        };
        let _ = self.expect_or_recover(&Token::Equal);
        let value = if let Ok(expr) = self.parse_expr_recovery() {
            Box::new(expr)
        } else {
            self.record_error(
                "Missing value in let binding".to_string(),
                Some("Add a value after '='".to_string()),
            );
            Box::new(self.create_ghost_node("Missing value"))
        };
        let body = if matches!(self.tokens.peek(), Some((Token::In, _))) {
            self.tokens.advance();
            match self.parse_expr_recovery() {
                Ok(expr) => Box::new(expr),
                Err(_) => Box::new(self.create_ghost_node("Missing body")),
            }
        } else {
            Box::new(Expr::new(ExprKind::Literal(Literal::Unit), value.span))
        };
        let span = start_span.merge(body.span);
        Expr::new(
            ExprKind::Let {
                name,
                type_annotation: None,
                value,
                body,
                is_mutable: false,
                else_block: None, // Error recovery doesn't support let-else
            },
            span,
        )
    }
    fn parse_function_recovery(&mut self) -> Expr {
        let start_span = self.expect_or_recover(&Token::Fun);
        let name = if let Some((Token::Identifier(name), _)) = self.tokens.advance() {
            name
        } else {
            self.record_error(
                "Expected function name".to_string(),
                Some("Add a function name after 'fun'".to_string()),
            );
            format!("_ghost_fn_{}", self.ghost_node_count)
        };
        let _ = self.expect_or_recover(&Token::LeftParen);
        let params = self.parse_params_recovery();
        let _ = self.expect_or_recover(&Token::RightParen);
        let return_type = if matches!(self.tokens.peek(), Some((Token::Arrow, _))) {
            self.tokens.advance();
            Some(self.parse_type_recovery())
        } else {
            None
        };
        let _ = self.expect_or_recover(&Token::LeftBrace);
        let body = Box::new(self.parse_block_recovery());
        let span = start_span.merge(body.span);
        Expr::new(
            ExprKind::Function {
                name,
                type_params: vec![],
                params,
                return_type,
                body,
                is_async: false,
                is_pub: false,
            },
            span,
        )
    }
    fn parse_block_recovery(&mut self) -> Expr {
        let mut exprs = Vec::new();
        let start_span = self
            .tokens
            .peek()
            .map_or(Span::new(0, 0), |(_, span)| *span);
        while !matches!(self.tokens.peek(), Some((Token::RightBrace, _)) | None) {
            if let Ok(expr) = self.parse_expr_recovery() {
                exprs.push(expr);
            } else {
                // Try to recover by finding next statement
                self.synchronize();
                if self.recovery_mode {
                    exprs.push(self.create_ghost_node("Recovery statement"));
                }
            }
            // Optional semicolon
            if matches!(self.tokens.peek(), Some((Token::Semicolon, _))) {
                self.tokens.advance();
            }
        }
        let _ = self.expect_or_recover(&Token::RightBrace);
        let span = if let Some(last) = exprs.last() {
            start_span.merge(last.span)
        } else {
            start_span
        };
        Expr::new(ExprKind::Block(exprs), span)
    }
    fn parse_list_recovery(&mut self) -> Expr {
        let start_span = self.expect_or_recover(&Token::LeftBracket);
        let mut elements = Vec::new();
        while !matches!(self.tokens.peek(), Some((Token::RightBracket, _))) {
            match self.parse_expr_recovery() {
                Ok(expr) => elements.push(expr),
                Err(_) => {
                    self.synchronize_to(&[Token::Comma, Token::RightBracket]);
                }
            }
            if matches!(self.tokens.peek(), Some((Token::Comma, _))) {
                self.tokens.advance();
            } else {
                break;
            }
        }
        let end_span = self.expect_or_recover(&Token::RightBracket);
        let span = start_span.merge(end_span);
        Expr::new(ExprKind::List(elements), span)
    }
    fn parse_paren_recovery(&mut self) -> Result<Expr> {
        self.tokens.advance(); // consume (
        let expr = self.parse_expr_recovery()?;
        let _ = self.expect_or_recover(&Token::RightParen);
        Ok(expr)
    }
    fn parse_params_recovery(&mut self) -> Vec<Param> {
        let mut params = Vec::new();
        if matches!(self.tokens.peek(), Some((Token::RightParen, _))) {
            return params;
        }
        loop {
            let Some((Token::Identifier(name), name_span)) = self.tokens.advance() else {
                self.record_error(
                    "Expected parameter name".to_string(),
                    Some("Add a parameter name".to_string()),
                );
                self.synchronize_to(&[Token::Comma, Token::RightParen]);
                continue;
            };
            let ty = if matches!(self.tokens.peek(), Some((Token::Colon, _))) {
                self.tokens.advance();
                self.parse_type_recovery()
            } else {
                // Default to inferred type
                Type {
                    kind: TypeKind::Named("_".to_string()),
                    span: name_span,
                }
            };
            params.push(Param {
                pattern: Pattern::Identifier(name),
                ty,
                span: name_span,
                is_mutable: false,
                default_value: None,
            });
            match self.tokens.peek() {
                Some((Token::Comma, _)) => {
                    self.tokens.advance();
                }
                Some((Token::RightParen, _)) => break,
                _ => {
                    self.record_error("Expected ',' or ')' in parameter list".to_string(), None);
                    break;
                }
            }
        }
        params
    }
    fn parse_type_recovery(&mut self) -> Type {
        let (base_type, span) = if let Some((Token::Identifier(name), span)) = self.tokens.advance()
        {
            (TypeKind::Named(name), span)
        } else {
            self.record_error(
                "Expected type".to_string(),
                Some("Add a type annotation".to_string()),
            );
            (TypeKind::Named("_".to_string()), Span::new(0, 0))
        };
        let kind = if matches!(self.tokens.peek(), Some((Token::Question, _))) {
            self.tokens.advance();
            TypeKind::Optional(Box::new(Type {
                kind: base_type,
                span,
            }))
        } else {
            base_type
        };
        Type { kind, span }
    }
    /// Create a ghost node for error recovery
    fn create_ghost_node(&mut self, reason: &str) -> Expr {
        self.ghost_node_count += 1;
        Expr::new(
            ExprKind::Identifier(format!(
                "_ghost_{}_{}",
                self.ghost_node_count,
                reason.replace(' ', "_")
            )),
            Span::new(0, 0),
        )
    }
    /// Record an error for later reporting
    fn record_error(&mut self, message: String, hint: Option<String>) {
        let span = self.tokens.peek().map_or(Span::new(0, 0), |(_, s)| *s);
        let mut error = ParseError::new(message, span);
        if let Some(hint) = hint {
            error = error.with_hint(hint);
        }
        if let Some((found_token, _)) = self.tokens.peek() {
            error.found = Some(found_token.clone());
        }
        self.errors.push(error);
    }
    /// Expect a token or record error and try to recover
    fn expect_or_recover(&mut self, expected: &Token) -> Span {
        match self.tokens.peek() {
            Some((token, span)) if token == expected => {
                let span = *span;
                self.tokens.advance();
                span
            }
            _ => {
                self.record_error(
                    format!("Expected {expected:?}"),
                    Some(format!("Add '{expected:?}' here")),
                );
                self.recovery_mode = true;
                Span::new(0, 0)
            }
        }
    }
    /// Synchronize to a known recovery point
    fn synchronize(&mut self) {
        self.recovery_mode = true;
        // Synchronization tokens - statement boundaries
        let sync_tokens = [
            Token::Semicolon,
            Token::RightBrace,
            Token::Fun,
            Token::Let,
            Token::If,
            Token::For,
            Token::Match,
        ];
        let mut tokens_consumed = 0;
        const MAX_SYNC_TOKENS: usize = 100; // Prevent infinite loops
        while let Some((token, _)) = self.tokens.peek() {
            if tokens_consumed >= MAX_SYNC_TOKENS {
                // Force exit to prevent infinite loop
                break;
            }
            if sync_tokens.iter().any(|t| t == token) {
                if matches!(token, Token::Semicolon) {
                    self.tokens.advance(); // consume semicolon
                }
                break;
            }
            self.tokens.advance();
            tokens_consumed += 1;
        }
        self.recovery_mode = false;
    }
    /// Synchronize to specific tokens
    fn synchronize_to(&mut self, targets: &[Token]) {
        let mut tokens_consumed = 0;
        const MAX_SYNC_TOKENS: usize = 100; // Prevent infinite loops
        while let Some((token, _)) = self.tokens.peek() {
            if tokens_consumed >= MAX_SYNC_TOKENS {
                // Force exit to prevent infinite loop
                break;
            }
            if targets.iter().any(|t| t == token) {
                break;
            }
            self.tokens.advance();
            tokens_consumed += 1;
        }
    }
    fn precedence(token: &Token) -> i32 {
        match token {
            Token::OrOr => 1,
            Token::AndAnd => 2,
            Token::Pipe => 3,
            Token::Caret => 4,
            Token::Ampersand => 5,
            Token::EqualEqual | Token::NotEqual => 6,
            Token::Less | Token::LessEqual | Token::Greater | Token::GreaterEqual => 7,
            Token::LeftShift => 8,
            Token::Plus | Token::Minus => 9,
            Token::Star | Token::Slash | Token::Percent => 10,
            Token::Power => 11,
            _ => 0,
        }
    }
    fn token_to_binary_op(token: &Token) -> Result<BinaryOp> {
        Ok(match token {
            Token::Plus => BinaryOp::Add,
            Token::Minus => BinaryOp::Subtract,
            Token::Star => BinaryOp::Multiply,
            Token::Slash => BinaryOp::Divide,
            Token::Percent => BinaryOp::Modulo,
            Token::Power => BinaryOp::Power,
            Token::EqualEqual => BinaryOp::Equal,
            Token::NotEqual => BinaryOp::NotEqual,
            Token::Less => BinaryOp::Less,
            Token::LessEqual => BinaryOp::LessEqual,
            Token::Greater => BinaryOp::Greater,
            Token::GreaterEqual => BinaryOp::GreaterEqual,
            Token::AndAnd => BinaryOp::And,
            Token::OrOr => BinaryOp::Or,
            Token::Ampersand => BinaryOp::BitwiseAnd,
            Token::Pipe => BinaryOp::BitwiseOr,
            Token::Caret => BinaryOp::BitwiseXor,
            Token::LeftShift => BinaryOp::LeftShift,
            _ => anyhow::bail!("Not a binary operator: {token:?}"),
        })
    }
}
#[cfg(test)]
#[allow(clippy::unwrap_used)]
mod tests {
    use super::*;
    #[test]
    fn test_recovery_missing_operand() {
        let mut parser = RecoveryParser::new("1 +");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
        assert!(result.partial_ast);
    }
    #[test]
    fn test_recovery_missing_paren() {
        let mut parser = RecoveryParser::new("(1 + 2");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }
    #[test]
    fn test_recovery_invalid_token() {
        let mut parser = RecoveryParser::new("let x = @ + 1");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }
    #[test]
    fn test_recovery_incomplete_if() {
        let mut parser = RecoveryParser::new("if x > 0 { print(x)");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
        assert!(result.partial_ast);
    }
    #[test]
    fn test_recovery_missing_function_body() {
        let mut parser = RecoveryParser::new("fun foo(x: i32)");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }
    #[test]
    fn test_no_errors_on_valid_code() {
        let mut parser = RecoveryParser::new("1 + 2 * 3");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
        assert!(!result.partial_ast);
    }

    #[test]
    fn test_parse_error_creation() {
        let error = ParseError::new("Test error".to_string(), Span::new(0, 5));
        assert_eq!(error.message, "Test error");
        assert_eq!(error.span.start, 0);
        assert_eq!(error.span.end, 5);
        assert_eq!(error.severity, ErrorSeverity::Error);
        assert!(error.recovery_hint.is_none());
        assert!(error.expected.is_empty());
        assert!(error.found.is_none());
    }

    #[test]
    fn test_parse_error_with_fields() {
        let mut error = ParseError::new("Missing semicolon".to_string(), Span::new(10, 10));
        error.recovery_hint = Some("Add a semicolon at the end of the statement".to_string());
        assert_eq!(
            error.recovery_hint,
            Some("Add a semicolon at the end of the statement".to_string())
        );

        error.expected = vec![Token::Semicolon, Token::Comma];
        assert_eq!(error.expected.len(), 2);

        error.found = Some(Token::Plus);
        assert_eq!(error.found, Some(Token::Plus));
    }

    #[test]
    fn test_recovery_result_successful() {
        // RecoveryResult is the return type of parse_with_recovery
        let mut parser = RecoveryParser::new("42");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
        assert!(!result.partial_ast);
    }

    #[test]
    fn test_recovery_parser_new() {
        let parser = RecoveryParser::new("let x = 42");
        assert_eq!(parser.recursion_depth, 0);
        assert_eq!(parser.ghost_node_count, 0);
        assert!(parser.errors.is_empty());
        // max_recursion_depth is a constant, not a field
    }

    #[test]
    fn test_error_severity_levels() {
        assert_eq!(ErrorSeverity::Error, ErrorSeverity::Error);
        assert_eq!(ErrorSeverity::Warning, ErrorSeverity::Warning);
        assert_eq!(ErrorSeverity::Info, ErrorSeverity::Info);
        assert_eq!(ErrorSeverity::Hint, ErrorSeverity::Hint);
        assert_ne!(ErrorSeverity::Error, ErrorSeverity::Warning);
    }

    #[test]
    fn test_error_code_variants() {
        assert_eq!(ErrorCode::UnexpectedToken, ErrorCode::UnexpectedToken);
        assert_eq!(ErrorCode::MissingToken, ErrorCode::MissingToken);
        assert_ne!(ErrorCode::UnexpectedToken, ErrorCode::TypeMismatch);
    }

    #[test]

    fn test_recovery_nested_blocks() {
        let mut parser = RecoveryParser::new("1");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
    }

    #[test]

    fn test_recovery_function_call_missing_args() {
        let mut parser = RecoveryParser::new("foo");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
    }

    #[test]
    fn test_recovery_array_missing_elements() {
        let mut parser = RecoveryParser::new("[1, , 3]");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    #[test]
    fn test_recovery_multiple_errors() {
        let mut parser = RecoveryParser::new("let x = @ + # * $");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
        assert!(result.partial_ast);
    }

    #[test]
    fn test_recovery_unterminated_string() {
        let mut parser = RecoveryParser::new("\"hello");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    #[test]
    fn test_recovery_match_missing_arms() {
        let mut parser = RecoveryParser::new("match x { }");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        // May or may not have errors depending on implementation
    }

    #[test]
    fn test_recovery_deeply_nested_expression() {
        let mut parser = RecoveryParser::new("((((((1))))))");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
    }

    #[test]
    fn test_recovery_binary_op_chain() {
        let mut parser = RecoveryParser::new("1 + 2 * 3 - 4 / 5");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
    }

    #[test]
    fn test_recovery_incomplete_struct() {
        let mut parser = RecoveryParser::new("struct Person { name: String, age:");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
        assert!(result.partial_ast);
    }

    #[test]
    fn test_recovery_lambda_missing_body() {
        let mut parser = RecoveryParser::new("|x, y|");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Round 97: Additional error recovery tests

    // Test 23: Recovery from missing semicolons
    #[test]
    fn test_recovery_missing_semicolons() {
        let mut parser = RecoveryParser::new("let x = 1 let y = 2");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
    }

    // Test 24: Recovery from extra tokens
    #[test]
    fn test_recovery_extra_tokens() {
        let mut parser = RecoveryParser::new("1 + 2 3 4");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
    }

    // Test 25: Recovery from invalid identifiers
    #[test]
    fn test_recovery_invalid_identifier() {
        let mut parser = RecoveryParser::new("let 123 = 456");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 26: Recovery from unclosed parens
    #[test]
    fn test_recovery_unclosed_paren() {
        let mut parser = RecoveryParser::new("(1 + 2");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 27: Recovery from unclosed brackets
    #[test]
    fn test_recovery_unclosed_bracket() {
        let mut parser = RecoveryParser::new("[1, 2, 3");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 28: Recovery from unclosed braces
    #[test]
    fn test_recovery_unclosed_brace() {
        let mut parser = RecoveryParser::new("{ let x = 1");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 29: Recovery from extra closing parens
    #[test]
    fn test_recovery_extra_closing_paren() {
        let mut parser = RecoveryParser::new("(1 + 2))");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
    }

    // Test 30: Recovery from incomplete if with brace
    #[test]
    fn test_recovery_incomplete_if_with_brace() {
        let mut parser = RecoveryParser::new("if true {");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 31: Recovery from incomplete else
    #[test]
    fn test_recovery_incomplete_else() {
        let mut parser = RecoveryParser::new("if true { 1 } else");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 32: Recovery from incomplete for loop
    #[test]
    fn test_recovery_incomplete_for() {
        let mut parser = RecoveryParser::new("for x in");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 33: Recovery from incomplete while loop
    #[test]
    fn test_recovery_incomplete_while() {
        let mut parser = RecoveryParser::new("while true");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 34: Recovery from incomplete function
    #[test]
    fn test_recovery_incomplete_function() {
        let mut parser = RecoveryParser::new("fun foo(x:");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(!result.errors.is_empty());
    }

    // Test 35: Empty input
    #[test]
    fn test_recovery_empty_input() {
        let mut parser = RecoveryParser::new("");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        // Empty input may or may not produce errors depending on implementation
    }

    // Test 36: Whitespace only
    #[test]
    fn test_recovery_whitespace_only() {
        let mut parser = RecoveryParser::new("   \n\t  ");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        // Whitespace-only input may or may not produce errors
    }

    // Test 37: Comments only
    #[test]
    fn test_recovery_comments_only() {
        let mut parser = RecoveryParser::new("// This is a comment");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
    }

    // Test 38: Valid simple expression
    #[test]
    fn test_recovery_valid_simple() {
        let mut parser = RecoveryParser::new("42");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
        assert!(!result.partial_ast);
    }

    // Test 39: Valid let binding
    #[test]
    fn test_recovery_valid_let() {
        let mut parser = RecoveryParser::new("let x = 42");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        assert!(result.errors.is_empty());
    }

    // Test 40: Mixed valid and invalid - use clearly invalid syntax
    #[test]
    fn test_recovery_mixed_valid_invalid() {
        let mut parser = RecoveryParser::new("let x = 1; let = ");
        let result = parser.parse_with_recovery();
        assert!(result.ast.is_some());
        // Recovery parser should recover from invalid syntax
    }
}