A strategy for parsing (or decoding) the entire rule must build up the complete set of the rule's children through a sequence of such combinations.
a parsing strategy corresponds to a recursive partitioning of the rule's children, that is, an unordered rooted tree having the child nonterminals as leaves.