West Bengal SET (WB SET) Theory of Computation and Compilers Previous Year Questions
Try the preview and open any solution for a worked explanation.
West Bengal SET (WB SET) practice pack
The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.
Question 1
Symbol tables during compilation of a program are efficiently implemented using:
Question 2
In programming language implementation, lexical analysis is responsible for:
Question 3
Given Grammar G:
(i) S → AS
(ii) S → AAS
(iii) A → SA
(iv) A → aa
Which of the following productions deny the format of Chomsky normal form?
Question 4
Which of the following denotes Chomsky hierarchy?
Question 5
Consider the grammar:
E → E + T | T
T → T * F | F
F → (E) | id
Which of the following is true?
Question 6
Let A = {< M, W> | M is a Turing Machine and M accepts W}. What is the correct classification of A?
Question 7
Match the following concepts with their correct properties:
| Concept | Properties |
|---|---|
| (P) DFA | (i) Allows ε-transitions (no input consumed) |
| (Q) ε-NFA | (ii) Accepted by both deterministic and non-deterministic models |
| (R) NFA to DFA conversion | (iii) Deterministic transitions only |
| (S) Regular languages | (iv) Subset construction |
Question 8
Consider the following language:
then L is:
Question 9
Which of the following languages is accepted by a 2-stack PDA but not a 1-stack PDA?
Question 10
Which of the following grammars generates
?
Previous papers with Theory of Computation and Compilers questions
West Bengal SET (WB SET) practice pack
The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.