Register

compiler design

• retagged by
235 views
0 votes
0 votes
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively.
Find P*Q
X = Y + Z
Z = X + M
E = X + Y
M = E – Y
T = Z – M
X = T + Y
• retagged by
User Avatar

1 Answer

0 votes
0 votes

          Please crosscheck the answer, correct me if I am wrong………

 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

109
views
0 answers
0 votes
Sarahcs asked May 6
109 views
Compiler design
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
User Avatar
118
views
0 answers
0 votes
Ebrahim asked May 5
118 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e) 
User Avatar
89
views
0 answers
0 votes
Ebrahim asked May 5
89 views
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation.  a) Quadrupleb) Triple c) Indirect Triple Solve the above Question like this example
User Avatar
111
views
0 answers
1 votes
Ebrahim asked May 5
111 views
Compiler Design
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
User Avatar
Link Copied!