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

26. Given A = (0,1) and L = A*. If R = (0n 1n, n > 0) , then language L ∪ R and R are respectively

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 *


27. Define for a context free language
L ≤ {0 ; 1} init (L) = {u/uv ε L for some v in {0,1}} (in other words, init (L) is the set of prefixes of L)
Let L {w/w is noempty and has an equal number of 0’s and 1’s) Then init (L) is

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 *


28. If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

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 *


29. Consider a grammar with the following productions
   S--> aab | bac | aB
   S --> α S | b
   S --> α b b | ab
   Sα --> bdb | b
The above grammar is

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 *


30. What can be said about a regular language L over {a} whose minimal finite state automation has two states?

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