Introduce structured IR of MtExpr #616
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fendor
force-pushed
the
fendor/mtexprast
branch
from
11fa139 to
bb70374
Compare
The new IR (Intermediate Representation) introduces a Tree-like structure for the program AST in favour of the unstructured list. This avoids some additional work in the transpiler, as the transpiler no longer needs to figure out what the program AST actually means, at the cost of some additional complexity in the renamer. However, since the complexity has been moved from one point to the other, we end with a nice separation, keeping the transpiler simple and focusing on the individual transpiler, and tucking complexity away into the Renamer phase. We also improve the Simala backend slightly by utilising the new program AST.
fendor
force-pushed
the
fendor/mtexprast
branch
from
bb70374 to
defbcea
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The new IR (Intermediate Representation) introduces a Tree-like structure for the program AST in favour of the unstructured list. This avoids some additional work in the transpiler, as the transpiler no longer needs to figure out what the program AST actually means, at the cost of some additional complexity in the renamer. However, since the complexity has been moved from one point to the other, we end with a nice separation, keeping the transpiler simple and focusing on the individual transpiler, and tucking complexity away into the Renamer phase.
We also improve the Simala backend slightly by utilising the new program AST.