Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 3 years ago

4. Any string of terminals that can be generated by the following CFG- S à XY X à aX | bX | a Y à Ya | Yb | a a) Has at least one b b) Should end in an a c) Has no consecutive a’s or b’s d) Has at least two a’s

  • This Question is Open

    Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy