- - Isolate the Element objects from Parse.Table/GSS so we can move
- towards compilation.
-
- - consider allowing a Forest.Body to represent some other Tree whose
- Body's should be [recursively] considered part of this Forest.
-
- - perhaps not: right now we have a nice situation where
- Forest.Ref instances become immutable once iterator()ed. This
- also gives us a strong place to to culling with the certainty
- that we won't throw out a Body which would later be salvaged
- by some yet-to-be-added dependency.
-
- - Figure out if there is a way to:
-
- - allow unwrapping of children other than the very last one.
-
- - fold repetitions into an array form in Forest, before
- conversion to Tree. The major problem here is that multiple
- tree-arrays are possible, all of different lengths. Worse,
- even if they're all the same length, not all elements belong
- in the same "possibility vector" as all others. You
- essentially need a GSS to represent the array, which perhaps
- is what the unfolded form was in the first place.
-
- - Wikipedia grammar (needs to be both lexerless and boolean)
-
- - Boolean Parsing
- => Ordered Choice (";" operator)
-