summaryrefslogtreecommitdiff
path: root/docs/chapter18/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'docs/chapter18/README.md')
-rw-r--r--docs/chapter18/README.md6
1 files changed, 4 insertions, 2 deletions
diff --git a/docs/chapter18/README.md b/docs/chapter18/README.md
index cfe70bda..d8b238f8 100644
--- a/docs/chapter18/README.md
+++ b/docs/chapter18/README.md
@@ -116,7 +116,7 @@ reference to `fact` is resolved when the declaration receives its function
value. Recursive calls can then find the same entry as calls from outside.
Return-type inference is still pessimistic in this chapter; mutually recursive
definitions can require the stronger analysis introduced with SCCP in
-[Chapter 24](../chapter24/README.md).
+[Chapter 24](../chapter24b/README.md).
## Functions in the graph
@@ -363,7 +363,9 @@ belong at entry and control transfers at exit. There is room for all sorts of
improvements - there is no machine timing model here, but this is out of scope
for this chapter. The goal remains a legal execution order.
-[Eval2](../../src/test/java/com/seaofnodes/simple/Eval2.java) executes that schedule,
+[Eval2](../../src/test/java/com/seaofnodes/simple/Eval2.java) replaces the earlier
+`Evaluator` and its separate test scheduler starting in this chapter. It executes
+the compiler's schedule,
treating IR operations as instructions with an unlimited supply of value
slots. Each invocation has its own frame, so recursive invocations of the same
nodes keep distinct values. At a call it saves the caller's frame and return