sfja/courses
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix chapter 7

Browse Source
This commit is contained in:
SFJ 2024-11-27 13:42:02 +01:00
parent 762c1a0f45
commit 1446fe262b
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
compiler/chapter_7.md
View File

@ -95,11 +95,12 @@ class Resolver {
if (expr.type !== "ident") if (expr.type !== "ident")
throw new Error("expected ident"); throw new Error("expected ident");
const ident = expr.kind.ident; const ident = expr.kind.ident;
const { sym, ok: symFound } = syms.get(ident); const symResult = syms.get(ident);
if (!symFound) { if (!symResult.ok) {
this.reportUseOfUndefined(ident, expr.pos, syms); this.reportUseOfUndefined(ident, expr.pos, syms);
return; return;
} }
const sym = symResult.sym;
expr.kind = { expr.kind = {
type: "sym", type: "sym",
ident, ident,
@ -138,10 +139,10 @@ class Resolver {
// ... // ...
if (expr.kind.type === "block") { if (expr.kind.type === "block") {
const childSyms = new Syms(syms); const childSyms = new Syms(syms);
for (const stmt of expr.stmts) { for (const stmt of expr.kind.stmts) {
this.resolveStmt(stmt, childSyms); this.resolveStmt(stmt, childSyms);
} }
if (expr.expr) { if (expr.kind.expr) {
this.resolveExpr(expr.expr, childSyms); this.resolveExpr(expr.expr, childSyms);
} }
return; return;
@ -267,7 +268,7 @@ Just like expressions, we traverse the AST and resolve every sub-statement and e
### Exercises ### Exercises
1. Implement the rest of the expressions. 1. Implement the rest of the expressions. The reason for this, is that all identifiers that are sub-expressions of other expressions, also need to be resolved.
## 7.10 Resolving AST ## 7.10 Resolving AST
@ -323,4 +324,4 @@ Print the last definition to help the user.
## Exercises ## Exercises
1. \* Implement, so that `reportUseOfUndefined` searches for similar symbols, eg. using lLevenshtein distance. 1. \* Implement, so that `reportUseOfUndefined` searches for similar symbols, eg. using Levenshtein distance.