Recent questions and answers in Compiler Design

Consider the following $C$ code segment: A[i] = A[i] + 1; // Line 1 j = i + 1; // Line 2 A[j] = A[i] * 2; // Line 3 k = i; // Line 4 A[k] = A[k] + 1; // Line 5In the cont...

Consider the following $C$ code segment: x = y + 1; // Line 1 y = x - 2; // Line 2 z = x + y; // Line 3 x = 5; // Line 4 y =z * 2; // Line 5In the context of instruction-...

Let $G=(V, \Sigma, S, P)$ be a context-free grammar in Chomsky Normal Form with $\Sigma=\{a, b, c\}$ and $V$ containing $10$ variable symbols including the start symbol $...

Consider the control flow graph shown in the figure. Which one of the following options correctly lists the set of redundant expressions (common subexpressions) in the ba...

Consider the following statements regarding the front-end and back-end of a compiler.S1: The front-end includes phases that are independent of the target hardware.S2: The...

Which one of the following is TRUE at any valid state in shift-reduce parsing?Viable prefixes appear only at the bottom of the stack and not insideViable prefixes appear ...

Consider the control flow graph given below.Which one of the following options is the set of live variables at the exit point of each basic block?$\mathrm{B} 1:\{\mathrm{...

Consider the following context-free grammar:$E \rightarrow T E^{\prime}$ $E^{\prime} \rightarrow+T E^{\prime} \mid \epsilon$ $T \rightarrow F T^{\prime}$ $T^{\prime} \rig...

Consider the following grammar $G$ with start symbol $E$ :$E \rightarrow T R$ $R \rightarrow+T R \mid \epsilon$ $T \rightarrow f$Which of the following statement(s) is/ar...

Consider a pipelined processor in which the execution (EX) stage is shared by all instructions. The execution stage takes different different time for different instruct...

Consider the following context-free grammar:Productions:$S \rightarrow A$$S \rightarrow B$$A \rightarrow a A b$$A \rightarrow \epsilon$$B \rightarrow c B d$$B \rightarrow...

Consider the following grammar. Uppercase letters are non-terminals, lowercase letters are terminals, and $\epsilon$ is the empty string.$S \rightarrow A B \mid g h$ $A \...

Consider the following grammar $G$ with non-terminals $\{S, A, B, C\}$ and terminals $\{a, b, c, d, g\}$ :$$\begin{aligned}& S \rightarrow A B \\& A \rightarrow a A \mid ...

Consider the following context-free grammar:$$\begin{aligned}& E \rightarrow T R \\& R \rightarrow+T R \mid \epsilon \\& T \rightarrow F Y \\& Y \rightarrow * F Y \mid \e...

Consider the canonical $L R(0)$ parsing of the grammar below using terminals $\{a, b, c\}$ and non-terminals $\{A, B, C, S\}$ with $S$ as the start symbol.\[\begin{array}...

Consider two grammars $G_{1}$ and $G_{2}$ with the production rules given below: $G_{1} : S \rightarrow$ $if$ $E$ $then$ $S$ $|$ $if$ $E$ $then$ $S$ $else$ $S$ $|$ $a$ ...

Consider the following control flow graphThe live-variable analysis determines for each point $p$ in a program which variables are live at that point. A live variable v a...

Which ONE of the following statements is FALSE regarding the symbol table?Symbol table is responsible for keeping track of the scope of variables.Symbol table can be impl...

A lexical analyzer uses the following token definitions${letter → [A-Za-z]}$${digit → [0-9]}$${id → letter (letter | digit)^*}$${number → digit}$ ${ }^{+}$${ws → (blank |...

​​Given a Context-Free Grammar $\text{G}$ as follows:\[\begin{array}{l}S \rightarrow A a|b A c| d c \mid b d a \\A \rightarrow d\end{array}\]Which ONE of the following st...

​​Given the following syntax directed translation rules:Rule 1: $R \rightarrow A B\{B . i=R . i-1 ; A . i=B . i ; R . i=A . i+1 ;\}$Rule 2: $P \rightarrow C D\{P . i=C . ...

​​​​Consider the following statements about the use of backpatching in a compiler for intermediate code generation:Backpatching can be used to generate code for Boolean e...

Which of the following statement(s) is/are TRUE while computing $\operatorname{First}$ and $\operatorname{Follow}$ during top down parsing by a compiler?For a production ...

Which ONE of the following techniques used in compiler code optimization uses live variable analysis?Run-time function call managementRegister assignment to variablesStre...