Dark Mode

Recent questions tagged intermediate-code

0 votes

0 answers

1

Unacademy AIMT 1
The correct answer given is 3.

TusharKumar asked in Compiler Design Dec 23, 2022

243 views

0 votes

0 answers

2

Best Open Video Playlist for Intermediate Code Generation Topic | Compiler Design
Please list out the best free available video playlist for Intermediate Code Generation from Compiler Design as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO ... 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

78 views

0 votes

1 answer

3

Made easy test
i=10 j=1 a=i*j b=i+j if a<=b goto 3 else goto 8 a=a+1 i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the above code?

samarpita asked in Compiler Design Dec 14, 2021

950 views

1 vote

2 answers

4

Applied Test Series
Consider the following code 1. location = -1 2. i=0 3. if (i<100) goto 5 4. goto 13 5. t1 = 4*i 6. go to 3 7. t2 = A[t1] 8. if t2 = x goto 10 9. goto 11 10.location = i 11.t3 = i+1 12.i = t3 13.goto 3 The number of basic blocks from the given code are______

LRU asked in Compiler Design Nov 13, 2021

by LRU

378 views

1 vote

1 answer

5

Directed acyclic graph
Consider the following three address code: T1= a+b T2= c+d T3=a-b T4= T1+T3 T5= T2+T1 T6 = T5+T4 T7 = c + T6 Number of nodes and edges in DAG of the above code? If we'll do simplification , then T4 would be T4 = a+b+a-b => a+a , after this simplification T3 is not used anywhere in the program, so it can be eliminated or we'll include it in DAG??

Ankita87077 asked in Compiler Design Oct 27, 2021

578 views

1 vote

1 answer

6

Compiler Design (register allocation)
In such questions, In which it is asked " minimum number of registers required for executing this three address code without spilling", can we apply code motion optimization or not? As in a question of made easy test series : T1 = a; ... = R1} So,which one is correct, made easy one or second one applying code motion? Can anybody please clarify this.

Ankita87077 asked in Compiler Design Oct 27, 2021

352 views

8 votes

4 answers

7

GATE CSE 2021 Set 2 | Question: 13
In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program? Three address code Abstract Syntax Tree $\text{(AST)}$ Control Flow Graph $\text{(CFG)}$ Symbol table

Arjun asked in Compiler Design Feb 18, 2021

by Arjun

4.7k views

4 votes

1 answer

8

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

go_editor asked in Compiler Design Nov 20, 2020

6.3k views

1 vote

0 answers

9

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.

Lakshman Bhaiya asked in Compiler Design Sep 7, 2019

by Lakshman Bhaiya

908 views

0 votes

0 answers

10

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

Lakshman Bhaiya asked in Compiler Design Sep 7, 2019

by Lakshman Bhaiya

547 views

0 votes

0 answers

11

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.

Lakshman Bhaiya asked in Compiler Design Sep 7, 2019

by Lakshman Bhaiya

452 views

Page:

1
2
3
4
next »

Recent questions tagged intermediate-code