Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hello, I have created a parsing library called Farkle. Its API bears a strong resemblance to parser combinators, but in contrast with ordinary parser combinator libraries like Pidgin, Sprache and FParsec, it uses bottom-up LALR(1) parsing under the hood. It would be fun to add it to the benchmarks, and would help tuning the performance of both Farkle and Pidgin.
I ran it on my machine, and the enclosed results are interesting. In the JSON benchmarks, Farkle is a solid contender, finishing always in the top three in both time and memory, and finishing first in the deep JSON files benchmark. In the expression benchmarks, Farkle always finishes second in time, but uses significantly more memory than Pidgin and FParsec.
Let me know if you have any questions.
JSON benchmarks.
Expression benchmarks.