Made Easy Practice Questions

Question

Consider the following language:

L={an bm cm dn n,m >=1}

What is the minimum yield of the above language ? (From equivalent parse tree)

(a) abcd             (b) aaabbbcccddd

(c) aabbccdd      (d) aaaabbbbccccdddd

What's the meaning of this question ?? Unable to understand.

Comments

if language is given we can find minimum yield.

yield nothing but a string which is derived from parse tree.

---

What is above language?

---

language is not given.

---

ohh..sorry..I have done correct it..

Answer 1

Minimum yield is nothing but what is the minimum string possible from the given language,it can be even cheked wit parse tree.

Given Language is L={aⁿ b^m c^m dⁿ n,m >=1}

Since n,m>=1 we can take n=m=1 which is minimum possible , a¹ b¹ c¹ d¹ = abcd

Hence 1) abcd is correct 

Comments

Yes, it should be the correct answer..But given option is (c)..So i am getting confused..

---

If n,m> 1 then C is correct but since n,m>=1 A is correct one