Search results for parser / GATE Overflow for GATE CSE

4 votes

2 answers

1

LL(1) Grammer
S -> (L) | a L -> L . S | S Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.

S - (L) | aL - L . S | SQuestion: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.

kyrierose

28.6k views

kyrierose asked Jun 13, 2017

4 votes

0 answers

2

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 53
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?

The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?

GO Classes

921 views

GO Classes asked Feb 5

4 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 54
Consider the following grammar given below. ... the last character of the string: $a^* b($ $\operatorname{CC}($ $\mathrm{BC}($ $\mathrm{CB}$ $\mathrm{BB}$

Consider the following grammar given below.$$\begin{aligned}& A \rightarrow B+A \\& A \rightarrow B \\& B \rightarrow C B \\& B \rightarrow C \\& C \rightarrow D^* \\& C ...

GO Classes

770 views

GO Classes asked Jan 13

5 votes

1 answer

4

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 34
$ \begin{aligned} & S \rightarrow S1 \;T \\ & S 1 \rightarrow a \mid(S S) \\ & T \rightarrow \varepsilon \mid b \;T \end{aligned} $ In the $\text{LL(1)}$ parser table, $M$ ... $\{T \rightarrow \varepsilon\}$ $\{S 1 \rightarrow a\}$ and $\{T \rightarrow \varepsilon\}$

$$\begin{aligned}& S \rightarrow S1 \;T \\& S 1 \rightarrow a \mid(S S) \\& T \rightarrow \varepsilon \mid b \;T\end{aligned}$$In the $\text{LL(1)}$ parser table, $M$, of...

GO Classes

456 views

GO Classes asked Jan 21

4 votes

1 answer

5

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 39
Consider the following grammar $ \begin{aligned} & A \rightarrow B B \\ & B \rightarrow b \end{aligned} $ Suppose we draw an $\operatorname{LR}(0)$ automatan for the given grammar then which of the ... transitions There is exactly one state with $2$ incoming transitions There is exactly one state with $3$ outgoing transitions

Consider the following grammar$$\begin{aligned}& A \rightarrow B B \\& B \rightarrow b\end{aligned}$$Suppose we draw an $\operatorname{LR}(0)$ automatan for the given gra...

GO Classes

378 views

GO Classes asked Jan 28

3 votes

1 answer

6

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 27
Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exhibit uncertainty in ... The parser may perform reduction without generating any conflict. The parser may execute a shift operation without generating any conflict.

Suppose there is a handle on the top of the stack at some point in time while performing $\text{LR(k)}$ parsing. In this context, a cetrain $\text{LR(k)}$ parsers may exh...

GO Classes

531 views

GO Classes asked Jan 13

0 votes

1 answer

7

Which of the following is LL(1) grammar?
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$ B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow \varepsilon $ C) $E\rightarrow E+E\mid (E) \mid id$

A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow...

rexritz

617 views

rexritz asked Oct 22, 2023

1 votes

2 answers

8

UGC NET CSE | June 2019 | Part 2 | Question: 74
Shift-reduce parser consists of input buffer stack parse table Choose the correct option from those given below: a and b only a and c only c only a, b and c

Shift-reduce parser consists ofinput bufferstackparse tableChoose the correct option from those given below:a and b onlya and c onlyc onlya, b and c

Arjun

4.1k views

Arjun asked Jul 2, 2019

1 votes

5 answers

9

When LALR(1) is constructed form CLR(1) does not contain any shift reduce conflicts?

Soumyashree

6.9k views

Soumyashree asked Dec 4, 2015

0 votes

1 answer

10

self doubt compiler desgine
we know that LL(1)$\subseteq$ LR(1) LL(2)$\subseteq$ LR(2) LL(3)$\subseteq$ LR3) LL(4)$\subseteq$ LR(4)…..ANd so on can we say that LL(1)$\subseteq$ LR(2) or LL(2)$\subseteq$ LR(1). 1,2 are the lookahead .

we know that LL(1)$\subseteq$ LR(1) LL(2)$\subseteq$ LR(2) LL(3)$\subseteq$ LR3) LL(4)$\subseteq$...

jugnu1337

192 views

jugnu1337 asked Aug 13, 2023

3 votes

3 answers

11

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar

Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...

Arjun

3.2k views

Arjun asked Jan 26, 2019

6 votes

3 answers

12

GATE CSE 2022 | Question: 19
Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals. $S' \rightarrow S$ $S \rightarrow S + R\; |\; R$ $R \rightarrow R {\ast} P \;| \;P$ $P \rightarrow (S)\; |\; \text{id} $ If $I_{0}$ is ... $\{ [S' \rightarrow S.], [S \rightarrow S. + R] \}$, then $\textit{goto(closure}(I_{0}), +)$ contains exactly ______________ items.

Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals.$S’ \rightarrow S$$S \rightarrow S + R\; |\; R$$R \rightarrow R {\ast} P \;...

Arjun

7.3k views

Arjun asked Feb 15, 2022

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