summaryrefslogtreecommitdiff
path: root/chapter05
diff options
context:
space:
mode:
authorCliff Click <cliffc@acm.org>2026-10-03 14:03:48 -0700
committerCliff Click <cliffc@acm.org>2026-10-03 14:03:48 -0700
commit22df891893d30e9906d0b14fc3ae5d8e67d500b2 (patch)
tree2bda142f92febc8b26f1cabd4bb0c46d1864f34b /chapter05
parentc3958e34c0de21df52e57e47e4f47ffe6464f138 (diff)
downloadSimple-22df891893d30e9906d0b14fc3ae5d8e67d500b2.tar.gz
Simple-22df891893d30e9906d0b14fc3ae5d8e67d500b2.zip
Chapter renumber, and split ch 17
Renumber chapters 10a, 10b, 11, 12, 13, 14 -> 10, 11, 13, 12, [11,14]. Split ch 17 into a 17a and 17b; shuffle around im/mutable syntax to be consistent, and present it more slowly. THe new immutable syntax is pushed through all later chapters
Diffstat (limited to 'chapter05')
-rw-r--r--chapter05/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/chapter05/README.md b/chapter05/README.md
index 426da6fb..1f7c240e 100644
--- a/chapter05/README.md
+++ b/chapter05/README.md
@@ -92,7 +92,7 @@ exists in a “sea” of Nodes, with little control structure.
The “sea” of Nodes is useful for optimization, but does not represent any
traditional intermediate representation such as a CFG. We need a way to
serialize the graph and get back the control dependences. We do this with a
-simple Global Code Motion [^3] algorithm in [Chapter 11](../chapter11/README.md).
+simple Global Code Motion [^3] algorithm in [Chapter 13](../chapter13/README.md).
#### `Stop` Nodes
`StopNode`s only have `ReturnNode` inputs. They mark the program termination.