Attempt At Non-Infix Pratt Parsing
Along the same lines as #600.
Currently, the chumsky::pratt parser only supports binary infix operators with left or right associativity, but not non-infix ones. Other libraries and literature might term this as InfixN or non-associative. (Please correct me if I'm wrong~)
For example, comparison operators like > and == are typically non-associative, since expressions like 1 == 2 == 3 is invalid. (They cannot be chained.)
This PR adds a non option for associativity, and tries to follow the same article.
[!IMPORTANT] The PR for now breaks one of the postfix tests - I wanted to open it just in case someone who knows more than me would want to take a look!
Thanks for the PR, should be able to take a look at this soon.
Do you have any idea why the current changes break the postfix test?