Question 11384 – Compiler-Design
May 17, 2024Question 11444 – Compiler-Design
May 17, 2024Question 11424 – Compiler-Design
The following grammar is:
S → Aa | bAc | Bc | bBa A → d B → d
Correct Answer: D
Question 325 Explanation:
Let’s draw automata for LR(1),
Since there is no RR or SR conflict hence the given grammar is LR(1).
Now, for LALR(1) let’s combine I1 & I3,
Since there is RR conflict in state I13, hence not LALR(1).
Since there is no RR or SR conflict hence the given grammar is LR(1).
Now, for LALR(1) let’s combine I1 & I3,
Since there is RR conflict in state I13, hence not LALR(1).
Not LR(1) but LALR(1)
Neither LR(1) nor LALR(1)
LR(1) and LALR(1)
LR(1) but not LALR(1)
Subscribe
Login
0 Comments