Match the following based on the language accepted by using brute force method of parsing.

1. Aa-IV, b-III , c-I, d-II
2. Ba-II, b-IV, c-I, d-III
3. Ca-I, b- IV, c-III, d-II
4. Da-II, b-III, c-I, d-IV

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. a-II, b-IV, c-I, d-III

Explanation

Each grammar generates strings of a's whose lengths grow in fixed steps, and the counts listed relate to the number of sentential forms a brute-force (exhaustive) parser may try. The matching follows the official key.