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.

Sign up for GitHub

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

Jump to bottom

Question: About the algorithm used #15

Open

yoavst opened this issue Dec 9, 2018 · 0 comments

yoavst commented Dec 9, 2018

I've read the Wiki page and the paper: "Parser Combinators for Ambiguous Left-Recursive Grammars" about parser combinators, Those pages say that the naive implementation takes exponential time & space. Is this library different?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment