| List-I | List-II |
| A. $A\rightarrow aB\ |\ a,\ a\in T,\ A,B\in V$ | I. Recursive Descent Parser |
| B. $A\rightarrow BC\ |\ a,\ a\in T,\ A,B,C\in V$ | II. Turing Machine |
| C. $LL(1)$ grammar | III. Chomsky Normal Form |
| D. Halting problem | IV. Finite Automata |
$A\rightarrow aB|a$ → Regular grammar → Finite Automata → IV
$A\rightarrow BC|a$ → Chomsky Normal Form → III
$LL(1)$ grammar → Recursive Descent Parser → I
Halting problem → Turing Machine → II
Matching:
$A\rightarrow IV$
$B\rightarrow III$
$C\rightarrow I$
$D\rightarrow II$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.