Register

GO Classes DPP | COMPILER|DAG

300 views
2 2 votes

Consider the following basic block:

$$
\begin{aligned}
& \mathrm{t} 1=\mathrm{a}+\mathrm{b} \\
& \mathrm{t} 2=\mathrm{c}+\mathrm{d} \\
& \mathrm{t} 3=\mathrm{t} 1 * 2 \\
& \mathrm{a}=\mathrm{t} 2-\mathrm{a} \\
& \mathrm{t} 4=\mathrm{t} 3 / \mathrm{a}
\end{aligned}
$$


The minimum number of NODES and minimum DIRECTED EDGES present in the DAG representation of the above basic block, respectively, are:

  1. $9$ and $12$
     
  2. $7$ and $9$
     
  3. $10$ and $13$
     
  4. $10$ and $10$

3 Answers

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | COM...Next → · GO Classes DPP | COM...
← Previous in category · GO Classes DPP | COM...Next in category → · GO Classes DPP | COM...
Position:
Show:

Related questions

2 2 votes
3 3 answers
507
507 views
GO Classes asked Dec 19, 2025
507 views
GO Classes DPP | COMPILER|DAG
Consider the following basic block:$$\begin{aligned}& w=x+y \\& z=w * 2 \\& x=y+z \\& w=x-y\end{aligned}$$The minimum number of NODES and the total number of OPERATOR LAB...
2 2 votes
3 3 answers
367
367 views
GO Classes asked Dec 19, 2025
367 views
GO Classes DPP | COMPILER|LEXICAL ANALYZER
A lexical analyzer uses the following regular expressions (REs) to recognize four tokens, $T_1, T_2$, $T_3$, and $T_4$, over the alphabet $\Sigma=\{a, b, c\}$.$T_1:(a \mi...
2 2 votes
3 3 answers
334
334 views
GO Classes asked Dec 19, 2025
334 views
GO Classes DPP | COMPILER|LEXICAL ANALYZER
Consider the following C code snippet:float val = 2.0; /* Check Condition */ if (val <= MAX) { val /= 2; }What is the total number of tokens identified by the lexical...
1 1 vote
4 4 answers
543
543 views
GO Classes asked Dec 19, 2025
543 views
GO Classes DPP | COMPILER|LR PARSER
Consider the following canonical set of LR(0) items:$$I_5=\left\{\begin{array}{l}R \rightarrow x \cdot P y \\R \rightarrow x P \\P \rightarrow y\end{array}\right.$$Which ...