Follow Us :

Theory of Computation and Compilers - Context free languages

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Theory of Computation and Compilers > > Context free languages

16. The CFG
s---> as | bs | a | b
is equivalent to regular expression

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


17. Consider the grammar :

S —> ABCc | Abc
BA —> AB
Bb —> bb
Ab —> ab
Aa —> aa
Which of the following sentences can be derived by this grammar

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


18. Pumping lemma is generally used for proving that

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


19. The language of all words with at least 2 a's can be described by the regular expression

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


20. Any string of terminals that can be generated by the following CFG is
S-> XY
X--> aX | bX | a
Y-> Ya | Yb | a

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
Context free languages