Match List – I with List – II. List – I List – II P. LL(1) I. Turing Machine…
2025
Match List – I with List – II.
List – I List – II
P. LL(1) I. Turing Machine
Q. Halting Problem II. Finite Automata
R. A → aB | a, a ∈ T, A, B ∈ V III. Chomsky Normal Form
S. A → BC | a, a ∈ T, A, B, C ∈ V IV. Recursive Descent Parser
Answer: A. P – IV, Q – I, R – II, S – III
- A.
P – IV, Q – I, R – II, S – III
- B.
P – I, Q – II, R – III, S – IV
- C.
P – III, Q – I, R – II, S – IV
- D.
P – II, Q – IV, R – III, S – I
Attempted by 28 students.
Show answer & explanation
Correct answer: A
Explore the full course: Mppsc Assistant Professor Computer Science Paper 2