Added Non-Associative associativity for Pratt Parsers. #600
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
zesterer
reviewed
Feb 6, 2024
| match self { | ||
| Self::Left(x) => *x as u32 * 3, | ||
| Self::Right(x) => *x as u32 * 3, | ||
| Self::Non(x) => *x as u32 * 3 - 1, |
There was a problem hiding this comment.
For this to be valid, all powers should have 1 added to them such that *x as u32 * 3 - 1 can never result in underflow.
Comment on lines
+762
to
+764
| assert!( | ||
| parser.parse("§1+-~2!$*3").has_errors(), | ||
| ); |
There was a problem hiding this comment.
This change looks a little suspicious. Does this addition change the behaviour of existing parsers?
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.
In current Pratt parsers, only associativity type of
leftandrightare supported. However, according to the original designs of Pratt parsing, it should also support Non-Associative infix binary operators.For example, consider operators
==as a non-associative operator. We should be able to identify it as non-associative and therefore rejecting1 == 2 == 3as an expression with the numbers being atomic literals. Whilst the current design only allow==to be either left-associative or right-associative.This PR added associativity
nonfor infix binary operators, and changed the binding power calculation function slightly based on The Original Parsing Methodology and this article.