130 lines
4.3 KiB
Rust
130 lines
4.3 KiB
Rust
use std::rc::Rc;
|
|
|
|
use crate::ast::*;
|
|
use crate::symbol_table::{Fqsn, Scope, SymbolTable};
|
|
use crate::util::ScopeStack;
|
|
|
|
type FqsnPrefix = Vec<Scope>;
|
|
|
|
pub struct ScopeResolver<'a> {
|
|
symbol_table: &'a mut super::SymbolTable,
|
|
name_scope_stack: ScopeStack<'a, Rc<String>, FqsnPrefix>,
|
|
}
|
|
|
|
impl<'a> ScopeResolver<'a> {
|
|
pub fn new(symbol_table: &'a mut SymbolTable) -> Self {
|
|
let name_scope_stack: ScopeStack<'a, Rc<String>, FqsnPrefix> = ScopeStack::new(None);
|
|
Self {
|
|
symbol_table,
|
|
name_scope_stack,
|
|
}
|
|
}
|
|
pub fn resolve(&mut self, ast: &AST) {
|
|
walk_ast(self, ast);
|
|
}
|
|
|
|
fn lookup_name_in_scope(&self, sym_name: &QualifiedName) -> Fqsn {
|
|
let QualifiedName { components, .. } = sym_name;
|
|
let first_component = &components[0];
|
|
match self.name_scope_stack.lookup(first_component) {
|
|
None => Fqsn {
|
|
scopes: components
|
|
.iter()
|
|
.map(|name| Scope::Name(name.clone()))
|
|
.collect(),
|
|
},
|
|
Some(fqsn_prefix) => {
|
|
let mut full_name = fqsn_prefix.clone();
|
|
let rest_of_name: FqsnPrefix = components[1..]
|
|
.iter()
|
|
.map(|name| Scope::Name(name.clone()))
|
|
.collect();
|
|
full_name.extend_from_slice(&rest_of_name);
|
|
|
|
Fqsn { scopes: full_name }
|
|
}
|
|
}
|
|
}
|
|
|
|
fn qualified_name(&mut self, name: &QualifiedName) {
|
|
println!("Handling qualified_name in resolver.rs: {:?}", name);
|
|
let fqsn = self.lookup_name_in_scope(name);
|
|
println!("Computed FQSN: {:?}", fqsn);
|
|
let symbol = self.symbol_table.fqsn_to_symbol.get(&fqsn);
|
|
if let Some(symbol) = symbol {
|
|
self.symbol_table.id_to_symbol.insert(name.id.clone(), symbol.clone());
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<'a> ASTVisitor for ScopeResolver<'a> {
|
|
//TODO need to un-insert these - maybe need to rethink visitor
|
|
fn import(&mut self, import_spec: &ImportSpecifier) {
|
|
let ImportSpecifier {
|
|
ref path_components,
|
|
ref imported_names,
|
|
..
|
|
} = &import_spec;
|
|
match imported_names {
|
|
ImportedNames::All => {
|
|
let prefix = Fqsn {
|
|
scopes: path_components
|
|
.iter()
|
|
.map(|c| Scope::Name(c.clone()))
|
|
.collect(),
|
|
};
|
|
let members = self.symbol_table.symbol_trie.get_children(&prefix);
|
|
for member in members.into_iter() {
|
|
let Scope::Name(n) = member.scopes.last().unwrap();
|
|
let local_name = n.clone();
|
|
self.name_scope_stack.insert(local_name, member.scopes);
|
|
}
|
|
}
|
|
ImportedNames::LastOfPath => {
|
|
let name = path_components.last().unwrap(); //TODO handle better
|
|
let fqsn_prefix = path_components
|
|
.iter()
|
|
.map(|c| Scope::Name(c.clone()))
|
|
.collect();
|
|
self.name_scope_stack.insert(name.clone(), fqsn_prefix);
|
|
}
|
|
ImportedNames::List(ref names) => {
|
|
let fqsn_prefix: FqsnPrefix = path_components
|
|
.iter()
|
|
.map(|c| Scope::Name(c.clone()))
|
|
.collect();
|
|
for name in names.iter() {
|
|
self.name_scope_stack
|
|
.insert(name.clone(), fqsn_prefix.clone());
|
|
}
|
|
}
|
|
};
|
|
}
|
|
|
|
fn expression(&mut self, expression: &Expression) {
|
|
use ExpressionKind::*;
|
|
match &expression.kind {
|
|
Value(name) => {
|
|
self.qualified_name(name);
|
|
},
|
|
NamedStruct { name, fields: _ } => {
|
|
self.qualified_name(name);
|
|
},
|
|
_ => (),
|
|
}
|
|
}
|
|
|
|
fn pattern(&mut self, pat: &Pattern) {
|
|
use Pattern::*;
|
|
|
|
match pat {
|
|
//TODO I think not handling TuplePattern is an oversight
|
|
TuplePattern(_) => (),
|
|
Literal(_) | Ignored => (),
|
|
TupleStruct(name, _) | Record(name, _) | VarOrName(name) => {
|
|
self.qualified_name(name);
|
|
}
|
|
};
|
|
}
|
|
}
|