We define the order of a part according to the number of dependencies it contains, with analogous terminology for factorizations and parsing algorithms.
in the remainder of this paper, we focus on factorizations utilizing the following parts: Sections 4.1, 4.2, and 4.3 describe parsers that, respectively, factor trees into grandchild parts, grand-sibling parts, and a mixture of grand-sibling and tri-sibling parts.