Home › Previous year questions › GATE 2008 CS › Question 51GATE 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$.
E–P, F–R, G–Q, H–S E–R, F–P, G–S, H–Q E–R, F–P, G–Q, H–S 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 GATE 2007 CS Q30 – Over 0, 1, 2, L=\0i21i i0\ is GATE 2007 CS Q78 – CFG has nonterminals S, A, B, terminals a, b, start S, rules S aB bA, B b bS aBB, A a aS… GATE 2007 CS Q79 – CFG has nonterminals S, A, B, terminals a, b, start S, rules S aB bA, B b bS aBB, A a aS… GATE 2026 CS (CS1) Q25 – Consider the following grammar where S is the start symbol, and a and b are terminal… GATE 2026 CS (CS1) Q52 – Consider the following context-free grammar G: S abaABAbba A aaB BAb bB a b a a B aBb ab… GATE 2026 CS (CS2) Q29 – Which of the following grammars is/are ambiguous? All Context-Free Grammars and Pushdown Automata questions →