Add parse-time constant folding #256
Merged
+98
−12
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.
This implements constant folding during expression parsing to evaluate compile-time constants like "2 + 3" → "5" before IR generation, covering arithmetic, bitwise, and comparison operations with proper error handling. It complement existing SSA optimizer without conflicts.
Summary by Bito
This pull request implements parse-time constant folding in the expression parser, enabling the evaluation of compile-time constants like '2 + 3' to '5'. It also enhances error handling for division and modulo by zero, improving parser robustness while ensuring compatibility with the existing SSA optimizer.