i think i have figured it out. every value is a (sup, sub) pair, which are made of a (precon, antecede) and (consequent, non-consequent) pair, which defines an edge in an abstract syntax graph (a prefix & a postfix tree glued together).
These can then all be made into nodes in another tree