summaryrefslogtreecommitdiff
path: root/chapter02/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'chapter02/README.md')
-rw-r--r--chapter02/README.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/chapter02/README.md b/chapter02/README.md
index c670ea36..eda25269 100644
--- a/chapter02/README.md
+++ b/chapter02/README.md
@@ -93,7 +93,7 @@ optimizations such as:
* The compiler may be able to identify regions of code that are dead and no
longer needed, such as when a conditional branch always take one of the
branches ([Chapter 6](../chapter06/README.md)).
-* Pointers may be known to be not-null, and a null check can be skipped ([Chapter 10](../chapter10/README.md)).
+* Pointers may be known to be not-null, and a null check can be skipped ([Chapter 10a](../chapter10a/README.md)).
* Array indices may be known to be in-range, and a range check can be skipped.
* Many additional optimizations are possible when the compiler learns more
about the possible set of Node values.
@@ -151,7 +151,7 @@ starting in [Chapter 4](../chapter04/README.md) and [Chapter
There are other important properties of the Lattice that we discuss in [Chapter
-4](../chapter04/README.md) and [Chapter 10](../chapter10/README.md), such as the "meet" and "join" operators and their rules.
+4](../chapter04/README.md) and [Chapter 10a](../chapter10a/README.md), such as the "meet" and "join" operators and their rules.
## Nodes Pre Peephole Optimization