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
If we ever push an empty continuation to the stack then we will get into an infinite loop.
That can happen in cases like this:
emptyk :: Parser () emptyk = 'emptyk ::= emptyk <|> pure ()
It is easy to check whether a parser parses the empty string, but it is a bit of an open question how we can use that information to fix this bug.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
If we ever push an empty continuation to the stack then we will get into an infinite loop.
That can happen in cases like this:
It is easy to check whether a parser parses the empty string, but it is a bit of an open question how we can use that information to fix this bug.
The text was updated successfully, but these errors were encountered: