ProphetLamb

Looking at the current mechanism, error recovery is not moved to the lowest precedence alt, which can result in ambiguous matches. So that for example if we have a rule...

The only method to render this data, using `branchvalues='remainder'` and zero values in all nodes but leaves. Applying this fix yields an aggregation function, where every computed value is zero:...

> Fixed the indexing issues. The lua implementation should now behave like the python one. The 20% error is still concerning though. Would be great if you could take a...

This issue appears to be solved

Warnings for reflection can be enabled using the following switch ```xml true ```

Thank you a lot for the answer! Since the 1.0 release will feature a method to recover from this, I don't think my proposal adds value. Besides, some people might...

@jac3km4 The changes to the AST mostly refer to replacing Box slices with vectors created using bump allocation. Bump allocation creates a lifetime buffer that you can create a vector...

> @ProphetLamb I've experimented with using a pooled approach early on in the project and I found there was no discernable difference in the CPU profile, it's far from being...

Interesting. I have transitioned the script lang for the business logic used in the company I work at to pooled allocation, we got around 30% lower compilation times. But that...

That totally makes sense. If it does complicate things it is better to use the native approach, tho this is not the case using nom parsers, since they allow accessing...