Test by Bikram | Compiler Design | Test 1 | Question: 13

Question

Consider following Translation Scheme:
$S \rightarrow ER$
$R \rightarrow ^* E \{ print \{' *' \}; \} R \mid \epsilon$
$E \rightarrow F + E \{ print ('+');\} \mid F$
$F \rightarrow S \mid id \{ print (id,value) ; \}$

Here, $id$ is a taken that represents an integer and id, $value$ represents the corresponding integer value. 

What does this Translation Scheme print for an input " $1* 7 + 9$ "?

• A. $1 7*  + 9$
• B. $1 * 7 9 +$
• C. $1 7 9 * +$
• D. $179 + *$

Answer 1

Here is the parse tree