diff options
| author | Cliff Click <cliffc@acm.org> | 2026-09-29 09:44:41 -0700 |
|---|---|---|
| committer | Cliff Click <cliffc@acm.org> | 2026-09-29 09:44:41 -0700 |
| commit | e1bba17ff54400a34ede0eaacad863420d021119 (patch) | |
| tree | 99bef5b646f0febf919208e6f4cbce81227811eb /chapter11 | |
| parent | 41be002e89358649da46c33c8245aa786afdad6a (diff) | |
| download | Simple-e1bba17ff54400a34ede0eaacad863420d021119.tar.gz Simple-e1bba17ff54400a34ede0eaacad863420d021119.zip | |
Split ch10
Basic memory introduction in 10a, then precise aliases in 10b.
Diffstat (limited to 'chapter11')
| -rw-r--r-- | chapter11/README.md | 8 |
1 files changed, 7 insertions, 1 deletions
diff --git a/chapter11/README.md b/chapter11/README.md index 2a1c3903..c2f329bc 100644 --- a/chapter11/README.md +++ b/chapter11/README.md @@ -1,5 +1,11 @@ # Chapter 11: Global Code Motion +The preceding memory lesson is now split into [10a](../chapter10a/README.md) +and [10b](../chapter10b/README.md). This snapshot still constructs the older +per-alias memory chains in the parser. The language is unchanged; forwarding +10b's bulk-memory representation through Chapters 11-24 is a separate migration. + + # Table of Contents 1. [High Level Overview](#high-level-overview) @@ -16,7 +22,7 @@ 12. [Video Walk Through](#video-walk-through) -You can also read [this chapter](https://github.com/SeaOfNodes/Simple/tree/linear-chapter11) in a linear Git revision history on the [linear](https://github.com/SeaOfNodes/Simple/tree/linear) branch and [compare](https://github.com/SeaOfNodes/Simple/compare/linear-chapter10...linear-chapter11) it to the previous chapter. +You can also read [this chapter](https://github.com/SeaOfNodes/Simple/tree/linear-chapter11) in a linear Git revision history on the [linear](https://github.com/SeaOfNodes/Simple/tree/linear) branch and [compare](https://github.com/SeaOfNodes/Simple/compare/linear-chapter10b...linear-chapter11) it to the previous chapter. The original input source program defines a sequence in which things happen. As we parse the program into Sea of Nodes representation |