Summary: Implement a transformation of a data structure containing nodes rooting directed acyclic graphs, into a prelude followed by a rewritten data structure in which the nodes root trees. The prelude is a series of assignments of expressions (represented by trees) to temporary variables. This transformation is also capable of limiting the depth of the expression trees produced to a given constant (which must be two or greater).
Summary: Implement a transformation of a data structure containing nodes rooting directed acyclic graphs, into a prelude followed by a rewritten data structure in which the nodes root trees. The prelude is a series of assignments of expressions (represented by trees) to temporary variables. This transformation is also capable of limiting the depth of the expression trees produced to a given constant (which must be two or greater).
Differential Revision: D40745754