280 views
0 votes
0 votes
Consider the following translation scheme:

$S \rightarrow R + E\{S.val = R.val + E.val\}$

$R \rightarrow R * E\{R.val = R.val + E.val\}$

$E \rightarrow F \{E.val + F.val\}$

$F \rightarrow id\{F.val = id.val\}$

The above SDT is___________.

(A) S-attributed grammar but not L-attributed

(B) L-attributed grammar but not S-attributed

(C) Both S-attributed and L-attributed grammar

(D) None of the above

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
2
focus _GATE asked May 25, 2015
394 views
what is the output of pro..??#ifndef include<stdio.h>void main(){#endifprintf("%d",900*90/90);}
0 votes
0 votes
0 answers
4
`JEET asked Jan 16, 2019
161 views
A man borrows Rs. 12,500 at 20% compound interest. At the end of every year he pays Rs. 2000 as part repayment. How much does he still owe after three such installments?