Any string of terminals that can be generated by the following CFG is
S-> XY
X--> aX | bX | a
Y-> Ya | Yb | a
| A. | has atleast one 'b' |
| B. | should end in a 'a' |
| C. | has no consecutive a's or b's |
| D. | has atleast two a's |
Answer : D Explanation : samra said: (11:33am on Saturday 9th June 2018)
what will be regular expression for this cfg?
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
