Answer:   C

Since a Context Free language has a single nonterminal on the left-hand side, we can write the production as a subtree with the left-hand side as root and right-hand side symbols as children. Thus, any parsing of a sentence must be a tree (not necessarily binary).

S -> X Y Z                S
                        / | \
                       X  Y  Z