Register

TRUE/FALSE

747 views
0 0 votes
1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT).

I think it is true because for BU implementation of L-attributed definition it must be based on LL(1) grammar.and we can convert every LL(1) based SDT into postfix SDT.And if this is not the case then we will get different outputs during BU and TD parsing and this case is not desired in SDT.

please share your views.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Draw PDA for thisNext → · Asymptotic notation
← Previous in category · Operator PrecedenceNext in category → · Self doubt
Position:
Show:

Related questions

0 0 votes
3 answers 3 answers
3.9k
3.9k views
radha gogia asked May 6, 2018
3,864 views
what is true about the syntax directed translation scheme given below :
S->aSb { S.c=S.c+2 }S->bSa { S.c=S.c+2 }S->epsilon {S.c=0 } 1. Equal no of a's and b's .2. No of a's or no of b's in a given string .3. No of a's and no of b's in a given...
8 8 votes
2 2 answers
1.4k
1.4k views
gatecse asked Feb 23
1,418 views
GATE CSE 2026 | Set 1 | Question: 43
​​​​​​Consider the following two syntax-directed definitions $\text{SDD1}$ and $\text{SDD2}$ for type declarations. SDD1Grammar (G1)Semantic Rules$D \rightarrow T\ V$$D.t...
2 2 votes
1 answers 1 answer
719
719 views
Wren Oswin asked Oct 23, 2025
719 views
Compiler Design SDT - ISRO MadeEasy mock
Consider the following SDT:S - T RR - {printf("*")} + T {printf("*")} R {printf("+")}T - num {printf("*")}R - ε {printf("+")}How many * will be printed before the first +...