diff options
| author | Dibyendu Majumdar <dibyendumajumdar@users.noreply.github.com> | 2023-10-22 05:18:58 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-10-21 21:18:58 -0700 |
| commit | 10ed01188f78e3fad4b257a0241f9a89e2fdb405 (patch) | |
| tree | bcf72f66bf0db33cced9b48e2401428706b8eebe /chapter02/README.md | |
| parent | d1c5e6995f5e08df18069be49b1fe0ea193996a9 (diff) | |
| download | Simple-10ed01188f78e3fad4b257a0241f9a89e2fdb405.tar.gz Simple-10ed01188f78e3fad4b257a0241f9a89e2fdb405.zip | |
Revision of docs (#10)
* Port updates back to chapter 2
* Update older visuals to match new format
* Update older visuals to match new format
* update docs
Diffstat (limited to 'chapter02/README.md')
| -rw-r--r-- | chapter02/README.md | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/chapter02/README.md b/chapter02/README.md index 5b4c4958..b89a3059 100644 --- a/chapter02/README.md +++ b/chapter02/README.md @@ -11,7 +11,7 @@ Here is the [complete language grammar](docs/02-grammar.md) for this chapter. ## Extensions to Intermediate Representation -In chapter 1 we introduced following nodes. +In [Chapter 1](../chapter01/README.md) we introduced following nodes. | Node Name | Type | Description | Inputs | Value | |-----------|---------|------------------------------------|------------------------------------------------------------------|-------------------------------------------------------| @@ -53,10 +53,10 @@ may *kill* the unused constants `1` and `2`. ## Constant Folding and Constant Propagation In this chapter and next we focus on a particular peephole optimization: -constant folding and constant propagation. Since we do not have variables -until Chapter 3, the main feature we demonstrate now is constant folding. +constant folding and constant propagation. Since we do not have non-constant values +until [Chapter 4](../chapter04/README.md), the main feature we demonstrate now is constant folding. However, we introduce some additional ideas into the compiler at this stage, to -set the scene for Chapter 3. +set the scene for Chapter 4. It is useful for the compiler to know at various points of the program whether a node's value is a constant. The compiler can use this knowledge to perform various @@ -107,8 +107,8 @@ some constant to ⊥. In later chapters we will explore extending this lattice, as it frequently forms the heart of core optimizations we want our compiler to do. -There are other important properties of the Lattice that we discuss in Chapter -3, such as the "meet" operator and its rules. +There are other important properties of the Lattice that we discuss in [Chapter +4](../chapter04/README.md), such as the "meet" operator and its rules. ## Nodes Pre Peephole Optimization |