Consider a grammar with the following productions S$rightarrow$ aab | bac | aB S $rightarrow$ $alpha$ S | b S $rightarrow$ $alpha$ b b | ab S$alpha$ $rightarrow$ bdb

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]

Consider a grammar with the following productions S

A	Context free
B	regular
C	context sensitive
D	LR ( k )

Explanation:

There is 1 question to complete.

MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION