Consider the following ambiguous grammar: S := SS | a How many different parse trees are there for the string aaaa? There are zero parse trees. That is, the string cannot be generated by the grammar. There exists only one parse tree. There exist two distinct parse trees. There exist three distinct parse trees. There exist four distinct parse trees. There exist five distinct parse trees. There exist six distinct parse trees. There exist seven distinct parse trees.