MCQ
Q.
Which of the following language(s) generates more than one parse tree for a string ?
L1 = {a^nb^mc^md^n ? {a, b, c, d}* | n, m ? 0}
? {a^nb^nc^md^m ? {a, b, c, d}* | n, m ? 0}
L2 = {a^nb^mc^m ? {a, b, c}* | n, m ? 0}
? {a^nb^nc^m ? {a, b, c}* | n, m ? 0}
L3 = {a^nb^mc^p ? {a, b, c}* | n ? m; n, m ? 0}
? {a^nb^mc^p ? {a, b, c}* | m ? p; n, m ? 0}
Correct Answer: D
