Compiler Design: Parsing

Question

Answer 1

• It is not LR( 1) so option a is true.

• It is SLR hence it is also LALR,CLR also.

Comments

What answer u got? it is option
a) or d)?

---

2nd state will contain

${S->L.=R}$

${R->L.}$

Since follow of R{$,=}

So there must be shift reduce conflict and hence it should not be SLR(1)

---

$\{ I am getting this DFA and 

according to this DFA it should be CLR and not LALR but the answer is D}$

Answer 2

option d is correct 

Comments

@Ananya  why u didn't add the lookaheads

In L-->.*R,=|$

   L=.Id,$|=

As there is .(dot) At the beginning of L

In R->.L,$ so L production will be added again and then DFA will look like this 

$ANSWER is D$

---

i mentioned there the states to combine which will give the final dfa with al the lookaheads incorpoarted in respective states.

---

Yeah that is ok but what about initial state  in initial state( L )productionshould contain $ |= entry

---

yes that's my mistake. thanks for pointing out.

Answer 3

if an G is LL(1) then it will be LALR(1)

now ,the given G is not LL(1),so its not LALR(1). option C and D are eliminated .

so option might be either  A or B

Answer 4

it is both LR(1) as well as LALR(1).