Skip to content
New issue

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

Parsers without error recovery should fail faster on invalid inputs #256

Closed
bd82 opened this issue Aug 10, 2016 · 0 comments
Closed

Parsers without error recovery should fail faster on invalid inputs #256

bd82 opened this issue Aug 10, 2016 · 0 comments

Comments

@bd82
Copy link
Member

bd82 commented Aug 10, 2016

Currently a re-sync recovery can still be triggered at the top most rule.
This will always resync to EOF which is the "last" token.

However this means iterating over all the Tokens which takes a while.
In such a scenario it is better to just "hop" to the end of the token vector immediately.

perhaps this is relevant even for "recovery enabled" parsers. as EOF should only appear at the end of the input...

@bd82 bd82 changed the title Parsers without error recovery should fail faster Parsers without error recovery should fail faster on invalid inputs Aug 14, 2016
@bd82 bd82 closed this as completed in #289 Oct 12, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant