Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged intermediate-code
5
votes
1
answer
31
UGC NET CSE | October 2020 | Part 2 | Question: 30
Which of the following is not an intermediate code form? Syntax trees Three address codes Quadrupules Post fix Notation
Which of the following is not an intermediate code form?Syntax treesThree address codesQuadrupulesPost fix Notation
go_editor
7.6k
views
go_editor
asked
Nov 20, 2020
Compiler Design
ugcnetcse-oct2020-paper2
compiler-design
intermediate-code
+
–
1
votes
0
answers
32
Ullman (Compiler Design) Edition 2 Exercise 6.5 Question 2 (Page No. 399)
As in Ada, suppose that each expression must have a unique type, but that from a subexpression, by itself, all we can deduce is a set of possible types. That is, the application of function ... of the overall expression is determined, proceeds top-down to determine attribute $unique$ for the type of each subexpression.
As in Ada, suppose that each expression must have a unique type, but that from a subexpression, by itself, all we can deduce is a set of possible types. That is, the app...
admin
1.0k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
33
Ullman (Compiler Design) Edition 2 Exercise 6.5 Question 1 (Page No. 398)
Assuming that function $widen$ in Fig. $6.26$ can handle any of the types in the hierarchy of Fig. $6.25(a)$, translate the expressions below. Assume that c and d are characters, $s$ and $t$ are short integers, $i$ and $j$ are integers, and $x$ is a float. $x=s+c$ $i=s+c$ $x=(s+c)\ast(t+d)$
Assuming that function $widen$ in Fig. $6.26$ can handle any of the types in the hierarchy of Fig. $6.25(a)$, translate the expressions below. Assume that c and d are cha...
admin
694
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
34
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 9 (Page No. 386)
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[3,4,5]$ $A[1,2,7]$ $A[4,3,9]$ if $A$ is stored in column-major order.
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. ...
admin
535
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
1
answer
35
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 8 (Page No. 386)
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[3,4,5]$ $A[1,2,7]$ $A[4,3,9]$
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. ...
admin
878
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
36
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 7 (Page No. 386)
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[4,5]$ $A[10,8]$ $A[3,17]$ if A is stored in column-major order.
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starti...
admin
904
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
1
answer
37
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 6 (Page No. 386)
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[4,5]$ $A[10,8]$ $A[3,17]$
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starti...
admin
547
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
38
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 5 (Page No. 385 - 386)
Generalize formula $(6.7)$ to multidimensional arrays, and indicate what values can be stored in the symbol table and used to compute offsets. Consider the following cases: An array $A$ of two dimensions, in row-major form. The first ... $h_{j}$.The same as $(c)$ but with the array stored in column-major form.
Generalize formula $(6.7)$ to multidimensional arrays, and indicate what values can be stored in the symbol table and used to compute offsets. Consider the following case...
admin
351
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
39
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 4 (Page No. 385)
Revise the translation of Fig. $6.22$ for array references of the Fortran style, that is, $id[E_{1}, E_{2},\cdot\cdot\cdot,E_{n}]$ for an $n-$dimensional array.
Revise the translation of Fig. $6.22$ for array references of the Fortran style, that is, $id[E_{1}, E_{2},\cdot\cdot\cdot,E_{n}]$ for an $n-$dimensional array.
admin
383
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
40
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 3 (Page No. 385)
Use the translation of Fig. $6.22$ to translate the following assignments: $x=a[i]+b[j]$ $x=a[i][j]+b[i][j]$ $x=a[b[i][j]][c[[k]]$
Use the translation of Fig. $6.22$ to translate the following assignments: $x=a[i]+b[j]$$x=a[i][j]+b[i][j]$$x=a[b[i][j]][c[[k]]$
admin
703
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
41
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 2 (Page No. 384)
Add to the translation of Fig. $6.19$ rules for the following productions: $E\rightarrow E_{1}\ast E_{2}$ $E\rightarrow + E_{1}\:$(unary plus)
Add to the translation of Fig. $6.19$ rules for the following productions:$E\rightarrow E_{1}\ast E_{2}$$E\rightarrow + E_{1}\:$(unary plus)
admin
441
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
42
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 1 (Page No. 384)
Add to the translation of Fig. $6.19$ rules for the following productions: $E\rightarrow E_{1}\ast E_{2}$ $E\rightarrow + E_{1}\:$(unary plus)
Add to the translation of Fig. $6.19$ rules for the following productions:$E\rightarrow E_{1}\ast E_{2}$$E\rightarrow + E_{1}\:$(unary plus)
admin
593
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
43
Ullman (Compiler Design) Edition 2 Exercise 6.3 Question 2 (Page No. 378)
Extend the handling of field names in Fig. $6.18$ to classes and single-inheritance class hierarchies. Give an implementation of class $Enu$ that allows linked symbol tables, so that a subclass can ... inherited fields. Inherited fields must maintain the relative addresses they were assigned in the layout for the superclass.
Extend the handling of field names in Fig. $6.18$ to classes and single-inheritance class hierarchies. Give an implementation of class $Enu$ that allows linked symbol tab...
admin
482
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
0
votes
0
answers
44
Ullman (Compiler Design) Edition 2 Exercise 6.3 Question 1 (Page No. 378)
Determine the types and relative addresses for the identifiers in the following sequence of declarations: float x; record { float x; float y; } p; record { int tag; float x; float y; } q;
Determine the types and relative addresses for the identifiers in the following sequence of declarations:float x; record { float x; float y; } p; record { int tag; float ...
admin
1.2k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
0
votes
1
answer
45
Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 3 (Page No. 370)
Show how to transform a three-address code sequence into one in which each defined variable gets a unique variable name.
Show how to transform a three-address code sequence into one in which each defined variable gets a unique variable name.
admin
1.7k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
1
votes
1
answer
46
Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 2 (Page No. 370)
Translate the following arithmetic expression into: $a=b[i]+c[j]$ $a[i]=b\ast c-b\ast d$ $x=f(y+1)+2$ $x=\ast p + \&y$ A Syntax tree Quadruples Triples Indirect triples
Translate the following arithmetic expression into:$a=b[i]+c[j]$$a[i]=b\ast c-b\ast d$$x=f(y+1)+2$$x=\ast p + \&y$ A Syntax treeQuadruplesTriplesIndirect triples
admin
8.1k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
0
votes
1
answer
47
Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 1 (Page No. 370)
Translate the arithmetic expression $a + -(b + c)$ into: A syntax tree. Quadruples. Triples. Indirect triples
Translate the arithmetic expression $a + -(b + c)$ into:A syntax tree.Quadruples.Triples.Indirect triples
admin
11.1k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
1
votes
1
answer
48
UGC NET CSE | June 2019 | Part 2 | Question: 72
On translating the expression given below into quadruple representation, how many operations are required? $(i\ast j)+(e+f)\ast(a\ast b+c)$ $5$ $6$ $3$ $7$
On translating the expression given below into quadruple representation, how many operations are required?$$(i\ast j)+(e+f)\ast(a\ast b+c)$$$5$$6$$3$$7$
Arjun
4.9k
views
Arjun
asked
Jul 2, 2019
Compiler Design
ugcnetcse-june2019-paper2
intermediate-code
quadruple-representation
+
–
0
votes
0
answers
49
Ullman(2e) Exercise-8.3.2 page no-524 Code Generation
Generate code for the following three-address statements assuming stack allocation where register SP points to the top of the stack x = 1 x=a x = a + 1 x = a+b The two statements x = b * c y = a + x
Generate code for the following three-address statements assuming stack allocation where register SP points to the top of the stackx = 1x=ax = a + 1x = a+bThe two stateme...
aditi19
988
views
aditi19
asked
Apr 1, 2019
Compiler Design
compiler-design
intermediate-code
target-code-generation
stack
pointers
+
–
0
votes
1
answer
50
static single assignment
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).
minal
948
views
minal
asked
Jan 22, 2019
Compiler Design
compiler-design
intermediate-code
three-address-code
static-single-assignment
numerical-answers
+
–
0
votes
2
answers
51
Intermediate code representation
Answer is 6,6 Can anybody explain how?
Answer is 6,6Can anybody explain how?
bts1jimin
578
views
bts1jimin
asked
Jan 12, 2019
Compiler Design
compiler-design
intermediate-code
test-series
+
–
1
votes
1
answer
52
MadeEasy Test Series: Complier Design - Intermediate Code
someone please share detailed rules for this along with solution- would be of great help. and we usually dont take start and end state- arent they extra here? coz count comes different
someone please share detailed rules for this along with solution- would be of great help.and we usually dont take start and end state- arent they extra here? coz count co...
Markzuck
768
views
Markzuck
asked
Jan 8, 2019
Compiler Design
compiler-design
made-easy-test-series
intermediate-code
+
–
1
votes
0
answers
53
UPPCL AE 2018:39
Match all items in Group $1$ with correct options from those given in Group $2.$ ... $\text{P-1, Q-2, R-3, S-4}$ $\text{P-2, Q-3, R-4, S-1}$
Match all items in Group $1$ with correct options from those given in Group $2.$$$\begin{array} {|l|l|} \hline \qquad \qquad \textbf{Group 1} & \qquad \textbf{Group 2} \\...
admin
269
views
admin
asked
Jan 5, 2019
Compiler Design
uppcl2018
compiler-design
intermediate-code
+
–
0
votes
1
answer
54
GATE Overflow | Mock GATE | Test 1 | Question: 32
A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses back patching to perform the sequential search. i=0; P: if (i<A.length) goto ____; ... in the blanks provided ordered from top to bottom? R T U P R U T P P U T R P T U R
A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses ba...
Ruturaj Mohanty
652
views
Ruturaj Mohanty
asked
Dec 27, 2018
Algorithms
go-mockgate-1
algorithms
searching
compiler-design
intermediate-code
code-optimization
+
–
0
votes
0
answers
55
self_doubt
what will be the three address code for x=A[i][j] Given A[M][N] and w is word size; t1=i*N; t2=t1+j; t3=t2*w; t4=base address of array A[M][N] t5=t4+t3; x=t5; My doubt here: Is there any need of t4 variable for storing the base address of arrary or we can directly do it as t4=A[t3]; x=t4;
what will be the three address code for x=A[i][j] Given A[M][N] and w is word size;t1=i*N;t2=t1+j;t3=t2*w;t4=base address of array A[M][N]t5=t4+t3;x=t5;My doubt here: Is ...
Shivam Kasat
480
views
Shivam Kasat
asked
Dec 22, 2018
Compiler Design
compiler-design
intermediate-code
three-address-code
array
+
–
0
votes
1
answer
56
NIELIT 2018-76
Identify the correct nodes and edges in the given intermediate code $i=1$ $t1=5*i$ $t2=4*t1$ $t3=t2$ $a[t3]=0$ $i=i+1$ if $i<15$ goto(2) $33$ $44$ $43$ $34$
Identify the correct nodes and edges in the given intermediate code$i=1$$t1=5*i$$t2=4*t1$$t3=t2$$a[t3]=0$$i=i+1$if $i<15$ goto(2)$33$$44$$43$$34$
Arjun
4.4k
views
Arjun
asked
Dec 7, 2018
Compiler Design
nielit-2018
compiler-design
intermediate-code
+
–
1
votes
0
answers
57
Triple Representation of x[i]=y
Given Answer is A
Given Answer is A
Aakash_
1.6k
views
Aakash_
asked
Nov 30, 2018
Compiler Design
compiler-design
intermediate-code
+
–
0
votes
2
answers
58
MadeEasy Test Series: Compiler Design - Intermediate Code
a x b x c + d - a + e x f - g + h order of precedence : x>+>- ; with x is left associative and +, - as right. Min number of variables required in TAC? Should'nt the expression be expressed as : ((a x b) x c) + d - a + (e x f) - g + h (((a x b) x c) + (d - (a + (e x f)) - (g + h)))
a x b x c + d - a + e x f - g + horder of precedence : x>+>- ; with x is left associative and +, - as right.Min number of variables required in TAC?Should'nt the expressi...
manisha11
1.1k
views
manisha11
asked
Nov 18, 2018
Compiler Design
made-easy-test-series
compiler-design
intermediate-code
+
–
0
votes
1
answer
59
compiler design
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers. eleborate this ??
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers.eleborate this...
Gurdeep Saini
552
views
Gurdeep Saini
asked
Nov 15, 2018
Compiler Design
compiler-design
intermediate-code
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register