If an LL(1) parser carries out the SDT for a string output will be ??

Question

Comments

answer should be (c) although LL(1) is left most derivation

1st time:-

we are assing id  to left them E*E right side    // it doesn't mean we are skiping left side, somthing is assing then moving                                                             right side so it's valid

abc*|

2nd time :-

we are assing E*E left side then id directly to right // both are correct

ab|c*

Answer 1

LL(1) uses left most derivation

E ->   E     *      E

    -> E   ↑    E    * E

   -> id  ↑    E    * E

   -> id  ↑    id    * E

    -> id  ↑    id    *  id

Answer 2

Should be c..

Depends on which production is used  at starting E->E*E or E->E^E

Answer 3

Answer is B.

          E

E        ↑        E

 id             E     *      E

 a              id              id

                 b                c

 

at first print a,then b,then c ,now for b*c reduction print * and finally a↑b*c reduction print ↑

so answer abc*↑

Comments

Ans given is A

---

LL(1) uses left most derivation .

construct tree using left most derivation and then do post order traversal

@sayantan whateve tree you constructed is using right most derivation.

---

Explain it

Answer 4

answer is C bcz this is a ambiguous grammar