Coding 2022-01-12

By Max Woerner Chase

I'm going to try to diversify what I work on and blog about, but not today.

All right, let's plan out some of the stuff I was talking about last time. Iterating over parses. Because any found sub-tree is guaranteed to produce at least one valid sub-parse, I think I want to work by iterating over all possible top-level divisions of sub-trees (to look for the values that work), and then take the product of the parses of those sub-trees.

So this looks like:

I'm not sure whether I'd rather accomplish that by making a bunch of these have the same return types, or by confining the recursion to the parses_for_item function. I was originally thinking the former, but I'd like to try the latter. Later.

It's late and I'm tired.

Good night.