Daniel Holden

Thanks je-so. I will profile mpc and see what is going on.

You can take a look at the most recent version in the repo and see if it is any faster for you. In 4472dd4363b585b9a1c993fd7c250ad699d1671a and af81180fa94ea9696d09d59475d70112a6e03c24 I made some minor...

Hi je-so, Thanks for the comments and bug reports. I'll look into them. Definitely the number of small allocations is wasteful. I was actually wondering how to fix this in...

Latest commits should fix the crashes. Using something like `mpc_free` might work in the future but it will break existing code which expects to be able to free parse results...

Hey that is an interesting experiment and really nice little bit of code. I wonder how fast it would be building the AST too. I've pushed up a new version....

mpc has never supported these types of grammars: https://github.com/orangeduck/mpc#backtracking-isnt-working This is because it requires a different type of backtracing where rather than just trying a different choice (such as with...

No and actually you'll get the same behaviour in regex engines because `*` is usually greedy by default. You can make it not greedy in some engines by using `*?`...

I've pushed up a new version which is almost 2x faster again. I tried a couple of things this time. First I wrote a custom block allocator which mallocs a...

While there are still lots of performance improvements to be made in mpc, I think it still does a lot more than your demo so 50-100 times sounds quite optimistic....

Hi petermlm, At the moment there is still no easy solution to this because different applications need to tag nodes in different ways and strings are the only good generic...