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 ?
Question and answer is powered by AnsPress