Dark Mode

Recent questions tagged syntax-directed-translation

1 vote

2 answers

1

GATE CSE 2023 | Question: 50
Consider the syntax directed translation given by the following grammar and semantic rules. Here $N, I, F$ and $B$ are non-terminals. $N$ is the starting non-terminal, and $\#, \mathbf{0}$ and $\mathbf{1}$ are lexical tokens ... \] The value computed by the translation scheme for the input string $10\#011$ is ____________. (Rounded off to three decimal places)

admin asked in Compiler Design Feb 15

by admin

987 views

0 votes

2 answers

2

Attributes in syntax directed translation
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?

Subhadeeppathak asked in Compiler Design Nov 29, 2022

by Subhadeeppathak

91 views

0 votes

0 answers

3

Best Open Video Playlist for Syntax-Directed Translation Topic | Compiler Design
Please list out the best free available video playlist for Syntax-Directed Translation from Compiler Design as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom ... ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 18, 2022

by makhdoom ghaya

75 views

6 votes

3 answers

4

GATE CSE 2022 | Question: 55
Consider the following grammar along with translation rules. ... of $S._{\text{val}}$ for root of the parse tree for the expression $20 \# 10 \% 5 \# 8 \% 2 \% 2$ is ________________.

Arjun asked in Compiler Design Feb 15, 2022

by Arjun

2.7k views

0 votes

1 answer

5

Compilation Techniques - Annotated Parse Tree
Given the following statement: 6 * (8-3) Make the Annotated Parse Tree based on the translation scheme below. S → B {A.i = B.val} A {S.val = A.s} A → - B {A1.i = A.i - B.val} A1 {A.s = A1.s} A → e {A.s = A.i} B → D {C.i = D.val} C {B.val = C.s} C → * ... = C.i * D.val} C1 {C.s = C1.s} C → e {C.s = C.i} D → ( S ) {D.val = S.val} D → num {D.val = num.val}

Frengky asked in Compiler Design Feb 11, 2022

508 views

0 votes

0 answers

6

#self doubt
https://gateoverflow.in/908/Gate-cse-2003-question-18 Here In fact only for the L-attributed grammar made from a LL(1) grammar, we can always guarantee a bottom-up parsing. Even for LR(1) grammar, bottom-up parsing is not a guarantee for all ... . ...I am not getting this line...Can somebody please explain with suitable example? @Arjun Sir @Deepak Poonie Sir can you please explain

samarpita asked in Compiler Design Dec 13, 2021

129 views

0 votes

2 answers

7

#Selfdoubt How L-attributed semantic rules are evaluated? Whether they are evaluated simultaneously during parsing?

jaswanth431 asked in Compiler Design Nov 16, 2021

425 views

15 votes

3 answers

8

GATE CSE 2021 Set 1 | Question: 26
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ ... used to type-check syntactically correct boolean variable declarations and boolean expressions. The actions will lead to an infinite loop

Arjun asked in Compiler Design Feb 18, 2021

by Arjun

6.2k views

3 votes

4 answers

9

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above

Lakshman Patel RJIT asked in Compiler Design Apr 1, 2020

by Lakshman Patel RJIT

833 views

0 votes

1 answer

10

NIELIT 2016 DEC Scientist B (CS) - Section B: 43
Syntax directed translation scheme is desirable because It is based on the syntax It is easy to modify Its description is independent of any implementation All of these

Lakshman Patel RJIT asked in Compiler Design Mar 31, 2020

by Lakshman Patel RJIT

2.6k views

13 votes

2 answers

11

GATE CSE 2020 | Question: 33
Consider the productions $A \rightarrow PQ$ and $A \rightarrow XY$. Each of the five non-terminals $A, P, Q, X,$ and $Y$ has two attributes: $s$ is a synthesized attribute, and $i$ ... Only Rule $1$ is $L$-attributed. Only Rule $2$ is $L$-attributed. Neither Rule $1$ nor Rule $2$ is $L$-attributed.

Arjun asked in Compiler Design Feb 12, 2020

by Arjun

6.2k views

0 votes

0 answers

12

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 7 (Page No. 337)
Modify the SDD of Fig. $5.25$ to include superscripts denoted by operator sup between boxes. If box $B_{2}$ is a superscript of box $B_{1}$, then position the baseline of $B_{2}\:0.6$ times the point size of $B_{1}$ above the baseline of $B_{1}.\text{Add}$ the new production and rules to the SDT of Fig. $5.26$.

Lakshman Patel RJIT asked in Compiler Design Sep 7, 2019

by Lakshman Patel RJIT

426 views

0 votes

0 answers

13

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 6 (Page No. 337)
Modify the SDD of Fig. $5.25$ to include a synthesized attribute $B.le$, the length of a box. The length of the concatenation of two boxes is the sum of the lengths of each. Then add your new rules to the proper positions in the SDT of Fig. $5.26$.

Lakshman Patel RJIT asked in Compiler Design Sep 7, 2019

by Lakshman Patel RJIT

439 views

0 votes

0 answers

14

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 5 (Page No. 337)
Write L-attributed SDT's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the programming language C. You may need to generate a ... middle to the next statement, so it is not sufficient simply to generate code for each statement in order.

Lakshman Patel RJIT asked in Compiler Design Sep 7, 2019

by Lakshman Patel RJIT

288 views

0 votes

0 answers

15

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 4 (Page No. 337)
Write L-attributed SDD's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the programming language C. You may need to generate a ... middle to the next statement, so it is not sufficient simply to generate code for each statement in order.

Lakshman Patel RJIT asked in Compiler Design Sep 6, 2019

by Lakshman Patel RJIT

272 views

1 vote

1 answer

16

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 3 (Page No. 337)
The following SDT computes the value of a string of $0's$ and $1's$ ... SDT so the underlying grammar is not left recursive, and yet the same value of $B.val$ is computed for the entire input string.

Lakshman Patel RJIT asked in Compiler Design Sep 6, 2019

by Lakshman Patel RJIT

1.2k views

Page:

1
2
3
4
5
6
7
next »

Recent questions tagged syntax-directed-translation