Consider the grammar S $rightarrow$ PQ | SQ | PS P $rightarrow$ x Q$rightarrow$ y. To get a string of n terminals, the number of productions to be used is

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 the grammar S

A	n2
B	n + 1
C	2n
D	2n-1

Explanation:

There is 1 question to complete.

MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION