Recent questions tagged parsing / GATE Overflow for GATE CSE

0 votes

0 answers

61

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 ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

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...

makhdoom ghaya

274 views

makhdoom ghaya asked Aug 18, 2022

0 votes

3 answers

62

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

E E+EE E*EE idInput string: id + id + id

Yogendraa

1.1k views

Yogendraa asked Jun 9, 2022

2 votes

2 answers

63

Subhrangsu

9.5k views

Subhrangsu asked Apr 16, 2022

0 votes

1 answer

64

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

Compute FIRST and FOLLOW sets:S→ aAC | bBA→ Abc| Abd | eB→ f | gC→ h | i

Subhrangsu

2.3k views

Subhrangsu asked Apr 15, 2022

9 votes

1 answer

65

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.

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)$...

Arjun

7.4k views

Arjun asked Feb 15, 2022

6 votes

3 answers

66

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

0 votes

2 answers

67

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)}

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

atulcse

904 views

atulcse asked Jan 16, 2022

2 votes

2 answers

68

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?

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

500 views

s_dr_13 asked Jan 3, 2022

0 votes

2 answers

69

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

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

Nitesh_Yadav

1.2k views

Nitesh_Yadav asked Dec 22, 2021

3 votes

1 answer

70

#compiler-design
Design predictive parsing table for below grammar. How many multiple entries are there? S → AA | ab A → Bd | ε B → SB | d

Design predictive parsing table for below grammar.How many multiple entries are there?S → AA | abA → Bd | εB → SB | d

Crackca

631 views

Crackca asked Sep 18, 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