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
To determine which option is NOT an intermediate representation of the source program in a compiler, let's examine each option:
- Three address code: This is a type of intermediate representation used in compilers. It is a sequence of instructions, each typically having at most three operands. This representation is utilized for performing optimizations and is a key step in converting source code to machine code.
- Abstract Syntax Tree (AST): This is another form of intermediate representation. An AST is a tree representation of the abstract syntactic structure of source code. Each node of the tree denotes a construct occurring in the source code. The AST is used in various stages of the compilation process.
- Control Flow Graph (CFG): This is also an intermediate representation. It is a graphical representation of all paths that might be traversed through a program during its execution. CFGs are utilized in the optimization phase of the compiler.
- Symbol table: This is NOT an intermediate representation. Instead, it is a data structure used by a compiler to store information about symbols (identifiers) such as variable names, function names, and their attributes. The symbol table aids in semantic analysis, type checking, and code generation, but it does not represent the source program itself.
Based on this analysis, the Symbol table is the correct answer, as it is not an intermediate representation of the source program.
Top Questions on 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
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
- Want to practice more? Try solving extra ecology questions todayView All Questions
Questions Asked in GATE CS exam
A database has 25,000 fixed-length records of 100 bytes (primary key 15 bytes). The data file is block-aligned so each record is fully contained within a block. The file is indexed by a primary index file, also block-aligned and ordered. Block size is 1024 bytes and a block pointer is 5 bytes. Each index entry stores the block’s anchor key (15 bytes) and a pointer (5 bytes). Binary search on an index file of \(b\) blocks needs \(\lceil \log_2 b \rceil\) block accesses in the worst case. Given a key, the number of block accesses required to identify the data file block that may contain the record, in the worst case, is ____________.
- GATE CS - 2023
- Database Management Systems