LALR(1) Parser

Question

Which one of the following is true about LALR(1) Parser ?

• A. It can resolve SR Conflict in favor of reduced
• B. It can resolve SR Conflict in favor of Shift
• C. It can resolve RR Conflict in favor of reduced
• D. It can resolve RR Conflict in favor of shift

Comments

Please Explain Every point :)

---

In LALR(1) parser(same as Yacc) 

For S/R conflict it resolves in favour of shift.

For R/R conflict it resloves in favour of any reduce from both.

Option b) is correct.

One more option possible => Depends on the situation of conflict (If this is there it is most appropriate.

For more details follow link:-  https://gateoverflow.in/33619/which-type-of-compiler-conflict-is-detected-and-resolving-it

---

For SR Conflict i got , explain for RR Conflcit , any reference for rr conflict

---

I am not finding reference right now but I am 100% sure

In RR conflict it can be resolved in favour of any of the reduce not for a particular reduce thatwise c) is not answer.

In c) they are saying RR conflicts in favour of reduce( not mentioning that which reduce )

---

Read this one

https://gateoverflow.in/1405/gate2005-83a

---

Refer : https://gateoverflow.in/1405/gate2005-83a

In case of RR Conflict we reduce using the first production that comes textually in the grammar.

Here : https://gateoverflow.in/87037/gate2005-83b

Thats why when we have :   E x  E +  E   -----(RR Conflict and E+E comes first HENCE) ==> (E X (E + E)) SO answer is 9 

Correct me if i am wrong :)

---

@Ravi Kumar Singh

i think RR conflict are resolved in the faver of First Reduce