Question:
Consider the following two sets:
\begin{center}
\begin{tabular}{|c|l|c|l|}
\hline
Set X & & Set Y &
\hline
P. & Lexical Analyzer & 1. & Abstract Syntax Tree
Q. & Syntax Analyzer & 2. & Token
R. & Intermediate Code Generator & 3. & Parse Tree
S. & Code Optimizer & 4. & Constant Folding
\hline
\end{tabular}
\end{center}
Which one of the following options is the CORRECT match from Set X to Set Y?
Consider the following two sets:
\begin{center}
\begin{tabular}{|c|l|c|l|}
\hline
Set X & & Set Y &
\hline P. & Lexical Analyzer & 1. & Abstract Syntax Tree
Q. & Syntax Analyzer & 2. & Token
R. & Intermediate Code Generator & 3. & Parse Tree
S. & Code Optimizer & 4. & Constant Folding
\hline \end{tabular} \end{center} Which one of the following options is the CORRECT match from Set X to Set Y?
\hline P. & Lexical Analyzer & 1. & Abstract Syntax Tree
Q. & Syntax Analyzer & 2. & Token
R. & Intermediate Code Generator & 3. & Parse Tree
S. & Code Optimizer & 4. & Constant Folding
\hline \end{tabular} \end{center} Which one of the following options is the CORRECT match from Set X to Set Y?
Show Hint
Understand the role of each compiler phase and its output to accurately match components.
Updated On: Jan 23, 2025
- \(P - 4; \, Q - 1; \, R - 3; \, S - 2\)
- \(P - 2; \, Q - 3; \, R - 1; \, S - 4\)
- \(P - 2; \, Q - 1; \, R - 3; \, S - 4\)
- \(P - 4; \, Q - 3; \, R - 2; \, S - 1\)
Hide Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
To correctly match Set X with Set Y, we analyze each component:
P. Lexical Analyzer: The lexical analyzer is responsible for generating tokens from the input stream. Hence, \(P - 2\).
Q. Syntax Analyzer: The syntax analyzer generates a parse tree by analyzing the syntactical structure of tokens. Hence, \(Q - 3\).
R. Intermediate Code Generator: The intermediate code generator creates an abstract syntax tree (AST) as part of its processing. Hence, \(R - 1\).
S. Code Optimizer: The code optimizer applies techniques like constant folding to optimize the intermediate code. Hence, \(S - 4\).
Correct match: \[ P - 2, \, Q - 3, \, R - 1, \, S - 4. \] Final Answer: \[ \boxed{\text{(B)}} \]
P. Lexical Analyzer: The lexical analyzer is responsible for generating tokens from the input stream. Hence, \(P - 2\).
Q. Syntax Analyzer: The syntax analyzer generates a parse tree by analyzing the syntactical structure of tokens. Hence, \(Q - 3\).
R. Intermediate Code Generator: The intermediate code generator creates an abstract syntax tree (AST) as part of its processing. Hence, \(R - 1\).
S. Code Optimizer: The code optimizer applies techniques like constant folding to optimize the intermediate code. Hence, \(S - 4\).
Correct match: \[ P - 2, \, Q - 3, \, R - 1, \, S - 4. \] Final Answer: \[ \boxed{\text{(B)}} \]
Was this answer helpful?
0
0
Top Questions on Syntax Directed Translation
- The number of distinct minimum-weight spanning trees of the following graph is ............ \begin{center} \includegraphics[width=0.5\textwidth]{59.png} \end{center}
- GATE CS - 2024
- Compiler Design
- Syntax Directed Translation
- Consider the following augmented grammar, which is to be parsed with an SLR parser. The set of terminals is \(\{a, b, c, d, \#, @\}\). \[ S' \rightarrow S \quad S \rightarrow SS \, | \, Aa \, | \, bAc \, | \, BC \, | \, bBa \quad A \rightarrow d\# \quad B \rightarrow @ \] Let \(I_0 = \text{CLOSURE}(\{S' \rightarrow \cdot S\}\). The number of items in the set \(GOTO(I_0, S)\) is ............
- GATE CS - 2024
- Compiler Design
- Syntax Directed Translation
- Consider the following expression: \(x[i] = (p + r) * -s[i] + u / w\). The following sequence shows the list of triples representing the given expression, with entries missing for triples (1), (3), and (6). \begin{center} \begin{tabular}{|c|c|c|c|} \hline (0) & \(+\) & \(p\) & \(r\)
\hline (1) & & &
\hline (2) & \texttt{uminus} & \((1)\) &
\hline (3) & & &
\hline (4) & \(/\) & \(u\) & \(w\)
\hline (5) & \(+\) & \((3)\) & \((4)\)
\hline (6) & & &
\hline (7) & \(=\) & \((6)\) & \(x[i]\)
\hline \end{tabular} \end{center} Which one of the following options fills in the missing entries CORRECTLY?- GATE CS - 2024
- Compiler Design
- Syntax Directed Translation
- Consider the following context-free grammar where the start symbol is \(S\) and the set of terminals is \(\{a, b, c, d\}\): \[ S \to AaAb \, | \, BbBa \quad \quad A \to cS \, | \, \epsilon \quad \quad B \to dS \, | \, \epsilon \] The following is a partially-filled LL(1) parsing table. \begin{center} \begin{tabular}{|c|c|c|c|c|c|} \hline & \(a\) & \(b\) & \(c\) & \(d\) & \(\$\)
\hline \(S\) & \(S \to AaAb\) & \(S \to BbBa\) & (1) & (2) &
\hline \(A\) & \(A \to \epsilon\) & (3) & \(A \to cS\) & &
\hline \(B\) & (4) & \(B \to \epsilon\) & & \(B \to dS\) &
\hline \end{tabular} \end{center} Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table? Note: In the options, "blank" denotes that the corresponding cell is empty.}- GATE CS - 2024
- Compiler Design
- Syntax Directed Translation
- Let \(A\) be an array containing integer values. The distance of \(A\) is defined as the minimum number of elements in \(A\) that must be replaced with another integer so that the resulting array is sorted in non-decreasing order. The distance of the array \([2, 5, 3, 1, 4, 2, 6]\) is ...........\_\_\_.
- GATE CS - 2024
- Compiler Design
- Syntax Directed Translation
Questions Asked in GATE CS exam
- Consider a 32-bit system with a 4 KB page size and page table entries of size 4 bytes each. Assume \(1 \, \text{KB} = 2^{10} \, \text{bytes}\). The OS uses a 2-level page table for memory management, with the page table containing an outer page directory and an inner page table. The OS allocates a page for the outer page directory upon process creation. The OS uses demand paging when allocating memory for the inner page table, i.e., a page of the inner page table is allocated only if it contains at least one valid page table entry.
An active process in this system accesses \(2000\) unique pages during its execution, and none of the pages are swapped out to disk. After it completes the page accesses, let \(X\) denote the minimum and \(Y\) denote the maximum number of pages across the two levels of the page table of the process. The value of \(X + Y\) is ............- GATE CS - 2024
- Lexical analysis
- Let \(Z_n\) be the group of integers \(\{0, 1, 2, \dots, n - 1\}\) with addition modulo \(n\) as the group operation. The number of elements in the group \(Z_2 \times Z_3 \times Z_4\) that are their own inverses is ............
- GATE CS - 2024
- Indexed Address
- Let \(L_1\) be the language represented by the regular expression \(b^*ab^*(ab^*ab^*)^*\) and \(L_2 = \{ w \in (a + b)^* \mid |w| \leq 4 \\), where \(|w|\) denotes the length of string \(w\). The number of strings in \(L_2\) which are also in \(L_1\) is ............}
- GATE CS - 2024
- Miscellaneous
- The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is ............ \begin{center} \includegraphics[width=0.3\textwidth]{60.png} \end{center}
- GATE CS - 2024
- Miscellaneous
- A processor uses a 32-bit instruction format and supports byte-addressable memory access. The ISA of the processor has 150 distinct instructions. The instructions are equally divided into two types, namely R-type and I-type, whose formats are shown below. R-type Instruction Format: \begin{center} \setlength{\tabcolsep}{15pt} % Adjust column spacing \renewcommand{\arraystretch}{1.5} % Adjust row spacing \begin{tabular}{|c|c|c|c|c|} \hline OPCODE & UNUSED & DST Register & SRC Register1 & SRC Register2
\hline \end{tabular} \end{center} \vspace{0.5cm} I-type Instruction Format: \begin{center} \setlength{\tabcolsep}{15pt} % Adjust column spacing \renewcommand{\arraystretch}{1.5} % Adjust row spacing \begin{tabular}{|c|c|c|c|} \hline OPCODE & DST Register & SRC Register & \# Immediate Value/Address
\hline \end{tabular} \end{center} In the OPCODE, 1 bit is used to distinguish between I-type and R-type instructions, and the remaining bits indicate the operation. The processor has 50 architectural registers, and all register fields in the instructions are of equal size. Let \(X\) be the number of bits used to encode the UNUSED field, \(Y\) be the number of bits used to encode the OPCODE field, and \(Z\) be the number of bits used to encode the immediate value/address field. The value of \(X + 2Y + Z\) is ............- GATE CS - 2024
- Indexed Address
View More Questions