Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 06, 2013

Any string of terminals that can be generated by the following CFG is
   S-> XY
   X--> aX | bX | a
   Y-> Ya | Yb | a

Choose the correct answer:

A) has atleast one 'b'

B) should end in a 'a'

C) has no consecutive a's or b's

D) has atleast two a's

Detailed Explanation

Option d is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback