Recent questions tagged lr-parser / GATE Overflow for GATE CSE

4 votes

1 answer

1

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

377 views

GO Classes asked Jan 28

3 votes

1 answer

2

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

530 views

GO Classes asked Jan 13

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

769 views

GO Classes asked Jan 13

0 votes

1 answer

4

Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions: X → X+Y | Y Y→ Y*Z | Z Z → (X) Z → id If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?

Let G be any grammar with the following productions:X → X+Y | YY→ Y*Z | ZZ → (X)Z → idIf LR(1) parser is used to parse the above grammar, then total how many look...

Souvik33

852 views

Souvik33 asked Jan 1, 2023

0 votes

1 answer

5

Parsing Table | Shift Reduce Parsers | Numerical Answer
Consider the following statements regarding the Parsing Table of a shift reduce parser, for any given grammar No. of states/ size of parse table is same for all Shift-Reduce Parsers. No. of states/ size of parse table in LR(0), SLR(1 ... CORRECT statement is _______ (For example, if statement 1 and 7 are correct, answer would be 1+7, i.e. 8)

Consider the following statements regarding the “Parsing Table” of a shift reduce parser, for any given grammarNo. of states/ size of parse table is same for all Shif...

Souvik33

688 views

Souvik33 asked Dec 11, 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