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
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
//! Name resolution pass for ReluxScript
use std::collections::HashMap;
use std::path::PathBuf;
use std::fs;
use crate::parser::*;
use crate::{Lexer, Parser, Span};
use crate::semantic::{SemanticError, TypeEnv, TypeInfo, types::ast_type_to_type_info};
use crate::mapping::get_node_mapping;
/// Exported symbols from a module
#[derive(Debug, Clone)]
struct ModuleExports {
functions: HashMap<String, TypeInfo>,
structs: HashMap<String, TypeInfo>,
enums: HashMap<String, TypeInfo>,
}
/// Name resolver - resolves all identifiers and builds the type environment
pub struct Resolver {
env: TypeEnv,
errors: Vec<SemanticError>,
/// Cache of loaded modules (path -> exports)
module_cache: HashMap<PathBuf, ModuleExports>,
/// Track which modules are currently being resolved (for circular dependency detection)
resolving_stack: Vec<PathBuf>,
/// Base directory for resolving relative imports
base_dir: PathBuf,
}
impl Resolver {
pub fn new() -> Self {
Self::with_base_dir(PathBuf::from("."))
}
pub fn with_base_dir(base_dir: PathBuf) -> Self {
Self {
env: TypeEnv::new(),
errors: Vec::new(),
module_cache: HashMap::new(),
resolving_stack: Vec::new(),
base_dir,
}
}
/// Run name resolution
pub fn resolve(&mut self, program: &Program) -> Result<(), Vec<SemanticError>> {
// Phase 1: Process non-deferred use statements (normal top-level imports)
for use_stmt in &program.uses {
if !use_stmt.deferred {
self.resolve_use(use_stmt);
}
}
// Phase 2: Process deferred use statements (hoisted from inline)
// These may form cycles, so we use cycle detection
for use_stmt in &program.uses {
if use_stmt.deferred {
self.resolve_use_deferred(use_stmt);
}
}
match &program.decl {
TopLevelDecl::Plugin(plugin) => self.resolve_plugin(plugin),
TopLevelDecl::Writer(writer) => self.resolve_writer(writer),
TopLevelDecl::Interface(_) => {} // Interfaces don't need resolution
TopLevelDecl::Module(module) => self.resolve_module(module),
}
if self.errors.is_empty() {
Ok(())
} else {
Err(std::mem::take(&mut self.errors))
}
}
/// Resolve a use statement
fn resolve_use(&mut self, use_stmt: &UseStmt) {
// Define the module in the environment
// Valid modules: fs, json, parser, codegen, or file paths starting with "./" or "../"
let valid_modules = ["fs", "json", "parser", "codegen"];
// Check if it's a built-in module or a file path
let is_file_module = use_stmt.path.starts_with("./") || use_stmt.path.starts_with("../");
eprintln!("[RESOLVER] resolve_use: path='{}', is_file_module={}, base_dir={:?}",
use_stmt.path, is_file_module, self.base_dir);
if is_file_module {
// Load and resolve the module file
eprintln!("[RESOLVER] Loading file module: {}", use_stmt.path);
match self.load_module(&use_stmt.path, use_stmt.span) {
Ok(exports) => {
eprintln!("[RESOLVER] Module loaded successfully. Functions: {:?}, Structs: {:?}, Enums: {:?}",
exports.functions.keys().collect::<Vec<_>>(),
exports.structs.keys().collect::<Vec<_>>(),
exports.enums.keys().collect::<Vec<_>>());
// If there are specific imports, resolve them
if !use_stmt.imports.is_empty() {
for import_name in &use_stmt.imports {
// Check if the symbol exists in the module
let type_info = exports.functions.get(import_name)
.or_else(|| exports.structs.get(import_name))
.or_else(|| exports.enums.get(import_name))
.cloned();
if let Some(ty) = type_info {
self.env.define(import_name.clone(), ty);
} else {
self.errors.push(SemanticError::new(
"RS006",
format!("Module '{}' does not export '{}'", use_stmt.path, import_name),
use_stmt.span,
));
}
}
} else {
// Import the whole module
let module_name = use_stmt.alias.clone().unwrap_or_else(|| use_stmt.path.clone());
self.env.define(
module_name.clone(),
TypeInfo::Module {
name: module_name,
},
);
}
}
Err(err) => {
eprintln!("[RESOLVER] Error loading module '{}': {}", use_stmt.path, err.message);
self.errors.push(err);
}
}
} else if valid_modules.contains(&use_stmt.path.as_str()) {
// Built-in module - register it
if use_stmt.alias.is_some() || use_stmt.imports.is_empty() {
let module_name = use_stmt.alias.clone().unwrap_or_else(|| use_stmt.path.clone());
self.env.define(
module_name.clone(),
TypeInfo::Module {
name: module_name,
},
);
}
// For built-in modules, we don't know what specific symbols they export
// So we mark specific imports as Unknown for now
for import_name in &use_stmt.imports {
self.env.define(
import_name.clone(),
TypeInfo::Unknown,
);
}
} else {
self.errors.push(SemanticError::new(
"RS007",
format!("Unknown module: {}", use_stmt.path),
use_stmt.span,
));
}
}
/// Resolve a deferred use statement (hoisted from inline imports)
/// These may form cycles, so we handle them specially
fn resolve_use_deferred(&mut self, use_stmt: &UseStmt) {
let is_file_module = use_stmt.path.starts_with("./") || use_stmt.path.starts_with("../");
if is_file_module {
// For file modules, check if this would create a cycle
let resolved_path = self.base_dir.join(&use_stmt.path);
let canonical_path = resolved_path.canonicalize().unwrap_or(resolved_path.clone());
if self.resolving_stack.contains(&canonical_path) {
// Cycle detected! For deferred imports, we allow this but just register
// the imports as Unknown types (they'll be resolved later in execution)
eprintln!("[Resolver] Deferred import cycle detected, allowing: {}", use_stmt.path);
for import_name in &use_stmt.imports {
if self.env.lookup(import_name).is_none() {
self.env.define(import_name.clone(), TypeInfo::Unknown);
}
}
return;
}
}
// Not a cycle (or built-in), resolve normally
self.resolve_use(use_stmt);
}
/// Load a module file and extract its exports
fn load_module(&mut self, module_path: &str, import_span: Span) -> Result<ModuleExports, SemanticError> {
// Resolve the file path relative to base_dir
let mut resolved_path = self.base_dir.join(module_path);
// If the path doesn't exist but a directory with mod.lux does, use that
// This supports Rust-style module directories: `use "./foo.lux"` can resolve to `./foo/mod.lux`
if !resolved_path.exists() {
let without_ext = module_path.trim_end_matches(".lux");
let mod_path = self.base_dir.join(without_ext).join("mod.lux");
if mod_path.exists() {
resolved_path = mod_path;
}
}
let canonical_path = resolved_path.canonicalize().unwrap_or(resolved_path.clone());
// Check cache first (this handles circular dependencies - exports are cached before imports are resolved)
if let Some(exports) = self.module_cache.get(&canonical_path) {
return Ok(exports.clone());
}
// Try to load from .luxon manifest first (pre-compiled module)
// Look for lib.luxon in the same directory or with .luxon extension
let luxon_paths = [
resolved_path.with_extension("luxon"), // ./module.luxon
self.base_dir.join(module_path.trim_start_matches("./")).join("lib.luxon"), // ./module/lib.luxon
resolved_path.parent().unwrap_or(&resolved_path).join("lib.luxon"), // ./lib.luxon (if module_path is a dir)
];
for luxon_path in &luxon_paths {
if luxon_path.exists() {
eprintln!("[RESOLVER] Loading from .luxon manifest: {:?}", luxon_path);
match self.load_from_luxon(luxon_path, import_span) {
Ok(exports) => {
self.module_cache.insert(canonical_path.clone(), exports.clone());
return Ok(exports);
}
Err(e) => {
eprintln!("[RESOLVER] Warning: Failed to load .luxon: {}", e.message);
// Fall through to try loading .lux source
}
}
}
}
// Check if we're already resolving this module (circular dependency)
// In this case, return empty exports - the actual exports will be available
// once the module finishes loading
if self.resolving_stack.contains(&canonical_path) {
eprintln!("[RESOLVER] Circular dependency detected for '{}', returning empty exports (will be resolved later)", module_path);
return Ok(ModuleExports {
functions: HashMap::new(),
structs: HashMap::new(),
enums: HashMap::new(),
});
}
// Load the .lux source file
let source = fs::read_to_string(&resolved_path).map_err(|e| {
SemanticError::new(
"RS009",
format!("Failed to load module '{}': {}", module_path, e),
import_span,
)
})?;
// Parse the module
let mut lexer = Lexer::new(&source);
let tokens = lexer.tokenize();
let mut parser = Parser::new(tokens);
let program = parser.parse().map_err(|e| {
SemanticError::new(
"RS010",
format!("Failed to parse module '{}': {}", module_path, e.message),
import_span,
)
})?;
// Mark as currently resolving
self.resolving_stack.push(canonical_path.clone());
// Extract exports FIRST (before resolving imports) and cache them
// This allows circular dependencies to find the exports
let exports = self.extract_exports(&program);
self.module_cache.insert(canonical_path.clone(), exports.clone());
// Save current base_dir and update for the loaded module
let old_base_dir = std::mem::replace(&mut self.base_dir, resolved_path.parent().unwrap_or(&resolved_path).to_path_buf());
// Now resolve this module's imports (recursively)
// If any of these create a circular dependency back to us, they'll find our exports in the cache
for use_stmt in &program.uses {
if !use_stmt.deferred {
self.resolve_use(use_stmt);
}
}
for use_stmt in &program.uses {
if use_stmt.deferred {
self.resolve_use_deferred(use_stmt);
}
}
// Restore the base_dir
self.base_dir = old_base_dir;
// Remove from resolving stack
self.resolving_stack.pop();
Ok(exports)
}
/// Load module exports from a .luxon manifest file
fn load_from_luxon(&self, luxon_path: &std::path::Path, import_span: Span) -> Result<ModuleExports, SemanticError> {
use crate::luxon::LuxonManifest;
let manifest = LuxonManifest::load(luxon_path).map_err(|e| {
SemanticError::new("RS011", e, import_span)
})?;
let mut exports = ModuleExports {
functions: HashMap::new(),
structs: HashMap::new(),
enums: HashMap::new(),
};
// Convert structs
for (name, luxon_struct) in manifest.structs {
let fields: HashMap<String, TypeInfo> = luxon_struct.fields.iter()
.map(|(field_name, type_str)| {
(field_name.clone(), self.luxon_type_to_type_info(type_str))
})
.collect();
exports.structs.insert(name.clone(), TypeInfo::Struct { name, fields });
}
// Convert enums
for (name, luxon_enum) in manifest.enums {
let variants: HashMap<String, Option<Vec<TypeInfo>>> = luxon_enum.variants.iter()
.map(|(variant_name, variant)| {
use crate::luxon::LuxonVariant;
let fields = match variant {
LuxonVariant::Unit => None,
LuxonVariant::Tuple(types) => {
Some(types.iter().map(|t| self.luxon_type_to_type_info(t)).collect())
}
LuxonVariant::Struct(fields) => {
Some(fields.values().map(|t| self.luxon_type_to_type_info(t)).collect())
}
};
(variant_name.clone(), fields)
})
.collect();
exports.enums.insert(name.clone(), TypeInfo::Enum { name, variants });
}
// Convert functions
for (name, luxon_func) in manifest.functions {
let params: Vec<TypeInfo> = luxon_func.params.iter()
.map(|p| self.luxon_type_to_type_info(&p.ty))
.collect();
let ret = luxon_func.returns
.map(|r| self.luxon_type_to_type_info(&r))
.unwrap_or(TypeInfo::Unit);
exports.functions.insert(name, TypeInfo::Function {
params,
ret: Box::new(ret),
});
}
Ok(exports)
}
/// Convert a LUXON type string to TypeInfo
fn luxon_type_to_type_info(&self, type_str: &str) -> TypeInfo {
// Handle references
if type_str.starts_with("&mut ") {
let inner = &type_str[5..];
return TypeInfo::Ref {
mutable: true,
inner: Box::new(self.luxon_type_to_type_info(inner)),
};
}
if type_str.starts_with("&") {
let inner = &type_str[1..];
return TypeInfo::Ref {
mutable: false,
inner: Box::new(self.luxon_type_to_type_info(inner)),
};
}
// Handle Option<T>
if type_str.starts_with("Option<") && type_str.ends_with(">") {
let inner = &type_str[7..type_str.len()-1];
return TypeInfo::Option(Box::new(self.luxon_type_to_type_info(inner)));
}
// Handle Result<T, E>
if type_str.starts_with("Result<") && type_str.ends_with(">") {
let inner = &type_str[7..type_str.len()-1];
if let Some(comma_pos) = inner.find(", ") {
let ok = &inner[..comma_pos];
let err = &inner[comma_pos+2..];
return TypeInfo::Result(
Box::new(self.luxon_type_to_type_info(ok)),
Box::new(self.luxon_type_to_type_info(err)),
);
}
}
// Handle Vec<T>, HashSet<T>, HashMap<K, V>
if let Some(bracket_pos) = type_str.find('<') {
if type_str.ends_with(">") {
let container = &type_str[..bracket_pos];
let inner = &type_str[bracket_pos+1..type_str.len()-1];
let args: Vec<TypeInfo> = inner.split(", ")
.map(|t| self.luxon_type_to_type_info(t.trim()))
.collect();
match container {
"Vec" => return TypeInfo::Vec(Box::new(args.into_iter().next().unwrap_or(TypeInfo::Unknown))),
"HashSet" => return TypeInfo::HashSet(Box::new(args.into_iter().next().unwrap_or(TypeInfo::Unknown))),
"HashMap" => {
let mut iter = args.into_iter();
return TypeInfo::HashMap(
Box::new(iter.next().unwrap_or(TypeInfo::Unknown)),
Box::new(iter.next().unwrap_or(TypeInfo::Unknown)),
);
}
_ => {
// Generic container type
return TypeInfo::Unknown;
}
}
}
}
// Handle tuples
if type_str.starts_with("(") && type_str.ends_with(")") {
let inner = &type_str[1..type_str.len()-1];
if inner.is_empty() {
return TypeInfo::Unit;
}
let elements: Vec<TypeInfo> = inner.split(", ")
.map(|t| self.luxon_type_to_type_info(t.trim()))
.collect();
return TypeInfo::Tuple(elements);
}
// Handle primitives and named types
match type_str {
"()" => TypeInfo::Unit,
"Bool" | "bool" => TypeInfo::Bool,
"Number" | "i32" | "i64" | "f32" | "f64" | "usize" | "isize" => TypeInfo::F64, // ReluxScript uses f64 for all numbers
"Str" | "String" | "str" => TypeInfo::Str,
_ => {
// Check if it's a known struct in our cache
// For now, treat as a user-defined type (could be an AST node type too)
TypeInfo::AstNode(type_str.to_string())
}
}
}
/// Extract all exported symbols from a module
fn extract_exports(&mut self, program: &Program) -> ModuleExports {
let mut exports = ModuleExports {
functions: HashMap::new(),
structs: HashMap::new(),
enums: HashMap::new(),
};
// Determine what to export based on the top-level declaration
match &program.decl {
TopLevelDecl::Plugin(plugin) => {
self.extract_exports_from_items(&plugin.body, &mut exports);
}
TopLevelDecl::Writer(writer) => {
self.extract_exports_from_items(&writer.body, &mut exports);
}
TopLevelDecl::Module(module) => {
self.extract_exports_from_items(&module.items, &mut exports);
}
TopLevelDecl::Interface(_) => {
// Interfaces don't export symbols
}
}
exports
}
/// Extract exports from a list of plugin items
fn extract_exports_from_items(&mut self, items: &[PluginItem], exports: &mut ModuleExports) {
for item in items {
match item {
PluginItem::Function(f) => {
let params: Vec<TypeInfo> = f.params.iter()
.map(|p| ast_type_to_type_info(&p.ty))
.collect();
let ret = f.return_type.as_ref()
.map(ast_type_to_type_info)
.unwrap_or(TypeInfo::Unit);
exports.functions.insert(
f.name.clone(),
TypeInfo::Function {
params,
ret: Box::new(ret),
},
);
}
PluginItem::Struct(s) => {
let mut fields = HashMap::new();
for field in &s.fields {
let ty = ast_type_to_type_info(&field.ty);
fields.insert(field.name.clone(), ty);
}
exports.structs.insert(
s.name.clone(),
TypeInfo::Struct {
name: s.name.clone(),
fields,
},
);
}
PluginItem::Enum(e) => {
let mut variants = HashMap::new();
for variant in &e.variants {
let fields = match &variant.fields {
EnumVariantFields::Tuple(types) => {
Some(types.iter().map(ast_type_to_type_info).collect())
}
EnumVariantFields::Struct(named_fields) => {
Some(named_fields.iter().map(|(_, ty)| ast_type_to_type_info(ty)).collect())
}
EnumVariantFields::Unit => None,
};
variants.insert(variant.name.clone(), fields);
}
exports.enums.insert(
e.name.clone(),
TypeInfo::Enum {
name: e.name.clone(),
variants,
},
);
}
_ => {
// Other items (visitor, impl, traverse) don't export symbols
}
}
}
}
/// Get the type environment
pub fn get_env(&self) -> &TypeEnv {
&self.env
}
/// Take ownership of the type environment
pub fn into_env(self) -> TypeEnv {
self.env
}
fn resolve_plugin(&mut self, plugin: &PluginDecl) {
// Define the plugin in scope
self.env.define(
plugin.name.clone(),
TypeInfo::Struct {
name: plugin.name.clone(),
fields: HashMap::new(),
},
);
// Enter plugin scope
self.env.push_scope();
// First pass: resolve pub use statements (imports from modules)
for item in &plugin.body {
if let PluginItem::PubUse(use_stmt) = item {
self.resolve_use(use_stmt);
}
}
// Second pass: collect all struct and enum definitions
for item in &plugin.body {
match item {
PluginItem::Struct(s) => self.declare_struct(s),
PluginItem::Enum(e) => self.declare_enum(e),
_ => {}
}
}
// Third pass: collect function signatures
for item in &plugin.body {
if let PluginItem::Function(f) = item {
self.declare_function(f);
}
}
// Fourth pass: resolve function bodies
for item in &plugin.body {
if let PluginItem::Function(f) = item {
self.resolve_function(f);
}
}
self.env.pop_scope();
}
fn resolve_writer(&mut self, writer: &WriterDecl) {
// Same as plugin for now
self.env.define(
writer.name.clone(),
TypeInfo::Struct {
name: writer.name.clone(),
fields: HashMap::new(),
},
);
self.env.push_scope();
// First pass: resolve pub use statements (imports from modules)
for item in &writer.body {
if let PluginItem::PubUse(use_stmt) = item {
self.resolve_use(use_stmt);
}
}
// Second pass: declare structs and enums
for item in &writer.body {
match item {
PluginItem::Struct(s) => self.declare_struct(s),
PluginItem::Enum(e) => self.declare_enum(e),
_ => {}
}
}
// Third pass: declare functions
for item in &writer.body {
if let PluginItem::Function(f) = item {
self.declare_function(f);
}
}
// Fourth pass: resolve function bodies
for item in &writer.body {
if let PluginItem::Function(f) = item {
self.resolve_function(f);
}
}
self.env.pop_scope();
}
fn resolve_module(&mut self, module: &ModuleDecl) {
// Modules don't define themselves in scope (they're imported via use statements)
// Just resolve their contents
self.env.push_scope();
// First pass: resolve pub use statements (imports from other modules)
for item in &module.items {
if let PluginItem::PubUse(use_stmt) = item {
self.resolve_use(use_stmt);
}
}
// Second pass: declare structs and enums
for item in &module.items {
match item {
PluginItem::Struct(s) => self.declare_struct(s),
PluginItem::Enum(e) => self.declare_enum(e),
_ => {}
}
}
// Third pass: declare functions
for item in &module.items {
if let PluginItem::Function(f) = item {
self.declare_function(f);
}
}
// Fourth pass: resolve function bodies
for item in &module.items {
if let PluginItem::Function(f) = item {
self.resolve_function(f);
}
}
self.env.pop_scope();
}
fn declare_struct(&mut self, s: &StructDecl) {
let mut fields = HashMap::new();
for field in &s.fields {
let ty = ast_type_to_type_info(&field.ty);
fields.insert(field.name.clone(), ty);
}
self.env.define_struct(s.name.clone(), fields);
}
fn declare_enum(&mut self, e: &EnumDecl) {
let mut variants = HashMap::new();
for variant in &e.variants {
let fields = match &variant.fields {
EnumVariantFields::Tuple(types) => {
Some(types.iter().map(ast_type_to_type_info).collect())
}
EnumVariantFields::Struct(named_fields) => {
Some(named_fields.iter().map(|(_, ty)| ast_type_to_type_info(ty)).collect())
}
EnumVariantFields::Unit => None,
};
variants.insert(variant.name.clone(), fields);
}
self.env.define_enum(e.name.clone(), variants);
}
fn declare_function(&mut self, f: &FnDecl) {
let params: Vec<TypeInfo> = f.params.iter().map(|p| ast_type_to_type_info(&p.ty)).collect();
let ret = f
.return_type
.as_ref()
.map(ast_type_to_type_info)
.unwrap_or(TypeInfo::Unit);
self.env.define_function(f.name.clone(), params, ret);
}
fn resolve_function(&mut self, f: &FnDecl) {
self.env.push_scope();
// Define parameters
for param in &f.params {
let ty = ast_type_to_type_info(¶m.ty);
if self.env.is_defined_in_current_scope(¶m.name) {
self.errors.push(SemanticError::new(
"RS004",
format!("Duplicate parameter name: {}", param.name),
param.span,
));
} else {
self.env.define(param.name.clone(), ty);
}
}
// Resolve body
self.resolve_block(&f.body);
self.env.pop_scope();
}
fn resolve_block(&mut self, block: &Block) {
for stmt in &block.stmts {
self.resolve_stmt(stmt);
}
}
fn resolve_stmt(&mut self, stmt: &Stmt) {
match stmt {
Stmt::Let(let_stmt) => {
// Resolve initializer if present
if let Some(ref init) = let_stmt.init {
self.resolve_expr(init);
}
// Check for redefinition in same scope (only for simple identifiers)
if let Pattern::Ident(ref name) = let_stmt.pattern {
if self.env.is_defined_in_current_scope(name) {
self.errors.push(SemanticError::new(
"RS005",
format!("Variable '{}' already defined in this scope", name),
let_stmt.span,
));
}
}
// Resolve the pattern and define variables
self.resolve_pattern(&let_stmt.pattern);
// Determine type
let ty = if let Some(ref type_ann) = let_stmt.ty {
ast_type_to_type_info(type_ann)
} else {
// Type will be inferred during type checking
self.env.fresh_var()
};
// Define variables from the pattern
self.define_pattern(&let_stmt.pattern, ty);
}
Stmt::Const(const_stmt) => {
self.resolve_expr(&const_stmt.init);
if self.env.is_defined_in_current_scope(&const_stmt.name) {
self.errors.push(SemanticError::new(
"RS005",
format!("Constant '{}' already defined in this scope", const_stmt.name),
const_stmt.span,
));
}
let ty = if let Some(ref type_ann) = const_stmt.ty {
ast_type_to_type_info(type_ann)
} else {
self.env.fresh_var()
};
self.env.define(const_stmt.name.clone(), ty);
}
Stmt::Expr(expr_stmt) => {
self.resolve_expr(&expr_stmt.expr);
}
Stmt::If(if_stmt) => {
self.resolve_expr(&if_stmt.condition);
self.env.push_scope();
// If this is an if-let, resolve the pattern to bind variables
if let Some(ref pattern) = if_stmt.pattern {
self.resolve_pattern(pattern);
}
self.resolve_block(&if_stmt.then_branch);
self.env.pop_scope();
for (cond, block) in &if_stmt.else_if_branches {
self.resolve_expr(cond);
self.env.push_scope();
self.resolve_block(block);
self.env.pop_scope();
}
if let Some(ref else_block) = if_stmt.else_branch {
self.env.push_scope();
self.resolve_block(else_block);
self.env.pop_scope();
}
}
Stmt::Match(match_stmt) => {
self.resolve_expr(&match_stmt.scrutinee);
for arm in &match_stmt.arms {
self.env.push_scope();
self.resolve_pattern(&arm.pattern);
self.resolve_expr(&arm.body);
self.env.pop_scope();
}
}
Stmt::For(for_stmt) => {
self.resolve_expr(&for_stmt.iter);
self.env.push_scope();
// Define variables from pattern
// Use Unknown type for loop variables (type checker will refine this)
self.define_pattern(&for_stmt.pattern, TypeInfo::Unknown);
self.resolve_block(&for_stmt.body);
self.env.pop_scope();
}
Stmt::While(while_stmt) => {
self.resolve_expr(&while_stmt.condition);
self.env.push_scope();
self.resolve_block(&while_stmt.body);
self.env.pop_scope();
}
Stmt::Loop(loop_stmt) => {
self.env.push_scope();
self.resolve_block(&loop_stmt.body);
self.env.pop_scope();
}
Stmt::Return(return_stmt) => {
if let Some(ref value) = return_stmt.value {
self.resolve_expr(value);
}
}
Stmt::Break(_) | Stmt::Continue(_) => {}
Stmt::Traverse(traverse_stmt) => {
// Resolve the target expression
self.resolve_expr(&traverse_stmt.target);
// Handle the traverse kind
match &traverse_stmt.kind {
crate::parser::TraverseKind::Inline(inline) => {
// Create a new scope for the inline visitor
self.env.push_scope();
// Resolve state variables
for let_stmt in &inline.state {
if let Some(ref init) = let_stmt.init {
self.resolve_expr(init);
}
self.resolve_pattern(&let_stmt.pattern);
let ty = if let Some(ref type_ann) = let_stmt.ty {
ast_type_to_type_info(type_ann)
} else {
self.env.fresh_var()
};
self.define_pattern(&let_stmt.pattern, ty);
}
// Resolve methods
for method in &inline.methods {
self.resolve_function(method);
}
self.env.pop_scope();
}
crate::parser::TraverseKind::Delegated(visitor_name) => {
// Check if the visitor exists (would need to track plugin definitions)
// For now, just note it for later validation
let _ = visitor_name;
}
}
}
Stmt::Function(fn_decl) => {
// Nested function declaration
// Define the function in the current scope
let param_types: Vec<TypeInfo> = fn_decl.params.iter()
.map(|p| ast_type_to_type_info(&p.ty))
.collect();
let ret_type = fn_decl.return_type.as_ref()
.map(ast_type_to_type_info)
.unwrap_or(TypeInfo::Unit);
let fn_type = TypeInfo::Function {
params: param_types,
ret: Box::new(ret_type),
};
if self.env.is_defined_in_current_scope(&fn_decl.name) {
self.errors.push(SemanticError::new(
"RS005",
format!("Function '{}' already defined in this scope", fn_decl.name),
fn_decl.span,
));
}
self.env.define(fn_decl.name.clone(), fn_type);
// Resolve the function body in a new scope
self.env.push_scope();
// Define parameters in the function scope
for param in &fn_decl.params {
let param_type = ast_type_to_type_info(¶m.ty);
self.env.define(param.name.clone(), param_type);
}
// Resolve the body
self.resolve_block(&fn_decl.body);
self.env.pop_scope();
}
Stmt::Verbatim(_) => {
// Verbatim blocks are opaque to semantic analysis
// No type checking or variable tracking
}
Stmt::CustomPropAssignment(assign) => {
// Resolve the node expression and value
self.resolve_expr(&assign.node);
self.resolve_expr(&assign.value);
// TODO: Validate that node is an AST type and property starts with __
}
Stmt::Unsafe(unsafe_block) => {
// Resolve statements inside the unsafe block
for stmt in &unsafe_block.body.stmts {
self.resolve_stmt(stmt);
}
}
}
}
fn resolve_pattern(&mut self, pattern: &Pattern) {
match pattern {
Pattern::Ident(name) => {
// Bind the pattern variable
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
Pattern::Tuple(patterns) => {
for pat in patterns {
self.resolve_pattern(pat);
}
}
Pattern::Array(patterns) => {
for pat in patterns {
self.resolve_pattern(pat);
}
}
Pattern::Object(props) => {
for prop in props {
match prop {
crate::parser::ObjectPatternProp::Shorthand(name) => {
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
crate::parser::ObjectPatternProp::KeyValue { value, .. } => {
self.resolve_pattern(value);
}
crate::parser::ObjectPatternProp::Rest(name) => {
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
crate::parser::ObjectPatternProp::Or(patterns) => {
// For OR patterns in object props, resolve all branches
for pat in patterns {
self.resolve_pattern(pat);
}
}
}
}
}
Pattern::Rest(inner) => {
self.resolve_pattern(inner);
}
Pattern::Struct { fields, .. } => {
for (_, pat) in fields {
self.resolve_pattern(pat);
}
}
Pattern::Or(patterns) => {
for pat in patterns {
self.resolve_pattern(pat);
}
}
Pattern::Variant { inner, .. } => {
// Resolve inner pattern if present (e.g., Some(x) -> resolve x)
if let Some(inner_pat) = inner {
self.resolve_pattern(inner_pat);
}
}
Pattern::Ref { pattern: inner, .. } => {
// ref pattern - resolve the inner pattern
self.resolve_pattern(inner);
}
Pattern::Literal(_) | Pattern::Wildcard => {}
}
}
/// Define variables from a pattern with a given type info
fn define_pattern(&mut self, pattern: &Pattern, type_info: TypeInfo) {
match pattern {
Pattern::Ident(name) => {
self.env.define(name.clone(), type_info);
}
Pattern::Tuple(patterns) => {
// Extract tuple element types if available
match &type_info {
TypeInfo::Tuple(elem_types) => {
for (i, pat) in patterns.iter().enumerate() {
let elem_type = elem_types.get(i)
.cloned()
.unwrap_or(TypeInfo::Unknown);
self.define_pattern(pat, elem_type);
}
}
_ => {
// If not a tuple type, give all elements Unknown type
for pat in patterns {
self.define_pattern(pat, TypeInfo::Unknown);
}
}
}
}
Pattern::Array(_) => {
// Array destructuring not yet implemented
}
Pattern::Object(_) => {
// Object destructuring not yet implemented
}
Pattern::Rest(_) => {
// Rest pattern not yet implemented
}
Pattern::Or(patterns) => {
// For OR patterns, all branches must bind the same variables with same types
// For now, just define variables from the first pattern
if let Some(first) = patterns.first() {
self.define_pattern(first, type_info);
}
}
Pattern::Ref { pattern: inner, .. } => {
// ref pattern - define variables from the inner pattern
// The type remains the same (ref doesn't change the type in our IR)
self.define_pattern(inner, type_info);
}
Pattern::Struct { .. } | Pattern::Variant { .. } | Pattern::Literal(_) | Pattern::Wildcard => {
// No variables to define
}
}
}
fn resolve_expr(&mut self, expr: &Expr) {
match expr {
Expr::Ident(ident) => {
if self.env.lookup(&ident.name).is_none() {
// Check for special names, built-in macros, and primitive types used as type paths
let is_special = matches!(ident.name.as_str(),
"self" | "Self" | "matches!" | "format!" | "format" | "vec!" | "Some" | "None" | "Ok" | "Err" | "String" | "HashMap" | "HashSet" | "Vec" | "Option" | "Result" | "Box" | "CodeBuilder" | "_" |
// Primitive types used as type paths (e.g., usize::from_str_radix)
"usize" | "isize" | "i8" | "i16" | "i32" | "i64" | "i128" | "u8" | "u16" | "u32" | "u64" | "u128" | "f32" | "f64" | "bool" | "char"
);
// Check if it's a known AST node type (used in matches!)
let is_ast_type = get_node_mapping(&ident.name).is_some();
// Check if it's a pattern placeholder from matches! macro
let is_pattern_placeholder = ident.name.starts_with("_pattern_");
if !is_special && !is_ast_type && !is_pattern_placeholder {
self.errors.push(SemanticError::new(
"RS006",
format!("Undefined variable: {}", ident.name),
ident.span,
));
}
}
}
Expr::Binary(binary) => {
self.resolve_expr(&binary.left);
self.resolve_expr(&binary.right);
}
Expr::Unary(unary) => {
self.resolve_expr(&unary.operand);
}
Expr::Call(call) => {
// Check if callee is an undefined function
if let Expr::Ident(ident) = &*call.callee {
if self.env.lookup(&ident.name).is_none() {
let is_special = matches!(ident.name.as_str(),
"self" | "Self" | "matches!" | "format!" | "format" | "vec!" | "println" | "panic" | "print" | "eprintln" | "eprint" | "dbg" | "Some" | "None" | "Ok" | "Err" | "String" | "HashMap" | "HashSet" | "Vec" | "Option" | "Result" | "Box" | "CodeBuilder" | "_"
);
let is_ast_type = get_node_mapping(&ident.name).is_some();
if !is_special && !is_ast_type {
self.errors.push(SemanticError::new(
"RS006",
format!("Undefined function: {}", ident.name),
ident.span,
));
}
}
} else {
self.resolve_expr(&call.callee);
}
for arg in &call.args {
self.resolve_expr(arg);
}
}
Expr::Member(member) => {
self.resolve_expr(&member.object);
// Property name doesn't need resolution
}
Expr::Index(index) => {
self.resolve_expr(&index.object);
self.resolve_expr(&index.index);
}
Expr::StructInit(init) => {
// Check struct exists
if self.env.get_struct_fields(&init.name).is_none()
&& self.env.lookup(&init.name).is_none() {
self.errors.push(SemanticError::new(
"RS007",
format!("Unknown struct: {}", init.name),
init.span,
));
}
for (_, value) in &init.fields {
self.resolve_expr(value);
}
}
Expr::VecInit(vec_init) => {
for elem in &vec_init.elements {
self.resolve_expr(elem);
}
}
Expr::If(if_expr) => {
self.resolve_expr(&if_expr.condition);
self.env.push_scope();
// If this is an if-let, define the pattern bindings in the then-branch scope
if let Some(ref pattern) = if_expr.pattern {
self.resolve_pattern(pattern);
}
self.resolve_block(&if_expr.then_branch);
self.env.pop_scope();
if let Some(ref else_block) = if_expr.else_branch {
self.env.push_scope();
self.resolve_block(else_block);
self.env.pop_scope();
}
}
Expr::Match(match_expr) => {
self.resolve_expr(&match_expr.scrutinee);
for arm in &match_expr.arms {
self.env.push_scope();
self.resolve_pattern(&arm.pattern);
self.resolve_expr(&arm.body);
self.env.pop_scope();
}
}
Expr::Closure(closure) => {
self.env.push_scope();
for param in &closure.params {
match param {
ClosureParam::Ident(name) => {
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
ClosureParam::Tuple(names) => {
for name in names {
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
}
ClosureParam::Typed { name, .. } => {
let var_type = self.env.fresh_var();
self.env.define(name.clone(), var_type);
}
}
}
self.resolve_expr(&closure.body);
self.env.pop_scope();
}
Expr::Ref(ref_expr) => {
self.resolve_expr(&ref_expr.expr);
}
Expr::Deref(deref_expr) => {
self.resolve_expr(&deref_expr.expr);
}
Expr::Assign(assign) => {
self.resolve_expr(&assign.target);
self.resolve_expr(&assign.value);
}
Expr::CompoundAssign(compound) => {
self.resolve_expr(&compound.target);
self.resolve_expr(&compound.value);
}
Expr::Range(range) => {
if let Some(ref start) = range.start {
self.resolve_expr(start);
}
if let Some(ref end) = range.end {
self.resolve_expr(end);
}
}
Expr::Paren(inner) => {
self.resolve_expr(inner);
}
Expr::Tuple(elements) => {
for elem in elements {
self.resolve_expr(elem);
}
}
Expr::Block(block) => {
// Block expressions create a new scope
self.env.push_scope();
for stmt in &block.stmts {
self.resolve_stmt(stmt);
}
self.env.pop_scope();
}
Expr::Try(inner) => {
self.resolve_expr(inner);
}
Expr::Matches(matches_expr) => {
// Resolve the scrutinee expression
self.resolve_expr(&matches_expr.scrutinee);
// The pattern doesn't need resolution (it's a pattern, not an expression)
// Pattern variables are only bound within the matches! result context
}
Expr::Return(value) => {
if let Some(ref expr) = value {
self.resolve_expr(expr);
}
}
Expr::Break => {}
Expr::Continue => {}
Expr::RegexCall(regex_call) => {
// Resolve text argument
self.resolve_expr(®ex_call.text_arg);
// Resolve replacement argument if present
if let Some(ref repl) = regex_call.replacement_arg {
self.resolve_expr(repl);
}
}
Expr::CustomPropAccess(access) => {
// Resolve the node expression
self.resolve_expr(&access.node);
// TODO: Validate that property starts with __
}
Expr::Path(_) => {
// Path expressions like std::ptr::null are Rust stdlib paths
// Don't require resolution - they're compile-time references
}
Expr::Literal(_) => {}
}
}
}
impl Default for Resolver {
fn default() -> Self {
Self::new()
}
}