Register

Recent questions tagged lr-parser

6 votes
7 answers
211
Number of conflict
Consider the grammar given below S⟶ SS | a | ∈ The number of inadequate states in the DFA of LR(1) items is (a) 1 (b) 2 (c) 3 (d) 4
Consider the grammar given belowS⟶ SS | a | ∈The number of inadequate states in the DFA of LR(1) items is(a) 1 (b) 2 (c) 3 (d) 4
User Avatar
1 votes
2 answers
212
How do we find out whether a given grammer is SLR(1) or LR(0).
Consider the following grammer: S-> aAb | Sc A-> d | Sd | S The above grammer is: a) SLR(1) b) LL(1) c) LR(0) d) none of the above
Consider the following grammer:S- aAb | ScA- d | Sd | SThe above grammer is:a) SLR(1)b) LL(1)c) LR(0)d) none of the above
User Avatar
0 votes
1 answer
213
LALR vs. CLR vs. SLR
Could someone please help me check the conflicts in LALR parser. I never understand the difference between these CLR and LALR. and because of this i even forget the SLR parser. please if someone can explain it easily?
Could someone please help me check the conflicts in LALR parser. I never understand the difference between these CLR and LALR. and because of this i even forget the SLR p...
User Avatar
1 votes
3 answers
214
LR(1) states
Here what will be the lookahead for first state? Here is given answer:
Here what will be the lookahead for first state?Here is given answer:
User Avatar
0 votes
1 answer
215
shift reduce
User Avatar
0 votes
1 answer
217
Compiler question
I did in this way : There is conflict , right ? As A -> g. and B -> g. both going to $ and g
I did in this way :There is conflict , right ? As A - g. and B - g. both going to $ and g
User Avatar
0 votes
1 answer
218
Is there three SR conflict in the CLR(1) grammar
Will not there be 3 SR conflicts in CLR(1) reduction ? In fact their ans also says this : In the state I1 , will it not be SR conflict ?
Will not there be 3 SR conflicts in CLR(1) reduction ?In fact their ans also says this :In the state I1 , will it not be SR conflict ?
User Avatar
0 votes
1 answer
219
parsing
User Avatar
0 votes
1 answer
220
Test Series Qs Compiler Design LR(0)
Consider the following grammar. S $\rightarrow$ (S)S | ∊ How many conflicts occur in LR (0) parser for the above grammar?
Consider the following grammar. S $\rightarrow$ (S)S | ∊How many conflicts occur in LR (0) parser for the above grammar?
User Avatar
2 votes
1 answer
221
Slr(1)
S->aAb/aBc/bAd/bBe A->g B->g How many states in slr(1)
S->aAb/aBc/bAd/bBeA->gB->gHow many states in slr(1)
User Avatar
2 votes
1 answer
222
Conflict
If lalr(1) has no conflict then clr(1) never contain any conflict It is true or false If it is false explain
If lalr(1) has no conflict then clr(1) never contain any conflictIt is true or falseIf it is false explain
User Avatar
0 votes
1 answer
223
Lr(k)
User Avatar
0 votes
1 answer
225
Parsing2
Can a grammar which is not LL can be SLR? where will you fit LL in sequence below: LR(0) => SLR => LALR => LR * => stands for implies
Can a grammar which is not LL can be SLR?where will you fit LL in sequence below:LR(0) = SLR = LALR = LR * = stands for implies
User Avatar
0 votes
1 answer
226
Parsing
Can anybody enumerate the similarities and dissimilarities between LL, SLR, LALR and LR parsers.
Can anybody enumerate the similarities and dissimilarities between LL, SLR, LALR and LR parsers.
User Avatar
0 votes
1 answer
227
SR conflict
Which of the following set could result SR conflict in LALR(1)? a) A→ a.b, {b} B→ a. , {a} b) A→ a.a , {a} B→ a. , {b} c) A→ b.a , {b} B→ b.,{a} d) A→ b.b , {a} B→ b. , {a}
Which of the following set could result SR conflict in LALR(1)?a) A→ a.b, {b} B→ a. , {a}b) A→ a.a , {a} B→ a. , {b}c) A→ b.a , {b} B→ b.,{a}d) A→ b...
User Avatar
1 votes
2 answers
228
Compiler
Consider the following grammer S→ bAd /bBe A→a B→a The above grammer is ________________ 1) SLR(1) 2) LALR(1) but not SLR(1) 3) CLR(1) but not LALR(1) d) Not LR(1)
Consider the following grammerS→ bAd /bBeA→aB→aThe above grammer is ________________1) SLR(1)2) LALR(1) but not SLR(1)3) CLR(1) but not LALR(1)d) Not LR(1)
User Avatar
1 votes
3 answers
229
SR conflict
Which of the following could result in Shift-Reduce conflict in LR(0) parser? 1){ A→ b.c ,B→b. } 2){A→a.b,B→b. } 3) {A→∊. , B→.a} 4)All of these
Which of the following could result in Shift-Reduce conflict in LR(0) parser?1){ A→ b.c ,B→b. }2){A→a.b,B→b. }3) {A→∊. , B→.a}4)All of these
User Avatar
0 votes
2 answers
230
CLR
S'→S S→A/B A→fAi/n B→fBii/d For the above augmented grammer , the number of states in LR(1) parser are_______________
S'→SS→A/BA→fAi/nB→fBii/dFor the above augmented grammer , the number of states in LR(1) parser are_______________
User Avatar
0 votes
1 answer
231
LR(1) parser query 1
Ques:- Check whether the following grammar is clr(1) grammar or not or lalr grammar or not. S -> (S) S -> a Problem- The work( for checking the given grammar is LR(1) or not) done by me as shown in figure....is it right approach for LR(1)?
Ques:- Check whether the following grammar is clr(1) grammar or not or lalr grammar or not.S - (S)S - aProblem-The work( for checking the given grammar is LR(1) or not) d...
User Avatar
Page: