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
Question 2
A grammar is called ambiguous if
Question 3
A context-sensitive language is accepted by
Question 4
Problems that can be solved in polynomial time are called
Question 5
The time complexity of constructing an LR parser is __________, given |n| is the size of the grammar.
Question 6
The grammar S → XYZ
Y. val = X. val
Y. val = S. val
Y. val = Z. val is
Question 7
Pick the right sequence of abstract machines according to their increasing order of the power.
Question 8
A symbol table in assembler contains
Question 9
Which of the following is not a common type of data flow analysis performed by compilers?
Question 10
The grammar that is used to accept L = {ai bj | i > j} is given by :
Previous papers with Theory of Computation and Compilers questions
Karnataka SET (KSET) practice pack
The practice pack for Karnataka SET (KSET) is coming soon to LawMint.