If we merge A 1 , A 2 , and A 3 to A and project weights according to the max-rule-product principle, then we obtain the CFG G c a with weights Now the weight of some parse tree of G c a is exponential in the number of occurrences of the chain rules A → A it contains.
there cannot be a best tree.