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 /chapter04/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 'chapter04/README.md')
| -rw-r--r-- | chapter04/README.md | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/chapter04/README.md b/chapter04/README.md index da8781d4..03bfe58b 100644 --- a/chapter04/README.md +++ b/chapter04/README.md @@ -22,7 +22,7 @@ Following are revised or new nodes | Proj | ? | Projection nodes extract values from MultiNode | A MultiNode and index | Result is the extracted value from the input MultiNode at offset index | | Bool | Data | Represents results of a comparison operator | Two data nodes | Result a comparison, represented as integer value where 1=true, 0=false | -Below is our list of Nodes from chapter 3: +Below is our list of Nodes from [Chapter 3](../chapter03/README.md): | Node Name | Type | Description | Inputs | Value | |------------|---------|------------------------------------|------------------------------------------------------------------|------------------------------| @@ -36,7 +36,7 @@ Below is our list of Nodes from chapter 3: ## Changes to Type System -In Chapter 2 we introduced the Type System. Here is a summary of key points: +In [Chapter 2](../chapter02/README.md) we introduced the Type System. Here is a summary of key points: We annotate Nodes with Types. @@ -58,7 +58,7 @@ Type +-- TypeTuple (New - represents multi-valued result) ``` -We mentioned in Chapter 2 that the set of values associated with a Type at a specific Node +We mentioned in [Chapter 2](../chapter02/README.md) that the set of values associated with a Type at a specific Node can be conveniently represented as a "lattice". Our lattice elements can be one of three types: @@ -151,7 +151,7 @@ The peephole optimizations introduced in this chapter are local. They are trigge as new nodes are created, before the newly created node has any uses. For example, when we parse a unary expression, and create a Node for the parsed expression, -`peephole()` is invoked on the newky created `MinusNode`: +`peephole()` is invoked on the newly created `MinusNode`: ```java private Node parseUnary() { |