Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 13 - Section 13.1 - Languages and Grammers - Exercises - Page 857: 25

Answer

a) Yes b) No c) Yes d) No

Work Step by Step

Using top-down parsing to determine whether each of the following strings belongs to the language generated by the grammar in Example 12. a) yes baba is string is belong to the language generated by grammer b) NO abab is string is not belong to the language generated by grammer c) YES cbaba is string is belong to the language generated by grammer d) NO bbbcba is string is not belong to the language generated by grammer
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions