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. | xw * y + xw * yx + ywx |
| B. | xwy + xw * xy + ywx |
| C. | xw * y + xw x yx + ywx |
| D. | xw xy + xww * y + ywx |
Answer : A Explanation : ritesh said: (5:37pm on Thursday 7th February 2013)
plese tell details for this ques
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
