Official PYQ · 2017Set 1 · Q10Context-free Grammars and Push-down AutomataMCQ1 mark

GATE CS 2017 Set 1 Q10 — Context-free Grammars and Push-down Automata

Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol: $S \rightarrow abScT \mid abcT$ $T \rightarrow bT \mid b$ Which one of the following represents the language generated by the above grammar?

View answer

Answer: B

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published 10 Oct 2026

Report a correction

GATE CS · 2026Context-free Grammars and Push-down Automata
Consider the following grammar where $S$ is the start symbol, and $a$ and $b$ are terminal symbols. $S \rightarrow a S b S \text{ | } b S \text{ | } \epsilon$ Which of the following statements is/are true?
MSQ · 1 mark
GATE CS · 2025Context-free Grammars and Push-down Automata
Consider the following context-free grammar $G$ , where $S, A$ , and $B$ are the variables (non-terminals), $a$ and $b$ are the terminal symbols, $S$ is the start variable, and the rules of $G$ are described as: $\begin{array}{l} S \rightarrow a a B \mid A b b \\ A \rightarrow a \mid a A \\ B \rightarrow b \mid b B \end{array}$ Which ONE of the …
MCQ · 1 mark
GATE CS · 2025Context-free Grammars and Push-down Automata
Which ONE of the following languages is accepted by a deteministic pushdown automaton?
MCQ · 1 mark
GATE CS · 2023Context-free Grammars and Push-down Automata
Consider the context-free grammar $G$ below $\begin{array}{l} S \rightarrow a S b \mid X \\ X \rightarrow a X \mid X b \mid a \mid b, \end{array}$ where $S$ and $X$ are non-terminals, and $a$ and $b$ are terminal symbols. The starting non-terminal is $S$ . Which one of the following statements is $\text{CORRECT}?$
MCQ · 2 marks
GATE CS · 2023Context-free Grammars and Push-down Automata
Consider the pushdown automaton $\text{(PDA)}\;P$ below, which runs on the input alphabet $\{a, b\}$ , has stack alphabet $\{\perp, A\}$ , and has three states $\{s, p, q\}$ , with $s$ being the start state. A transition from state $u$ to state $v$ , labelled $c / X / \gamma$ , where $c$ is an input symbol or $\epsilon, X$ is a stack symbol, …
MCQ · 2 marks
GATE CS · 2022Context-free Grammars and Push-down Automata
Consider the following languages: $L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$ $L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$ $L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$ Which of the following statements is/are $\text{FALSE}?$
MSQ · 2 marks

Browse this topic

More Context-free Grammars and Push-down Automata questions

GATE CS 2017 Set 1 Q10 — Context-free Grammars and Push-down Automata

Related questions