2.2k views

Consider the following translation scheme.

• $S\rightarrow ER$
• $R\rightarrow ^{*}E\left \{ print('*'); \right \} R\mid \varepsilon$
• $E\rightarrow F+E\left \{ print('+'); \right \}\mid F$
• $F\rightarrow (S)\mid id \left \{ print(id.value); \right \}$

Here id is a token that represents an integer and id.value represents the corresponding integer value. For an input '$2 * 3 + 4$',  this translation scheme prints

1. $2 * 3 + 4$
2. $2 * +3 \ 4$
3. $2 \ 3 * 4 +$
4. $2 \ 3 \ 4+*$
edited | 2.2k views
0
What will be the Tree Of the above Grammar
0
what is ans now ??
0
Top-down parsing and bottom-up parsing yield different answers to this question. Can anybody confirm which one is to be followed?
0
@Vishal Top down and BU parser should always give the same result

It will be D. Make a tree and perform post order evaluation.

edited
0
The grammar also has print statements in it how to make a tree of that ??
0
I am getting C as answer.
+4
+ is having higher precedence so it need to resolved first, so (d) .

in option (c) * is having higher precedence which is wrong
0
c will not be as you have to complete the E before printing *,and to complete E you have to print the plus from F+E{print +}
0

Why to perform perform post order evaluation ??

+5
@Gabbar ,Here We need to perform left to right DFS instead of post order traversal bcz it is L-attributed SDT.

Correct Me !!!
0
I think if you go through L to R also gives the same ans....

But here { } are evaluated after  left and Right has been processed...Left right root ...so post order...
+1
@gabbar r u sure ?
0
one thing i know that ...action can be placed at any position and it executed immediately when all its left hand side symbols processed when actions are inside the production body.

when all actions are end of production body simply do post order ....

if you know than tell us ! i know this much !
0
0

I think in order traversal is performed means when we first time visit the node then associated value with node will be printed

+1

If we evaluate it from Left to Right we get C as answer, i believe there is some ambiguity in question. Here is parse tree

+1
@Arjun sir, I am not finding any method to implement this SDT during any kind of parsing.

1) given grammer is not $LL(1)$ because of this production $E->F+E | F$, so top down parsing is not possible.

2) given grammar is $L$ attributed grammar and Only for the $L$ attributed grammar made from $LL(1)$ we can always gurantee BUP.so BUP is also not possible.

because of this reason, @stblue I think, we are getting two different trees for this.
0
As can be seen in the screenshot of pdf attached by saurabh, it is confirmed that its L attributed (as semantic actions are placed anywhere). L attributed SDT is parsed in depth first form. But I am not sure how it should evaluate the semantic actions. Should it be evaluated in postfix order or prefix order? Postfix indeed gives option d. However why we should resort to postfix order ? Can anyone summarize the whole solution?
clearly here {} is present in between the variables in r.h.s hence we will go for top down parsing as it is L-attributed. Now refer the best answer for the figure.

My Guesstimation: ..Usuallhy in this typ of question we perform top down left to right... but here  { } is given in between...so this is S-attributed grammer(use bottom up parsing)

1
2