LawMint Sign in

Madhya Pradesh SET (MP SET) Theory of Computation and Compilers Previous Year Questions

Try the preview and open any solution for a worked explanation.

Madhya Pradesh SET (MP SET) practice pack

The practice pack for Madhya Pradesh SET (MP SET) is coming soon to LawMint.

Question 1

Compile time refers to :

Select one answer

Question 2

Which of the following is not in the set denoted by the regular expression R = (ab + abb)*bbab ?

Select one answer

Question 3

If the CFG G, is in CNF, then the length of derivation of a string w of length n belonging to L(G) is :

Select one answer

Question 4

The intersection of two regular languages is :

Select one answer

Question 5

YACC is a :

Select one answer

Question 6

Which of the following phases of compilation process is an optional phase ?

Select one answer

Question 7

The regular expression having all strings in which any number of 0's is followed by any number of 1's followed by any number of 2's is :

Select one answer

Question 8

Consider an NDFA shown in figure below. The automaton accepts:
NDFA with an incoming start arrow to a nonaccepting state, a self-loop labelled a, b on that state, and a transition labelled a to an accepting state. No other transitions are shown.

Select one answer

Question 9

A context free grammar is in Chomsky Normal form if every rule is of the form :

Select one answer

Question 10

Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals {S, A} and terminals {a, b}.
S → aA {print 1}
S → a {print 2}
A → Sb {print 3}
Using the above SDTS, the output printed by a bottom-up parser, for the input aab is :

Select one answer

Continue practising

The practice pack for Madhya Pradesh SET (MP SET) is coming soon to LawMint.

Madhya Pradesh SET (MP SET) practice pack

The practice pack for Madhya Pradesh SET (MP SET) is coming soon to LawMint.