Match the following:

a. Regular Sets	i. Parsing
b. Deterministic CFL	ii. Semantics
c. CFL	iii. Finite Automata
d. Context Sensitive Language	iv. Statistically determinable and verifiable
e. Recursive Set	v. Syntax Specification

(A) a-iii, b-i, c-ii, d-v, e-iv
(B) a-iii, b-i, c-v, d-ii, e-iv
(C) a-v, b-iii, c-i, d-ii, e-iv
(D) a-ii, b-iii, c-v, d-iv, e-i

Answer

(B) a-iii, b-i, c-v, d-ii, e-iv

thumbs up down

Vimal Singh @vimal

16 Dec 2015 08:55 pm

How ? Can anyone please explain ?

Pages