e02921dc35
This change completes the implementation of dependency and type binding. The top-level change here is that, during the first semantic analysis AST walk, we gather up all unknown dependencies. Then the compiler resolves them, caching the lookups to ensure that we don't load the same stack twice. Finally, during the second and final semantic analysis AST walk, we populate the bound nodes by looking up what the compiler resolved for us. |
||
|---|---|---|
| .. | ||
| ast | ||
| compiler | ||
| diag | ||
| encoding | ||
| errors | ||
| util | ||
| workspace | ||