Match the column

Match List - I with List - II.

Choose the correct answer from the options given below:

Correct option is A

A. A → aB ∣ a, a ∈ T, A, B ∈ V - IV. Finite Automata
B. A → BC ∣ a, a ∈ T, A, B, C ∈ V - III. Choamsky Normal Form
C. LL (1) grammar - I. Recursive Descent Parser
D. Halting problem - II. Turing Machine
These matches relate to various concepts in grammars and automata theory.