LawMint Sign in

Karnataka SET (KSET) Theory of Computation and Compilers Previous Year Questions

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

Karnataka SET (KSET) practice pack

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.

Question 1

If the languages L and ∼L are recursively enumerable, then L is

Select one answer

Question 2

A grammar is called ambiguous if

Select one answer

Question 3

A context-sensitive language is accepted by

Select one answer

Question 4

Problems that can be solved in polynomial time are called

Select one answer

Question 5

The time complexity of constructing an LR parser is __________, given |n| is the size of the grammar.

Select one answer

Question 6

The grammar S → XYZ
Y. val = X. val
Y. val = S. val
Y. val = Z. val is

Select one answer

Question 7

Pick the right sequence of abstract machines according to their increasing order of the power.

Select one answer

Question 8

A symbol table in assembler contains

Select one answer

Question 9

Which of the following is not a common type of data flow analysis performed by compilers?

Select one answer

Question 10

The grammar that is used to accept L = {ai bj | i > j} is given by :

Select one answer

Continue practising

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.

Karnataka SET (KSET) practice pack

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.