Bottom up parsing SDT

Question

Let ' $G$ ' be a grammar with the following translations:
\[
\begin{array}{l}
S \rightarrow \text { p\{print "G"\} } P \\
P \rightarrow \text { q\{print "A"\} } Q \\
P \rightarrow r\{\text { print " " } "\} \\
P \rightarrow \varepsilon\{\text { print "E"\} } \\
Q \rightarrow \text { s\{print "A"\} } P \\
Q \rightarrow \varepsilon\{\text { print " } O \text { " }\}
\end{array}
\]

What is the output produced for the input "pqsqsr" using the bottom-up parsing with above translations?

Comments

GAAAT or TAAAG ?

---

GAAAT

---

what will be the correct answer?

---

I think it should be GAAAAT. If the print statements were at the end of each production, then it would have been TAAAAG.

Answer 1

Ans. TAAAAG

Comments

here parse tree is correct but answer should be GAAAAT.

here in 1^st production rule,before reduction and after p, we have to perform semantic action.so when p occurs we print G

so reduction perform in bottom to up traverse as usual but semantic action perform before reduction.

Answer 2

ans is TAAAAG