gknowles / dimapp Goto Github PK

Reduce the memory footprint and improve performance by making the searches faster.

Have a single unified state tree and rely on the client (or possibly a counter?) to track depth.

Subgrammars are required to end at a well defined point, usually a specific character such as ')' or '}'. Allowing the subgrammar to run until it fails means tracking callback events for multiple paths and only executing them for the surviving path after all others have failed.

There is no easy way to detect infinite left recursion when it crosses a call boundary. Currently calls are always rolled up into the caller when descending the left side. Instead the subgrammar could be checked for dangerous recursion (pure left side, any right recursion in path breaks the loop and makes it safe) in advance and only rolled up when it's unsafe.