Parse forest types

- parse forests are binary trees with ambiguities represented explicitly as Choice nodes.
- (`List` considered pointless)
- repetitions’ parse forests make at least some tiny iota of sense
- soon: concatenations’ parse forests are the cartesian product of their parsers’ parse forests
- soon: reductions → ƒ have a real return type, not this `Any` nonsense