The GATE Grind

GATE 2008 CS – Question 51

Theory of Computation · Context-Free Grammars and Pushdown Automata · 2 marks · Multiple choice

Match E: declarations precede identifier use; F: formal and actual parameter counts agree; G: arithmetic expressions with matched parentheses; H: palindromes. Models: P=$\{a^n b^m c^n d^m\mid n,m\ge1\}$; Q grammar $X\to XbX\mid XcX\mid dXf\mid g$; R=$\{wcw\mid w\in\{a,b\}^*\}$; S grammar $X\to bXb\mid cXc\mid\epsilon$.

  1. E–P, F–R, G–Q, H–S
  2. E–R, F–P, G–S, H–Q
  3. E–R, F–P, G–Q, H–S
  4. E–P, F–R, G–S, H–Q

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) E–R, F–P, G–Q, H–S

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Context-Free Grammars and Pushdown Automata questions

All Context-Free Grammars and Pushdown Automata questions →