Register

Recent questions tagged lr-parser

1 votes
1 answer
151
conflicts
consider a state having this L' -> L. {$} L -> L.b {$,B} does this state have SR coonflict
consider a state having thisL' - L. {$}L - L.b {$,B}does this state have SR coonflict
User Avatar
1 votes
1 answer
152
compiler
S->SAS | a A->AA | b is the grammar a) LR(0) b)SLR(1) c)LALR(1) d)none
S->SAS | aA->AA | bis the grammara) LR(0)b)SLR(1)c)LALR(1)d)none
User Avatar
2 votes
0 answers
153
Compiler Design:- Number of conflicts in LR(0)
Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)?
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
User Avatar
0 votes
0 answers
154
MadeEasy Subject Test: Compiler Design - Parsing
Let G be a grammar with the following productions. If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item in the initial state?
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
User Avatar
0 votes
1 answer
155
Ace Test Series: Compiler Design - Parsing
S -> Aa A -> Ab A -> c Which of the following item is present in LR(1) item with S' -> .S, $\$ ? A) A -> .Ab, $\$ B) A -> .c, $\$ C) A -> .Ab, a/b D) None
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
User Avatar
2 votes
2 answers
157
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
User Avatar
0 votes
1 answer
158
Parsing
Which of the following is not LR(1)? a. S->Uab|Vac U->d V->d b. S->Uab|Vab|Vac U->d V->d c.S->AB A->a B->b d. A->Ab A->a|c Please Explain.
Which of the following is not LR(1)?a. S->Uab|VacU->dV->db. S->Uab|Vab|VacU->dV->dc.S->ABA->aB->bd. A->AbA->a|cPlease Explain.
User Avatar
1 votes
0 answers
160
Doubt in CD
In bottom up parsing , if the same entry has both SR or RR moves then what is the problem? Why is it called a confict ? Why cant we just leave it like that? and Why is it not LR(0)?
In bottom up parsing , if the same entry has both SR or RR moves then what is the problem? Why is it called a confict ? Why cant we just leave it like that? and Why is it...
User Avatar
2 votes
1 answer
161
Ullman 4.3
Is this grammar ambiguous? S-->SxA|A A-->AyB|B B-->zB|(S)|m|n I cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
Is this grammar ambiguous?S >SxA|AA >AyB|BB >zB|(S)|m|nI cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
User Avatar
2 votes
2 answers
162
Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)
Ques. S Aa/bAc/dc A dWhich of them is correct. Please provide detailed information.a) LALR(1) but not SLR(1)b) Both SLR(1) and LALR(1)c) Grammar is Ambiguo...
User Avatar
1 votes
1 answer
164
Compiler parser
is this given diagram correct or incorrect if incorrect then please correct it .
is this given diagram correct or incorrect if incorrect then please correct it .
User Avatar
0 votes
1 answer
166
compiler design
the G is S-> while(E)S/a E-> a for nested while statement a.is not LR(1) b.is not SLR(1) c.is not LALR(1) d.is LR(0)
the G isS- while(E)S/aE- afor nested while statementa.is not LR(1)b.is not SLR(1)c.is not LALR(1)d.is LR(0)
User Avatar
0 votes
1 answer
167
Doubt
Where is reduce-reduce conflict here?Plz explain S→S S→SS∣a∣ϵ
Where is reduce-reduce conflict here?Plz explainS→SS→SS∣a∣ϵ
User Avatar
0 votes
2 answers
168
pune university question paper
what is difference between LALR and CLR parser?
what is difference between LALR and CLR parser?
User Avatar
1 votes
0 answers
170
Self Doubt
If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict? Reference:- https://gateoverflow.in/113114/slr-parsing-table#c113505
If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict?Reference:- https://gateoverflow.in/11...
User Avatar
0 votes
1 answer
171
YACC-
in case of shift-reduce and R-R conflict, which is favored by YACC?
in case of shift-reduce and R-R conflict, which is favored by YACC?
User Avatar
0 votes
1 answer
172
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
User Avatar
1 votes
1 answer
173
COMPILERS DOUBT
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT? CAN SOMEONE EXPLAIN??
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT?CAN SOMEONE EXPLAIN??
User Avatar
0 votes
1 answer
174
Parsing
Why in this I6 and I7 are not in same state??
Why in this I6 and I7 are not in same state??
User Avatar
1 votes
2 answers
176
parsing
State True/False : "LR(0)⊂SLR(1)⊂LALR(1)⊂LR(1)".
State True/False : "LR(0)⊂SLR(1)⊂LALR(1)⊂LR(1)".
User Avatar
0 votes
1 answer
177
parsing table space
User Avatar
0 votes
1 answer
178
compiler grammar
Give a grammar which is LL(1) but not LALR(1) .
Give a grammar which is LL(1) but not LALR(1) .
User Avatar
0 votes
1 answer
179
SLR(1) Parser
Every SLR grammar is unambiguous. True or False? Why?
Every SLR grammar is unambiguous. True or False? Why?
User Avatar
0 votes
1 answer
180
Is this grammar LL1, LR0, SLR1, LALR1, CLR1?
$S\rightarrow (x$ $\text{ }| E]$ $\text{ }| F)$ $X\rightarrow E)$ $\text{ }| F]$ $E\rightarrow A$ $F\rightarrow A$ $A\rightarrow \lambda$
$S\rightarrow (x$$\text{ }| E]$$\text{ }| F)$$X\rightarrow E)$$\text{ }| F]$$E\rightarrow A$$F\rightarrow A$$A\rightarrow \lambda$
User Avatar
Page: