GATE CS 2017 (Afternoon) — Question 16

Theory of Computation (TOC)Context-Free Grammars & Push-Down AutomataMCQ1 mark · −1/3 if wrongMedium

Identify the language generated by the following grammar, where \(S\) is the start variable. \(S \rightarrow XY\) \(X \rightarrow aX \mid a\) \(Y \rightarrow aYb \mid \epsilon\)
  1. A
    \(\{a^m b^n \mid m \geq n, n > 0\}\)
  2. B
    \(\{a^m b^n \mid m \geq n, n \geq 0\}\)
  3. C
    \(\{a^m b^n \mid m > n, n \geq 0\}\)
  4. D
    \(\{a^m b^n \mid m > n, n > 0\}\)
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Context-Free Grammars & Push-Down AutomataTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group