Computer Science Fundamentals
Algorithms
Objective
Mar 06, 2013
Consider the following grammar
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?
Detailed Explanation
Option a is right answer.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts