Class AutoMemoize

source code

Apply two different memoizers, one to left recursive loops and the other elsewhere (either can be omitted).

conservative refers to the algorithm used to detect loops:

None will use the left memoizer on all nodes except the initial tree True will detect all possible loops (should be very similar to None) False detects only left-most loops and may miss some loops.

d is a parameter that controls the depth to which repeated left-recursion may occur. If None then the length of the remaining input is used. If set, parsers are more efficient, but less likely to match input correctly.