State true or false: Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1.
State true or false: Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1. Correct Answer true
It is the parse tree theorem which states: GiveSuppose we have a parse tree for a string w, according to a CNF grammar, G=(V, T, P, S). Let h be the height of the parse tree. Now, Implicatio|w|<=2h-1.