Dark Mode

Recent questions tagged lr-parser

0 votes

1 answer

1

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?

Souvik33 asked in Compiler Design Jan 1

216 views

0 votes

1 answer

2

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)

Souvik33 asked in Compiler Design Dec 11, 2022

167 views

0 votes

1 answer

3

neelesh123 asked in Theory of Computation Sep 16, 2022

120 views

6 votes

3 answers

4

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.

Arjun asked in Compiler Design Feb 15, 2022

by Arjun

3.2k views

1 vote

4 answers

5

#self doubt
Every unambiguous grammar is LR(0) grammar?

samarpita asked in Compiler Design Nov 18, 2021

435 views

8 votes

1 answer

6

GATE CSE 2021 Set 2 | Question: 51
Consider the following augmented grammar with $\{ \#, @, <, >, a, b, c \}$ ... $\text{GOTO(GOTO}(I_0<), <)$ is ___________

Arjun asked in Compiler Design Feb 18, 2021

by Arjun

3.8k views

8 votes

2 answers

7

GATE CSE 2021 Set 1 | Question: 5
Consider the following statements. $S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$. $S_2:$ For any context-free grammar, there is a parser that takes at most $O(n^3)$ time to parse a ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false

Arjun asked in Compiler Design Feb 18, 2021

by Arjun

5.0k views

Page:

1
2
3
4
5
6
...
8
next »

Recent questions tagged lr-parser