h0tk3y/better-parse

Question: About the algorithm used

Opened this issue · 0 comments

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?