parser

Question

1)shift e

2)reduce the configuration

3)sr conflict

4)rr conflict

---

Ques 2 In LL(1) parsing algorithm let X is the topmost symbol of the stack  and "a" is a lookahaed symbol then which condition will require to operate only  pop on stack

1)X=a=$

2)X=a <>$

3)X<>a<>$

4)none 

Answer 1

Solution 1: you didn't mention about the type of the parser, so I am assuming you're talking about LR(0) parser.

It should S/R conflict. because parser can't decide whether to shift 'e' or reduce 'iEtS' to S.

Solution 2:
X = TOS Symbol
a = Look Ahead Symbol

1) X=a=$   is acceptence condition.
2) X is a terminal and it will be removed from the stack, and 'a' will point to the next input symbol
3) This is when TOS is a variable, Variable will be replaced with its RHS part.

Hence, 2) seems correct answer!
 

Comments

if the given solution is correct then you should accept it, so that other can believe it's correct.

---

accepted :)

---

thanks!