Any string of terminals that can be generated by the following CFG isS$rightarrow$ XYX$rightarrow$ aX | bX | a Y$rightarrow$ Ya | Yb

THEORY OF COMPUTATION

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

Any string of terminals that can be generated by the following CFG isS

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

Explanation:

There is 1 question to complete.

MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION