Register

Recent questions tagged parsing

1 votes
1 answer
92
NIELIT Scientific Assistant A 2020 November: 69
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________. Shift-reduce conflict Shift-Shift conflict Both “Shift-reduce conflict” & “Shift-Shift conflict” None of the options
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________.Shift-reduce conflictShift-Shift conflictBoth “Shift-reduce conflict” & “Shift-Shift conf...
User Avatar
1 votes
1 answer
93
NIELIT Scientific Assistant A 2020 November: 94
Shift reduce parsing can also be called as: Reverse of the Right Most Derivation Right Most Derivation Left Most Derivation None of the options
Shift reduce parsing can also be called as:Reverse of the Right Most DerivationRight Most DerivationLeft Most DerivationNone of the options
User Avatar
1 votes
4 answers
94
NIELIT Scientific Assistant A 2020 November: 118
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________ Both same in power Both simulate reverse of right most derivation Both simulate reverse of left most derivation Incomparable
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________Both same in powerBoth simulate reverse of right most derivationBoth simulate reverse of left most derivat...
User Avatar
1 votes
1 answer
95
NIELIT 2016 MAR Scientist C - Section C: 11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence
The most powerful parser is$\text{SLR}$$\text{LALR}$Canonical $\text{LR}$Operator-precedence
User Avatar
1 votes
1 answer
96
NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these
$\text{YACC}$ builds up$\text{SLR}$ parsing tableCanonical $\text{LR}$ parsing table$\text{LALR}$ parsing tableNone of these
User Avatar
0 votes
6 answers
97
NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)
User Avatar
1 votes
4 answers
98
NIELIT 2016 DEC Scientist B (CS) - Section B: 40
A top down parser generates Left most derivation Right most derivation Left most derivation in reverse Right most derivation in reverse
A top down parser generatesLeft most derivationRight most derivationLeft most derivation in reverseRight most derivation in reverse
User Avatar
0 votes
1 answer
99
UGC NET CSE | December 2005 | Part 2 | Question: 32
A Top - down Parse generates Left most derivation Right – most derivation Right most derivation in reverse Left – most derivation in reverse
A Top - down Parse generatesLeft most derivationRight – most derivationRight most derivation in reverseLeft – most derivation in reverse
User Avatar
1 votes
3 answers
100
ISRO2020-75
A grammar is defined as $A \rightarrow BC$ $B \rightarrow x \mid Bx$ $C \rightarrow B \mid D$ $D \rightarrow y \mid Ey$ $E \rightarrow z$ The non terminal alphabet of the grammar is $\{A,B,C,D,E\}$ $\{B,C,D,E\}$ $\{A,B,C,D,E,x,y,z\}$ $\{x,y,z\}$
A grammar is defined as$A \rightarrow BC$$B \rightarrow x \mid Bx$$C \rightarrow B \mid D$$D \rightarrow y \mid Ey$$E \rightarrow z$The non terminal alphabet of the gram...
User Avatar
2 votes
0 answers
105
Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 3 (Page No. 310)
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.4$, give annotated parse trees for the following expressions: $(3+4)\ast(5+6)n.$ $1\ast2\ast3\ast(4+5)n.$ $(9+8\ast(7+6)+5)\ast 4n.$
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.4$, give annotated parse trees for the following expressions:$(3+4)\ast(5+6)n.$$1\ast2\ast3\ast(4+5)n.$$(9+8\ast(7+6)...
User Avatar
5 votes
1 answer
107
Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 1 (Page No. 309 - 310)
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.1$, give annotated parse trees for the following expressions: $(3+4)\ast(5+6)n.$ $1\ast2\ast3\ast(4+5)n.$ $(9+8\ast(7+6)+5)\ast 4n.$
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.1$, give annotated parse trees for the following expressions:$(3+4)\ast(5+6)n.$$1\ast2\ast3\ast(4+5)n.$$(9+8\ast(7+6)...
User Avatar
0 votes
1 answer
110
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 5 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid Bc\mid bBa$ $A\rightarrow d$ $B\rightarrow d$ is LR(1) but not LALR(1).
Show that the following grammar$S\rightarrow Aa\mid bAc\mid Bc\mid bBa$$A\rightarrow d$$B\rightarrow d$is LR(1) but not LALR(1).
User Avatar
0 votes
1 answer
111
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 4 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid dc\mid bda$ $A\rightarrow d$ is LALR(1) but not SLR(1).
Show that the following grammar$S\rightarrow Aa\mid bAc\mid dc\mid bda$$A\rightarrow d$is LALR(1) but not SLR(1).
User Avatar
0 votes
0 answers
112
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 3 (Page No. 278)
For the grammar of Exercise $4.7.1$, use Algorithm $4.63$ to compute the collection of LALR sets of items from the kernels of the $LR(0)$ sets of items.
For the grammar of Exercise $4.7.1$, use Algorithm $4.63$ to compute the collection of LALR sets of items from the kernels of the $LR(0)$ sets of items.
User Avatar
2 votes
0 answers
116
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 5 (Page No. 258)
Show that the following grammar: $S\rightarrow AaAb\mid BbBa$ $A\rightarrow \epsilon$ $A\rightarrow\epsilon$ is LL(1) but not SLR(1).
Show that the following grammar:$S\rightarrow AaAb\mid BbBa$$A\rightarrow \epsilon$$A\rightarrow\epsilon$is LL(1) but not SLR(1).
User Avatar
0 votes
0 answers
118
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 3 (Page No. 258)
Show the actions of your parsing table from Question $4.6.2$ on the input $aa \ast a+$.
Show the actions of your parsing table from Question $4.6.2$ on the input $aa \ast a+$.
User Avatar
Page: