Dark Mode

Recent questions tagged parsing

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

212 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

165 views

0 votes

1 answer

3

Compiler Design self Doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)" What is meaning of this statement exactly and does it hold always? My Assumptions: If a grammar is right linear grammar then it can be parser by LL(1) ->I ... right linear grammar. But this is not suffice to make grammar LL(1). Correct if I assumed anything wrong with some intutive answer.

vishnu777 asked in Compiler Design Nov 25, 2022

126 views

0 votes

1 answer

4

Compiler Design (Parsing)
S -> L = R S -> R L -> * R L -> id R -> L Is given CFG LR(0) & SLR(1)?

Kartheek8899 asked in Compiler Design Oct 14, 2022

by Kartheek8899

178 views

0 votes

1 answer

5

neelesh123 asked in Theory of Computation Sep 16, 2022

120 views

0 votes

0 answers

6

Best Open Video Playlist for Parsing Topic | Compiler Design
Please list out the best free available video playlist for Parsing Topic from Compiler Design as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can ... but standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 18, 2022

by makhdoom ghaya

64 views

0 votes

1 answer

7

How many parse tree can be constructed for the given ambiguous grammar?
E--> E+E E--> E*E E--> id Input string: id + id + id

Yogendraa asked in Compiler Design Jun 9, 2022

244 views

0 votes

2 answers

8

Is the following grammar LL(1) ?
Is the following grammar LL(1) ? S→ aABbCD | ϵ A→ ASd | ϵ B→ Sac| hC | ϵ C→ Sf |Cg D→ aBD | ϵ Draw the LL(1) parsing table for the given grammar.

Subhrangsu asked in Compiler Design Apr 17, 2022

1.8k views

0 votes

1 answer

9

Compute FIRST and FOLLOW sets
Compute FIRST and FOLLOW sets: S→ aAC | bB A→ Abc| Abd | e B→ f | g C→ h | i

Subhrangsu asked in Compiler Design Apr 15, 2022

287 views

7 votes

1 answer

10

GATE CSE 2022 | Question: 3
Which one of the following statements is $\text{TRUE}?$ The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$ parser for $\textit{G}$ does not have reduce-reduce ... Data flow analysis is necessary for run-time memory management. $\textit{LR}(1)$ parsing is sufficient for deterministic context-free languages.

Arjun asked in Compiler Design Feb 15, 2022

by Arjun

3.5k views

6 votes

3 answers

11

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.1k views

0 votes

2 answers

12

made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}

atulcse asked in Compiler Design Jan 16, 2022

401 views

2 votes

2 answers

13

Self doubt in CLR(1)
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?

s_dr_13 asked in Compiler Design Jan 3, 2022

309 views

0 votes

2 answers

14

Made Easy test series
SR conflict in LR(0) and SLR(1) will always be equal for some context free grammar?

Nitesh_Yadav asked in Compiler Design Dec 22, 2021

by Nitesh_Yadav

802 views

Page:

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

Recent questions tagged parsing