In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?
Show Hint
- Three address code
- Abstract Syntax Tree (AST)
- Control Flow Graph (CFG)
- Symbol table
The Correct Option is D
Solution and Explanation
Step 1: Understanding intermediate representations.
Intermediate representations (IRs) are used by the compiler to represent the structure and semantics of the source program in a form suitable for analysis and optimization.
Step 2: Analysis of options.
Three address code is a linear, low-level intermediate representation used for optimization and code generation.
Abstract Syntax Tree (AST) represents the hierarchical syntactic structure of the program and is an intermediate form.
Control Flow Graph (CFG) represents the flow of control between basic blocks and is also an intermediate representation.
The symbol table, however, is a data structure used to store information about identifiers, such as variable names, types, and scopes. It is not an intermediate representation of the program itself.
Step 3: Conclusion.
Hence, the symbol table is NOT an intermediate representation.
Top Questions on Intermediate code generation
Consider the following statements about the use of backpatching in a compiler for intermediate code generation:
1. Backpatching can be used to generate code for Boolean expressions in one pass.
2. Backpatching can be used to generate code for flow-of-control statements in one pass.
Which ONE of the following options is CORRECT?- GATE CS - 2025
- Compiler Design
- Intermediate code generation
Consider the following ANSI C code segment:
z = x + 3 + y->f1 + y->f2; for (i = 0; i < 200; i = i + 2){ if (z > i) { p = p + x + 3; q = q + y->f1; } else { p = p + y->f2; q = q + x + 3; } }Assume that the variable \(y\) points to a struct (allocated on the heap) containing two fields \(f1\) and \(f2\), and the local variables \(x, y, z, p, q,\) and \(i\) are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code. The number of addition and dereference operations (of the form \(y \rightarrow f1\) or \(y \rightarrow f2\)) in the optimized code, respectively, are:
- GATE CS - 2021
- Compiler Design
- Intermediate code generation
For a statement \(S\) in a program, in the context of liveness analysis, the following sets are defined:
\(USE(S)\) : the set of variables used in \(S\)
\(IN(S)\) : the set of variables that are live at the entry of \(S\)
\(OUT(S)\) : the set of variables that are live at the exit of \(S\)Consider a basic block that consists of two statements, \(S_1\) followed by \(S_2\). Which one of the following statements is correct?
- GATE CS - 2021
- Compiler Design
- Intermediate code generation
Consider the following C code segment:
a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f;In a compiler, this code is represented internally as a Directed Acyclic Graph (DAG). The number of nodes in the DAG is \(\underline{\hspace{2cm}}\).
- GATE CS - 2021
- Compiler Design
- Intermediate code generation
Questions Asked in GATE CS exam
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- GATE CS - 2026
- Computer Organization and Architecture
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture