Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Match List I with List II
|
List I |
List II |
||
|
Production Rules |
Grammar |
||
|
A. |
S → XY X → 0 Y → 1 |
I. |
Greibach Normal Form |
|
B. |
S → aS| bSS |c |
II. |
Context Sensitive Grammar |
|
C. |
S → AB A → 0A | 1A | 0 B → 0A |
III. |
Chomsky Normal Form |
|
D. |
S → aAbc Ab → bA Ac → Bbcc bB → Bb aB → aa | aaA |
IV. |
S-Grammar |
Choose the correct answer from the options given below :
1
A ‐ III, B ‐ I , C ‐ IV, D ‐ II
2
A ‐ III, B ‐ II , C ‐ I, D ‐ IV
3
A ‐ III, B ‐ IV, C ‐ I, D ‐ II
4
A ‐ IV, B ‐ III , C ‐ I, D ‐ II