We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Problem I found a bug in lama parser, that is somehow connected to ambiguous grammar rules for case expression and infix operators.
Example code
infix | at ++ (lhs, rhs) { lhs ++ rhs } infix -> at ++ (lhs, rhs) { lhs ++ rhs } (* Prints "WAT" *) printf ("%s\n", case "?" of "?" -> "W" | "A" -> "T" esac.string ); (* Prints W *) printf ("%s\n", case "?" of "?" -> "W" | "A" -> "T" esac )
Expected behaviour Both outputs are quite reasonable but they should be the same for both expressions.
Environment
The text was updated successfully, but these errors were encountered:
#5 (comment)
Sorry, something went wrong.
dboulytchev
No branches or pull requests
Problem
I found a bug in lama parser, that is somehow connected to ambiguous grammar rules for case expression and infix operators.
Example code
Expected behaviour
Both outputs are quite reasonable but they should be the same for both expressions.
Environment
The text was updated successfully, but these errors were encountered: