GATE | GATE CS Mock 2018 | Question 53

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}

(A)

Only L1 and L2

(B)

Only L1 and L3

(C)

Only L2 and L3

(D)

All L1, L2, and L3

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News