Recent activity by sujaygoswami / GATE Overflow for GATE CSE

13 answers

1

GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...

35.5k views

answered Dec 30, 2021

2 answers

2

GATE CSE 2005 | Question: 60
Consider the grammar: $S \rightarrow (S) \mid a$ Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The following relationship holds good: $n_1 < n_2 < n_3$ $n_1 = n_3 < n_2$ $n_1 = n_2 = n_3$ $n_1 \geq n_3 \geq n_2$

Consider the grammar:$$S \rightarrow (S) \mid a$$Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The ...

15.6k views

answered Dec 29, 2021

4 answers

3

GATE IT 2005 | Question: 39
Consider the regular grammar: $S \rightarrow Xa \mid Ya$ $X \rightarrow Za$ $Z \rightarrow Sa \mid \epsilon$ $Y \rightarrow Wa$ $W \rightarrow Sa$ where $S$ is the starting symbol, the set of terminals is $\{a\}$ and the set of non-terminals is ... automaton (DFA) to recognize the same language. What is the minimum number of states required for the DFA? $2$ $3$ $4$ $5$

Consider the regular grammar:$S \rightarrow Xa \mid Ya$$X \rightarrow Za$$Z \rightarrow Sa \mid \epsilon$$Y \rightarrow Wa$$W \rightarrow Sa$where $S$ is the starting sym...

12.3k views

commented Aug 29, 2021

6 answers

4

GATE CSE 2005 | Question: 53
Consider the machine $M$: The language recognized by $M$ is: $\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$'s} \right\}$ ... $'} \right\}$ $\left\{w \in \{a, b\}^* \text{ | $w$ does not contain $aa$' as a substring} \right\}$

Consider the machine $M$:The language recognized by $M$ is:$\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$’s} \right\}$$\left\{w \in \{...

13.3k views

commented Aug 23, 2021

9 answers

5

GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?

Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...

13.9k views

commented Aug 20, 2021

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true