Recent questions without answers

+1 vote

0 answers

1

CMI2019-A-9

asked 2 days ago in Others by gatecse Boss (16.1k points) | 21 views

0 votes

0 answers

2

CMI2019-A-10

asked 2 days ago in Others by gatecse Boss (16.1k points) | 11 views

0 votes

0 answers

3

CMI2019-B-1

asked 2 days ago in Others by gatecse Boss (16.1k points) | 9 views

0 votes

0 answers

4

CMI2019-B-2

asked 2 days ago in Others by gatecse Boss (16.1k points) | 6 views

0 votes

0 answers

5

CMI2019-B-3

asked 2 days ago in Others by gatecse Boss (16.1k points) | 3 views

0 votes

0 answers

6

CMI2019-B-4

asked 2 days ago in Others by gatecse Boss (16.1k points) | 3 views

0 votes

0 answers

7

CMI2019-B-5

asked 2 days ago in Others by gatecse Boss (16.1k points) | 5 views

0 votes

0 answers

8

CMI2019-B-6

asked 2 days ago in Others by gatecse Boss (16.1k points) | 3 views

0 votes

0 answers

9

CMI2019-B-7

asked 2 days ago in Others by gatecse Boss (16.1k points) | 4 views

0 votes

0 answers

10

CMI2018-A-5
How many paths are there in the plane from $(0,0)$ to $(m,n)\in \mathbb{N}\times \mathbb{N},$ if the possible steps from $(i,j)$ are either $(i+1,j)$ or $(i,j+1)?$ $\binom{2m}{n}$ $\binom{m}{n}$ $\binom{m+n}{n}$ $m^{n}$

asked 2 days ago in Others by gatecse Boss (16.1k points) | 7 views

0 votes

0 answers

11

CMI2018-B-3

asked 2 days ago in Others by gatecse Boss (16.1k points) | 6 views

0 votes

0 answers

12

CMI2018-B-5

asked 2 days ago in Others by gatecse Boss (16.1k points) | 5 views

0 votes

0 answers

13

CMI2018-B-6

asked 2 days ago in Others by gatecse Boss (16.1k points) | 7 views

0 votes

0 answers

14

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 30 views

0 votes

0 answers

15

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)$

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 13 views

0 votes

0 answers

16

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 6 views

0 votes

0 answers

17

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 3 views

0 votes

0 answers

18

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]$

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 5 views

0 votes

0 answers

19

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 1 view

0 votes

0 answers

20

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 3 views

0 votes

0 answers

21

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]]$

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 2 views

0 votes

0 answers

22

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)

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 2 views

0 votes

0 answers

23

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)

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 2 views

0 votes

0 answers

24

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 1 view

0 votes

0 answers

25

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;

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 3 views

0 votes

0 answers

26

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.

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 3 views

0 votes

0 answers

27

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

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 1 view

0 votes

0 answers

28

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

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 1 view

0 votes

0 answers

29

Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 2 (Page No. 363)
Construct the DAG and identify the value numbers for the subexpressions of the following expressions, assuming $+$ associates from the left. $a+b+(a+b)$ $a+b+a+b$ $a+a+((a+a+a+(a+a+a+a))$

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 2 views

0 votes

0 answers

30

Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 1 (Page No. 362)
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$

asked Sep 7 in Compiler Design by Lakshman Patel RJIT Boss (46.5k points) | 2 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions without answers

Recent Posts

Recent Blog Comments