Recent questions tagged syntax-directed-translation - GATE CSE Doubts

0 votes

0 answers

Syntax Directed translations
I know that for inherited attributes, the evaluation order is left to right depth first and for synthesized top down or post order. In case of L-attributed SDT, having both synthesized and inherited attributes, in what order translation ... parsers will differ in carrying out these translation when both type of attributes are present?Please explain with an example.

asked Jul 31 in Compiler Design by Lovejeet Singh (8 points) | 4 views

0 votes

0 answers

#Syntax Directed Translation #self doubt
I have a L-attributed SDT, having both synthesised and inherited attributes.Why is it said that this SDT must be solved using depth first, left to right manner?Because its OK for inherited attributes, but synthesised attributes . ... is not satisfactory.https://cs.stackexchange.com/questions/86183/how-do-we-evaluate-semantic-actions-in-l-attributed-sdt

asked Apr 19 in Compiler Design by ayush3298 (6 points) | 9 views

0 votes

0 answers

GATE2003-18 Video Solution
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2019-36 Video Solution
Consider the following grammar and the semantic actions to support that inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$

asked Apr 18 in Compiler Design by admin (3.6k points) | 4 views

0 votes

0 answers

GATE1998-23 Video Solution
Let the attribute ‘$val$’ give the value of a binary number generated by $S$ in the following grammar: $S \rightarrow L.L \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ For example, an input $101.101$ gives $S.val = 5.625$ Construct a syntax directed translation scheme using only synthesized attributes, to determine $S.val$.

asked Apr 18 in Compiler Design by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2016-1-46 Video Solution
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}$ $S \to a \quad \{\text{print }2\}$ $A \to Sb \quad \{\text{print }3\}$ Using the above $SDTS$ , ... printed by a bottom-up parser, for the input $aab$ is: $1 \ 3 \ 2 $ $2 \ 2 \ 3 $ $2 \ 3 \ 1 $ syntax error

asked Apr 18 in Compiler Design by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1995-2.10 Video Solution
A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar $S \rightarrow xxW \;\text{{print 1"}}$ $S \rightarrow y \;\text{{print 2"}}$ ... of $xxxxyzz$ using the syntax directed translation scheme described by the above rules? $23131$ $11233$ $11231$ $33211$

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2000-19 Video Solution
Consider the syntax directed translation scheme (SDTS) given in the following. Assume attribute evaluation with bottom-up parsing, i.e., attributes are evaluated immediately after a reduction. E$\rightarrow $ E$_{1}$ * T {E.val = E$_{1}$.val * ... SDTS given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

0 answers

GATE1996-20 Video Solution
Consider the syntax-directed translation schema (SDTS) shown below: $E\rightarrow E + E$ {print “+”} $E\rightarrow E * E$ {print “.”} $E\rightarrow id$ {print id.name} $E\rightarrow (E)$ An LR-parser ... corresponding production. Draw the parse tree and write the translation for the sentence. $(a+b)*(c+d)$, using SDTS given above.

asked Apr 18 in Compiler Design by admin (3.6k points) | 1 view

0 votes

0 answers

GATE1992-11a Video Solution
Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis. Rewriting the grammar is not permitted and semantic rules are to be added to the ends of productions ... $T \rightarrow \text{int}$ $T \rightarrow \text{real}$ $L \rightarrow L,id$ $L \rightarrow id$

asked Apr 18 in Compiler Design by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1992-11b Video Solution
Write $3$ address intermediate code (quadruples) for the following boolean expression in the sequence as it would be generated by a compiler. Partial evaluation of boolean expressions is not permitted. Assume the usual rules of precedence of the operators.$(a+b) > (c+d) \text{ or } a > c \text{ and }b < d$

asked Apr 18 in Compiler Design by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1997-23 Video Solution
The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements. <assign-stmt> :: <LHS> := <E> <E> ::= <E> + <T>|<T> <T> ::= ... that the name and type of variable can be obtained by making the function calls' give_name $(id)$ and give_type $(id)$ respectively.

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2001-17 Video Solution
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an attribute ... statement. Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.

asked Apr 18 in Compiler Design by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1994-23 Video Solution
Suppose we have a computer with single register and only three instructions given below: ... (E)\mid id$}\\ \end{array}$ Write a syntax directed translation to generate code using this grammar for the computer described above.

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

0 answers

GATE1989-10b Video Solution
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ ... necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.

asked Apr 18 in Compiler Design by admin (3.6k points) | 3 views

0 votes

1 answer

Ace Test series Top down parsing SDT
Question Answer as per Ace As far as I know Tree is traversed in Left most (DFS) so correct answer should be “*+”.

asked Nov 30, 2019 in Compiler Design by priyesh9875 (59 points) | 33 views

To see more, click for the full list of questions or popular tags.

7,711 questions

1,823 answers

11,131 comments

95,090 users