Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Match the following based on the language accepted by using brute force method of parsing.
|
LIST - I |
LIST - II |
||
|
A. |
S → aSa | aa |
I. |
((2n * 3) - 4) ; n ≥ 1 |
|
B. |
S → aaSaa | aa |
II. |
2n ; n ≥ 1 |
|
C. |
S → aaaSaaa | aa |
III. |
((4 * 2n) - 6) ; n ≥ 1 |
|
D. |
S → aaaaSaaaa | aa |
IV. |
2n - 2 ; n ≥ 2 |
Choose the correct answer from the options given below:
1
A - IV, B - III, C - I, D - II
2
A - II, B - IV, C - I, D - III
3
A - I, B - IV, C - III, D - II
4
A - II, B - III, C - I, D - IV