diff options
| author | Dibyendu Majumdar <dibyendumajumdar@users.noreply.github.com> | 2023-12-07 09:26:54 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-12-07 09:26:54 +0000 |
| commit | 499906b94893cb808df96810d46441857ae432d4 (patch) | |
| tree | bad8c25c95ca59065f04bf24a9791962b51af017 /chapter03/README.md | |
| parent | 6415e3ae9013e3a9ae0437553ea0c3702381469b (diff) | |
| download | Simple-499906b94893cb808df96810d46441857ae432d4.tar.gz Simple-499906b94893cb808df96810d46441857ae432d4.zip | |
Backport some of the code refactoring to previous chapters (#50)
* #44 Revise docs and comments
* #44 Add starting scope to xScopes
* #44 back some of the code refactoring port to previous chapters
* #44 add_def should not be public
* #44 add_def should not be public. Rename method names so that they are camelcase
Diffstat (limited to 'chapter03/README.md')
| -rw-r--r-- | chapter03/README.md | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/chapter03/README.md b/chapter03/README.md index 3e6cebfe..07d8fe3e 100644 --- a/chapter03/README.md +++ b/chapter03/README.md @@ -19,16 +19,16 @@ Here is the [complete language grammar](docs/03-grammar.md) for this chapter. To recap, our list of Nodes are: -| Node Name | Type | Description | Inputs | Value | -|------------|---------|------------------------------------|------------------------------------------------------------------|-------------------------------------------------------| -| Start | Control | Start of function | None | None for now as we do not have function arguments yet | -| Return | Control | End of function | Predecessor control node, Data node value | Return value of the function | -| Constant | Data | Constants such as integer literals | None, however Start node is set as input to enable graph walking | Value of the constant | -| Add | Data | Add two values | Two data nodes, values are added, order not important | Result of the add operation | -| Sub | Data | Subtract a value from another | Two data nodes, values are subtracted, order matters | Result of the subtract | -| Mul | Data | Multiply two values | Two data nodes, values are multiplied, order not important | Result of the multiply | -| Div | Data | Divide a value by another | Two data nodes, values are divided, order matters | Result of the division | -| UnaryMinus | Data | Negate a value | One data node, value is negated | Result of the unary minus | +| Node Name | Type | Description | Inputs | Value | +|-----------|---------|------------------------------------|------------------------------------------------------------------|-------------------------------------------------------| +| Start | Control | Start of function | None | None for now as we do not have function arguments yet | +| Return | Control | End of function | Predecessor control node, Data node value | Return value of the function | +| Constant | Data | Constants such as integer literals | None, however Start node is set as input to enable graph walking | Value of the constant | +| Add | Data | Add two values | Two data nodes, values are added, order not important | Result of the add operation | +| Sub | Data | Subtract a value from another | Two data nodes, values are subtracted, order matters | Result of the subtract | +| Mul | Data | Multiply two values | Two data nodes, values are multiplied, order not important | Result of the multiply | +| Div | Data | Divide a value by another | Two data nodes, values are divided, order matters | Result of the division | +| Minus | Data | Negate a value | One data node, value is negated | Result of the unary minus | In this chapter we introduce: |