Register

#selfdoubt #SLR & LALR

288 views
0 votes
0 votes
Can LALR have more reduce entries than SLR ?

As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less than or equal to those in SLR.

Is it correct?, please verify.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
Na462 asked Jan 19, 2019
908 views
LALR(1) Parser
Which one of the following is true about LALR(1) Parser ? It can resolve SR Conflict in favor of reduced It can resolve SR Conflict in favor of Shift It can resolve RR Conflict in favor of reduced It can resolve RR Conflict in favor of shift
Which one of the following is true about LALR(1) Parser ?It can resolve SR Conflict in favor of reducedIt can resolve SR Conflict in favor of ShiftIt can resolve RR Confl...
User Avatar
2 votes
2 votes
1 answer
2
sripo asked Nov 10, 2018
3,258 views
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
User Avatar
1 votes
1 votes
1 answer
3
srestha asked Jun 17, 2018
1,396 views
SR conflict in LALR(1)
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$ It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?...
User Avatar
Link Copied!