1.

If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length

A. No greater than 2i+1
B. No greater than 2i
C. No greater than 2i-1
D. No greater than i
Answer» D. No greater than i


Discussion

No Comment Found