Hi everyone,
I'm Ronit, a Computer Science student at UNT, and I'm very interested in working on the "Qualified name lookup for swift-syntax" project this GSoC.
I've been following the progress of SwiftLexicalLookup from last year's GSoC (great write-up, @MAJKFL!) and I'm excited to build the qualified name lookup counterpart on top of it.write-up made very clear!).
What I'm thinking about for the project:
Qualified lookup needs to resolve A.f by traversing the type A's members, extensions, superclasses, and protocol conformances. The core challenge seems to be building an efficient symbol table that can handle these lookups while integrating cleanly with SwiftLexicalLookup's lookInMembers result kind — essentially acting as the handler for those "instructions to the client" that described.
I'd love to hear from @xedin and the community about the current state of thinking on the symbol table design and the expected integration surface with SwiftLexicalLookup.
Thanks for building such a well-documented foundation to build on!
Ronit