Consider the following grammar

TOC
0

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 ?
(a) xwxy+xww*y+ywx
(b) xwx+xww*y+yw
(c) xw*y+xwxyx+ywx
(d) xw*y+xw*yx+ywx

Ravi Garg edited question
    0
    Debjyoti Bhattacharjee (anonymous)

    (d) S->By->Bwy->Bwwy->Bwwwy->Bw*y->xw*y
    S->Ax->Byx->xw*yx
    S->Ax->Cwx->ywx

    Debjyoti Bhattacharjee answered
      Add image to editor add image from link

      Question stats

      • Active
      • Views278 times
      • Answers1 answer
      • Followers1 follower
      Question and answer is powered by AnsPress