All Exams >
Computer Science Engineering (CSE) >
6 Months Preparation for GATE CSE >
All Questions
All questions of Intermediate Code Generation for Computer Science Engineering (CSE) Exam
If a state does not know whether it will make a shift operation or reduction for a terminal is called- a)Shift/reduce conflict
- b)Reduce /shift conflict
- c)Shift conflict
- d)Reduce conflict
Correct answer is option 'A'. Can you explain this answer?
If a state does not know whether it will make a shift operation or reduction for a terminal is called
a)
Shift/reduce conflict
b)
Reduce /shift conflict
c)
Shift conflict
d)
Reduce conflict
|
Aditi Gupta answered |
As the name suggests that the conflict is between shift and reduce hence it is called shift reduce conflict.
Which of these does not belong to CFG?- a)Terminal Symbol
- b)Non terminal Symbol
- c)Start symbol
- d)End Symbol
Correct answer is option 'D'. Can you explain this answer?
Which of these does not belong to CFG?
a)
Terminal Symbol
b)
Non terminal Symbol
c)
Start symbol
d)
End Symbol
|
Mansi Shah answered |
Explanation:
A context-free grammar (CFG) is a formal grammar used to describe the syntax of a programming language or other formal languages. It consists of a set of production rules that specify how symbols can be combined to form strings.
Terminal Symbol:
Terminal symbols are the basic building blocks of a language. They are the smallest units of a language that cannot be further divided. Terminal symbols represent the actual words or symbols that appear in the language. For example, in the context of a programming language, terminal symbols can represent keywords, operators, identifiers, literals, etc.
Non-terminal Symbol:
Non-terminal symbols are placeholders that represent groups of terminal symbols. They are used to define the structure of the language. Non-terminal symbols do not appear directly in the final language, but they are used in the production rules to specify how terminal symbols can be combined. For example, non-terminal symbols can represent expressions, statements, functions, etc.
Start Symbol:
The start symbol is a special non-terminal symbol that represents the beginning of the language. It is used to indicate where the derivation of a string should start. The start symbol is typically the left-hand side of the first production rule.
End Symbol:
Unlike the other three symbols, there is no concept of an "end symbol" in the context of a CFG. A CFG describes the structure of a language, but it does not specify how a string ends. The end of a string is typically determined by the specific language or parser that is used to process the string.
Therefore, the correct answer is option 'D' (End Symbol) as it does not belong to the context-free grammar.
A context-free grammar (CFG) is a formal grammar used to describe the syntax of a programming language or other formal languages. It consists of a set of production rules that specify how symbols can be combined to form strings.
Terminal Symbol:
Terminal symbols are the basic building blocks of a language. They are the smallest units of a language that cannot be further divided. Terminal symbols represent the actual words or symbols that appear in the language. For example, in the context of a programming language, terminal symbols can represent keywords, operators, identifiers, literals, etc.
Non-terminal Symbol:
Non-terminal symbols are placeholders that represent groups of terminal symbols. They are used to define the structure of the language. Non-terminal symbols do not appear directly in the final language, but they are used in the production rules to specify how terminal symbols can be combined. For example, non-terminal symbols can represent expressions, statements, functions, etc.
Start Symbol:
The start symbol is a special non-terminal symbol that represents the beginning of the language. It is used to indicate where the derivation of a string should start. The start symbol is typically the left-hand side of the first production rule.
End Symbol:
Unlike the other three symbols, there is no concept of an "end symbol" in the context of a CFG. A CFG describes the structure of a language, but it does not specify how a string ends. The end of a string is typically determined by the specific language or parser that is used to process the string.
Therefore, the correct answer is option 'D' (End Symbol) as it does not belong to the context-free grammar.
Advantage of incorporating the macro-processor into pass 1 is that- a)Many functions have to be implemented twice
- b)Functions are combined not necessarily creating intermediate files as output from the macro-processor and input to the assembler
- c)More flexibility is provided to the programmer in that he may use all the features of the assembler in conjunction with macros
- d)All of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Advantage of incorporating the macro-processor into pass 1 is that
a)
Many functions have to be implemented twice
b)
Functions are combined not necessarily creating intermediate files as output from the macro-processor and input to the assembler
c)
More flexibility is provided to the programmer in that he may use all the features of the assembler in conjunction with macros
d)
All of the mentioned
|
Soumya Pillai answered |
A general-purpose macro processor or general purpose pre-processor is a macro …designed primarily for string manipulation, macro definition.
A non relocatable program is the one which- a)Cannot execute in any area of storage other than the one designated
- b)Consists of a program and information for its relocation
- c)None of the mentioned
- d)All of the mentioned
Correct answer is option 'A'. Can you explain this answer?
A non relocatable program is the one which
a)
Cannot execute in any area of storage other than the one designated
b)
Consists of a program and information for its relocation
c)
None of the mentioned
d)
All of the mentioned
|
|
Divya Kaur answered |
Explanation:
Non-relocatable Program:
A non-relocatable program is a program that cannot execute in any area of storage other than the one designated. This means that the program is loaded into a specific memory location and cannot be moved to another location for execution.
Characteristics of Non-relocatable Program:
- Fixed Memory Location: Non-relocatable programs are designed to run from a specific memory location and cannot be relocated to another location for execution.
- No Information for Relocation: Unlike relocatable programs, non-relocatable programs do not contain any information for their relocation to different memory locations.
- Restricted Execution: These programs are limited to executing only in the designated memory location and cannot be run from any other location.
Advantages and Disadvantages:
- Advantages: Non-relocatable programs provide a secure and controlled environment for execution, as they are confined to a specific memory location.
- Disadvantages: The main disadvantage of non-relocatable programs is that they lack flexibility, as they cannot be moved to different memory locations for efficient memory management.
In conclusion, a non-relocatable program is designed to run from a fixed memory location and does not have the capability to execute in any other area of storage. It is important for ensuring security and control over program execution, but it may limit flexibility in memory management.
Non-relocatable Program:
A non-relocatable program is a program that cannot execute in any area of storage other than the one designated. This means that the program is loaded into a specific memory location and cannot be moved to another location for execution.
Characteristics of Non-relocatable Program:
- Fixed Memory Location: Non-relocatable programs are designed to run from a specific memory location and cannot be relocated to another location for execution.
- No Information for Relocation: Unlike relocatable programs, non-relocatable programs do not contain any information for their relocation to different memory locations.
- Restricted Execution: These programs are limited to executing only in the designated memory location and cannot be run from any other location.
Advantages and Disadvantages:
- Advantages: Non-relocatable programs provide a secure and controlled environment for execution, as they are confined to a specific memory location.
- Disadvantages: The main disadvantage of non-relocatable programs is that they lack flexibility, as they cannot be moved to different memory locations for efficient memory management.
In conclusion, a non-relocatable program is designed to run from a fixed memory location and does not have the capability to execute in any other area of storage. It is important for ensuring security and control over program execution, but it may limit flexibility in memory management.
AB+(A+B)’ is equivalent to- a)A?B
- b)A+B
- c)(A+B)A
- d)(A+B)B
Correct answer is option 'A'. Can you explain this answer?
AB+(A+B)’ is equivalent to
a)
A?B
b)
A+B
c)
(A+B)A
d)
(A+B)B
|
|
Shraddha Iyer answered |
It is equivalent to A? B.
Relocating bits used by relocating loader are specified by- a)Relocating loader itself
- b)Linker
- c)Assembler
- d)Macro Processor
Correct answer is option 'B'. Can you explain this answer?
Relocating bits used by relocating loader are specified by
a)
Relocating loader itself
b)
Linker
c)
Assembler
d)
Macro Processor
|
Kiran Mehta answered |
Relocating bits used by relocating loaders are specified by the linker.
Explanation:
A relocating loader is a program that loads an object program into memory for execution. It is responsible for allocating memory, resolving external references, and performing relocations. Relocations involve adjusting the memory addresses in the object program to match the actual memory locations where the program will be loaded.
When a program is compiled, it may contain references to external symbols, such as functions or variables, that are defined in other modules or libraries. These references are usually represented as symbolic addresses or offsets. However, these addresses are not fixed because the program can be loaded at different memory locations each time it is executed.
To resolve these external references and perform relocations, the relocating loader uses information provided by the linker. The linker is a program that combines multiple object files and libraries into a single executable file. It resolves symbols, calculates addresses, and generates relocation information.
The relocation information specifies the locations in the object program where adjustments need to be made. It contains the addresses or offsets that need to be modified to reflect the actual memory locations. The relocating loader uses this information to update the object program before loading it into memory.
Therefore, it is the linker's responsibility to specify the relocating bits used by the relocating loader. The linker analyzes the object files, resolves symbols, and generates relocation entries based on the memory layout and the addresses of external symbols. These relocation entries are then used by the relocating loader to perform the necessary adjustments during the loading process.
In conclusion, the linker is responsible for specifying the relocating bits used by the relocating loader. It generates relocation information based on the object files and libraries being linked, which is then used by the relocating loader to perform relocations and ensure correct execution of the program.
Explanation:
A relocating loader is a program that loads an object program into memory for execution. It is responsible for allocating memory, resolving external references, and performing relocations. Relocations involve adjusting the memory addresses in the object program to match the actual memory locations where the program will be loaded.
When a program is compiled, it may contain references to external symbols, such as functions or variables, that are defined in other modules or libraries. These references are usually represented as symbolic addresses or offsets. However, these addresses are not fixed because the program can be loaded at different memory locations each time it is executed.
To resolve these external references and perform relocations, the relocating loader uses information provided by the linker. The linker is a program that combines multiple object files and libraries into a single executable file. It resolves symbols, calculates addresses, and generates relocation information.
The relocation information specifies the locations in the object program where adjustments need to be made. It contains the addresses or offsets that need to be modified to reflect the actual memory locations. The relocating loader uses this information to update the object program before loading it into memory.
Therefore, it is the linker's responsibility to specify the relocating bits used by the relocating loader. The linker analyzes the object files, resolves symbols, and generates relocation entries based on the memory layout and the addresses of external symbols. These relocation entries are then used by the relocating loader to perform the necessary adjustments during the loading process.
In conclusion, the linker is responsible for specifying the relocating bits used by the relocating loader. It generates relocation information based on the object files and libraries being linked, which is then used by the relocating loader to perform relocations and ensure correct execution of the program.
The context free grammar S → SS | 0S1 | 1S0 | ɛ generates- a)Equal number of 0’s and 1’s
- b)Unequal number of 0’s and 1’s
- c)Number of 0’s followed by any number of 1’s
- d)None of the mentionedView Answer
Correct answer is option 'A'. Can you explain this answer?
The context free grammar S → SS | 0S1 | 1S0 | ɛ generates
a)
Equal number of 0’s and 1’s
b)
Unequal number of 0’s and 1’s
c)
Number of 0’s followed by any number of 1’s
d)
None of the mentionedView Answer
|
Abhijeet Mehta answered |
S->SS
S->0S1S
S->0S11S0
S->0110.
S->0S1S
S->0S11S0
S->0110.
Which of the following statement is false?- a)In derivation tree, the label of each leaf node is terminal
- b)In derivation tree, the label of all nodes except leaf nodes is a variable
- c)In derivation tree, if the root of a sub tree is X then it is called –tree
- d)None of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Which of the following statement is false?
a)
In derivation tree, the label of each leaf node is terminal
b)
In derivation tree, the label of all nodes except leaf nodes is a variable
c)
In derivation tree, if the root of a sub tree is X then it is called –tree
d)
None of the mentioned
|
Pritam Chatterjee answered |
All of them are true regarding a derivation tree.
The context free grammar S → A111|S1, A → A0 | 00 is equivalent to- a){0ⁿ1ᵐ | n=2, m=3}
- b){0ⁿ1ᵐ | n=1, m=5}
- c){0ⁿ1ᵐ | n should be greater than two and m should be greater than four}
- d)None of these
Correct answer is option 'A'. Can you explain this answer?
The context free grammar S → A111|S1, A → A0 | 00 is equivalent to
a)
{0ⁿ1ᵐ | n=2, m=3}
b)
{0ⁿ1ᵐ | n=1, m=5}
c)
{0ⁿ1ᵐ | n should be greater than two and m should be greater than four}
d)
None of these
|
|
Vaibhav Banerjee answered |
S-> A111
S->00111 (A->00)
S->00111 (A->00)
When ß is empty (A -> ß.,a ), the reduction by A-> a is done- a)If next symbol is a terminal
- b)Only If the next input symbol is a
- c)Only If the next input symbol is A
- d)none of these
Correct answer is option 'B'. Can you explain this answer?
When ß is empty (A -> ß.,a ), the reduction by A-> a is done
a)
If next symbol is a terminal
b)
Only If the next input symbol is a
c)
Only If the next input symbol is A
d)
none of these
|
Priyanka Ahuja answered |
I am sorry, your question is incomplete. Please provide more information so that I may assist you better.
The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?- a)Closure and goto operations work a little bit different
- b)Closure and goto operations work similarly
- c)Closure and additive operations work a little bit different
- d)Closure and associatively operations work a little bit different.
Correct answer is option 'A'. Can you explain this answer?
The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?
a)
Closure and goto operations work a little bit different
b)
Closure and goto operations work similarly
c)
Closure and additive operations work a little bit different
d)
Closure and associatively operations work a little bit different.
|
Dipika Chavan answered |
Understanding LR(1) Items
The construction of canonical collections for LR(1) items indeed resembles that for LR(0) items, but there are key differences particularly in the closure and goto operations.
Key Differences Between LR(0) and LR(1)
- **Closure Operation**:
- In LR(0), the closure operation collects items based solely on the production rules.
- In LR(1), the closure must also consider the lookahead symbol. This means that when a non-terminal is expanded, we need to include items that can be derived with a specific lookahead, making the closure operation more complex.
- **Goto Operation**:
- The goto operation in LR(0) transitions to the next state based purely on the input symbols.
- In LR(1), the goto operation not only transitions based on the input but must also maintain the lookahead context. This ensures that the parser can accurately determine the next state based on both the current item and the lookahead symbol.
Conclusion
The correct answer to the question is option 'A' because the closure and goto operations in LR(1) items differ from their LR(0) counterparts primarily due to the necessity of incorporating lookahead symbols. This additional complexity is what sets LR(1) apart, making the parsing process more precise and capable of handling a broader range of grammars.
The construction of canonical collections for LR(1) items indeed resembles that for LR(0) items, but there are key differences particularly in the closure and goto operations.
Key Differences Between LR(0) and LR(1)
- **Closure Operation**:
- In LR(0), the closure operation collects items based solely on the production rules.
- In LR(1), the closure must also consider the lookahead symbol. This means that when a non-terminal is expanded, we need to include items that can be derived with a specific lookahead, making the closure operation more complex.
- **Goto Operation**:
- The goto operation in LR(0) transitions to the next state based purely on the input symbols.
- In LR(1), the goto operation not only transitions based on the input but must also maintain the lookahead context. This ensures that the parser can accurately determine the next state based on both the current item and the lookahead symbol.
Conclusion
The correct answer to the question is option 'A' because the closure and goto operations in LR(1) items differ from their LR(0) counterparts primarily due to the necessity of incorporating lookahead symbols. This additional complexity is what sets LR(1) apart, making the parsing process more precise and capable of handling a broader range of grammars.
Which of the following can be accessed by transfer vector approach of linking?- a)External data segments
- b)External sub-routines
- c)Data located in other procedure
- d)All of the mentioned
Correct answer is option 'B'. Can you explain this answer?
Which of the following can be accessed by transfer vector approach of linking?
a)
External data segments
b)
External sub-routines
c)
Data located in other procedure
d)
All of the mentioned
|
|
Kunal Gupta answered |
External subroutines are routines that are created and maintained separately from the program that will be calling them.
A context free language is called ambiguous if- a)It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
- b)It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
- c)Both (a) and (b)
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
A context free language is called ambiguous if
a)
It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
b)
It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
c)
Both (a) and (b)
d)
None of the mentioned
|
Samarth Kapoor answered |
When two or more Left and right most derivative occur the grammar turn ambiguous.
Grammar that produce more than one Parse tree for same sentence is- a)Ambiguous
- b)Unambiguous
- c)Complementary
- d)Concatenation Intersection
Correct answer is option 'A'. Can you explain this answer?
Grammar that produce more than one Parse tree for same sentence is
a)
Ambiguous
b)
Unambiguous
c)
Complementary
d)
Concatenation Intersection
|
Anirban Khanna answered |
An ambiguous grammar is one for which there is more than one parse tree for a single sentence. Since each parse tree corresponds to exactly one leftmost (or rightmost) derivation, an ambiguous grammar is one for which there is more than one leftmost (or rightmost) derivation of a given sentence.
System program such a s compiler are designed so that they are- a)Re-enterable
- b)Non reusable
- c)Serially usable
- d)None of the mentioned
Correct answer is option 'A'. Can you explain this answer?
System program such a s compiler are designed so that they are
a)
Re-enterable
b)
Non reusable
c)
Serially usable
d)
None of the mentioned
|
|
Neha Mishra answered |
Re-enterable is the keyword for compiler being designed.
The graph that shows basic blocks and their successor relationship is called- a)Dag
- b)Flow Graph
- c)Control Graph
- d)Hamilton Graph
Correct answer is option 'B'. Can you explain this answer?
The graph that shows basic blocks and their successor relationship is called
a)
Dag
b)
Flow Graph
c)
Control Graph
d)
Hamilton Graph
|
|
Mrinalini Menon answered |
Understanding Flow Graphs
A Flow Graph is an essential concept in computer science, particularly in the analysis and optimization of programs. It represents the control flow within a program by showing how basic blocks of code are interconnected. Here’s a breakdown of its significance:
What is a Basic Block?
- A basic block is a sequence of instructions that executes linearly without any jumps or branches.
- Each block begins with a single entry point and ends with a single exit point.
Successor Relationship
- The successor relationship in a flow graph indicates which basic blocks can be executed after a given block.
- This is crucial for understanding how control flows through the program, especially in scenarios involving loops and conditional statements.
Significance of Flow Graphs
- Optimization: Flow graphs are used in compiler optimizations to enhance the efficiency of the generated code.
- Control Structures: They help visualize complex control structures like loops, conditionals, and function calls.
- Analysis: Flow graphs enable static analysis of programs, identifying unreachable code and potential bugs.
Comparison with Other Graph Types
- DAG (Directed Acyclic Graph): Unlike flow graphs, DAGs do not allow cycles, making them unsuitable for representing control flow with loops.
- Control Graph: While often used interchangeably, flow graphs specifically focus on execution paths rather than general relationships.
- Hamilton Graph: This type of graph pertains to specific paths that visit every vertex exactly once, which is unrelated to control flow representation.
In summary, the correct answer is option 'B' because a flow graph effectively captures the basic blocks and their successor relationships, providing a clear representation of the program's control flow.
A Flow Graph is an essential concept in computer science, particularly in the analysis and optimization of programs. It represents the control flow within a program by showing how basic blocks of code are interconnected. Here’s a breakdown of its significance:
What is a Basic Block?
- A basic block is a sequence of instructions that executes linearly without any jumps or branches.
- Each block begins with a single entry point and ends with a single exit point.
Successor Relationship
- The successor relationship in a flow graph indicates which basic blocks can be executed after a given block.
- This is crucial for understanding how control flows through the program, especially in scenarios involving loops and conditional statements.
Significance of Flow Graphs
- Optimization: Flow graphs are used in compiler optimizations to enhance the efficiency of the generated code.
- Control Structures: They help visualize complex control structures like loops, conditionals, and function calls.
- Analysis: Flow graphs enable static analysis of programs, identifying unreachable code and potential bugs.
Comparison with Other Graph Types
- DAG (Directed Acyclic Graph): Unlike flow graphs, DAGs do not allow cycles, making them unsuitable for representing control flow with loops.
- Control Graph: While often used interchangeably, flow graphs specifically focus on execution paths rather than general relationships.
- Hamilton Graph: This type of graph pertains to specific paths that visit every vertex exactly once, which is unrelated to control flow representation.
In summary, the correct answer is option 'B' because a flow graph effectively captures the basic blocks and their successor relationships, providing a clear representation of the program's control flow.
What is the binary equivalent of the decimal number 368- a)10111000
- b)110110000
- c)111010000
- d)111100000
Correct answer is option 'B'. Can you explain this answer?
What is the binary equivalent of the decimal number 368
a)
10111000
b)
110110000
c)
111010000
d)
111100000
|
|
Meghana Rane answered |
368 binary equivalents is
8=1000
6=0110
3=0011
So 1101101000.
8=1000
6=0110
3=0011
So 1101101000.
A relocatable program form is one which- a)Cannot execute in any area of storage other than the one designated
- b)Consists of a program and information for its relocation
- c)None of the mentioned
- d)All of the mentioned
Correct answer is option 'C'. Can you explain this answer?
A relocatable program form is one which
a)
Cannot execute in any area of storage other than the one designated
b)
Consists of a program and information for its relocation
c)
None of the mentioned
d)
All of the mentioned
|
|
Ipsita Dasgupta answered |
A relocatable program form is one which consists of a program and relevant information for its relocation. Using this information it is possible to relocate the program to execute from a storage area then the one designated for it at the time of its coding or translation.
Grammars that can be translated to DFAs:- a)Left linear grammar
- b)Right linear grammar
- c)Generic grammar
- d)All of the mentioned
Correct answer is option 'B'. Can you explain this answer?
Grammars that can be translated to DFAs:
a)
Left linear grammar
b)
Right linear grammar
c)
Generic grammar
d)
All of the mentioned
|
Suyash Chauhan answered |
Right linear grammar can be translated to the DFAs.
An optimizer Compiler- a)Is optimized to occupy less space
- b)Both of the mentioned
- c)Optimize the code
- d)None of the mentioned
Correct answer is option 'D'. Can you explain this answer?
An optimizer Compiler
a)
Is optimized to occupy less space
b)
Both of the mentioned
c)
Optimize the code
d)
None of the mentioned
|
Rajveer Sharma answered |
Understanding Compiler Optimizers
Compilers play a crucial role in converting high-level programming languages into machine code. Among their various functions, optimizers are essential for enhancing performance and efficiency. However, the given answer, option 'D' (None of the mentioned), suggests a misunderstanding of the role of compiler optimizers.
Functions of Compiler Optimizers
- Code Optimization: Optimizers improve the performance of the code by making it run faster or consume less memory. They may eliminate redundant calculations or simplify expressions.
- Space Optimization: While some optimizers do indeed aim to reduce the size of the generated code, not all optimizers prioritize this. The focus can vary based on the optimization level and target environment.
- Performance Enhancement: The primary goal of many optimizers is to enhance execution speed, which may not always correlate with reduced memory usage.
Why 'None of the mentioned' is Incorrect
- The question implies that optimizers exclusively aim at occupying less space or both. This is misleading because optimizers can serve multiple goals, including performance and space efficiency.
- While option 'D' suggests that compiler optimizers do not focus on space or performance optimization, this is inaccurate. They often work on multiple fronts simultaneously or selectively, depending on the requirements.
Conclusion
In summary, compiler optimizers are designed to improve various aspects of code, including speed and memory usage. The selection of optimization techniques depends on the context and specific goals of the compilation process. Thus, the correct answer should acknowledge the multifaceted role of optimizers rather than dismiss their capabilities entirely.
Compilers play a crucial role in converting high-level programming languages into machine code. Among their various functions, optimizers are essential for enhancing performance and efficiency. However, the given answer, option 'D' (None of the mentioned), suggests a misunderstanding of the role of compiler optimizers.
Functions of Compiler Optimizers
- Code Optimization: Optimizers improve the performance of the code by making it run faster or consume less memory. They may eliminate redundant calculations or simplify expressions.
- Space Optimization: While some optimizers do indeed aim to reduce the size of the generated code, not all optimizers prioritize this. The focus can vary based on the optimization level and target environment.
- Performance Enhancement: The primary goal of many optimizers is to enhance execution speed, which may not always correlate with reduced memory usage.
Why 'None of the mentioned' is Incorrect
- The question implies that optimizers exclusively aim at occupying less space or both. This is misleading because optimizers can serve multiple goals, including performance and space efficiency.
- While option 'D' suggests that compiler optimizers do not focus on space or performance optimization, this is inaccurate. They often work on multiple fronts simultaneously or selectively, depending on the requirements.
Conclusion
In summary, compiler optimizers are designed to improve various aspects of code, including speed and memory usage. The selection of optimization techniques depends on the context and specific goals of the compilation process. Thus, the correct answer should acknowledge the multifaceted role of optimizers rather than dismiss their capabilities entirely.
Which of the following statement is false?- a)The CFG can be converted to Chomsky normal form
- b)The CFG can be converted to Greibach normal form
- c)CFG is accepted by push down automata
- d)None of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Which of the following statement is false?
a)
The CFG can be converted to Chomsky normal form
b)
The CFG can be converted to Greibach normal form
c)
CFG is accepted by push down automata
d)
None of the mentioned
|
|
Ameya Goyal answered |
All the statements follow the rules.
Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ?- a)S1 is correct and S2 is not correct.
- b)Both S1 and S2 are correct.
- c)Both S1 and S2 are not correct.
- d)S1 is not correct and S2 is correct.
Correct answer is option 'B'. Can you explain this answer?
Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ?
a)
S1 is correct and S2 is not correct.
b)
Both S1 and S2 are correct.
c)
Both S1 and S2 are not correct.
d)
S1 is not correct and S2 is correct.
|
|
Yashvi Das answered |
The assumptions of statement S1 and S2 are correct.
When a computer is rebooted, a special type of loader is executed called- a)Compile and GO ” loader
- b)Boot loader
- c)Bootstrap Loader
- d)Relating Loader
Correct answer is option 'C'. Can you explain this answer?
When a computer is rebooted, a special type of loader is executed called
a)
Compile and GO ” loader
b)
Boot loader
c)
Bootstrap Loader
d)
Relating Loader
|
|
Ipsita Dasgupta answered |
A boot loader, is a small program that places the operating system (OS) of a computer into memory.
Given the following statements : (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements ?- a)I only
- b)II only
- c)Both I and II
- d)Neither I nor II
Correct answer is option 'B'. Can you explain this answer?
Given the following statements : (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements ?
a)
I only
b)
II only
c)
Both I and II
d)
Neither I nor II
|
Subhankar Shah answered |
Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.
The language accepted by a Push down Automata- a)Type0
- b)Type1
- c)Type2
- d)Type3
Correct answer is option 'C'. Can you explain this answer?
The language accepted by a Push down Automata
a)
Type0
b)
Type1
c)
Type2
d)
Type3
|
|
Tarun Saini answered |
A known fact that type 2 grammar is accepted by PDA.
A regular Grammar is a- a)CFG
- b)Non CFG
- c)English Grammar
- d)None of the mentioned
Correct answer is option 'A'. Can you explain this answer?
A regular Grammar is a
a)
CFG
b)
Non CFG
c)
English Grammar
d)
None of the mentioned
|
|
Subhankar Shah answered |
Regular grammar is CFG. It restricts its rules to a single non terminal on left hand side.
Disadvantage of ” Compile and GO ” loading scheme is that- a)Memory is wasted because the case occupied by the assembler is unavailable to the object program
- b)Necessary to translate the users program
- c)It is very difficult to handle multiple segments, even when the source programs are in different languages and to produce orderly modular programs
- d)All of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Disadvantage of ” Compile and GO ” loading scheme is that
a)
Memory is wasted because the case occupied by the assembler is unavailable to the object program
b)
Necessary to translate the users program
c)
It is very difficult to handle multiple segments, even when the source programs are in different languages and to produce orderly modular programs
d)
All of the mentioned
|
Srishti Yadav answered |
In computer programming, a compile and go system, compile, load, and go system, assemble and go system, or load and go system[1][2][3] is a programming language processor in which the compilation, assembly, or link steps are not separated from program execution.
A series of statements explaining how the data is to be processed is called- a)Assembly
- b)Machine
- c)COBOL
- d)Program
Correct answer is option 'D'. Can you explain this answer?
A series of statements explaining how the data is to be processed is called
a)
Assembly
b)
Machine
c)
COBOL
d)
Program
|
|
Abhay Ghoshal answered |
A program is a sequence of instructions, written to perform a task by computer. It requires programs to function, typically executing the program’s instructions in a central processor.
Which of the following is a phase of a compilation process?- a)Lexical Analysis
- b)Code Generation
- c)Both of the mentioned
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
Which of the following is a phase of a compilation process?
a)
Lexical Analysis
b)
Code Generation
c)
Both of the mentioned
d)
None of the mentioned
|
|
Anoushka Dey answered |
Lexical analysis and code generation is a phase of compilation process.
Function of the storage assignment is- a)Assign storage to all variables referenced in the source program
- b)Assign storage to all temporary locations that are necessary for intermediate results
- c)Assign storage to literals, and to ensure that the storage is allocated and appropriate locations are initialized
- d)All of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Function of the storage assignment is
a)
Assign storage to all variables referenced in the source program
b)
Assign storage to all temporary locations that are necessary for intermediate results
c)
Assign storage to literals, and to ensure that the storage is allocated and appropriate locations are initialized
d)
All of the mentioned
|
|
Nabanita Basak answered |
The storage assignment performs the above mentioned tasks.
A grammar that produces more than one parse tree for some sentence is called- a)Ambiguous
- b)Unambiguous
- c)Regular
- d)None of the mentioned
Correct answer is option 'A'. Can you explain this answer?
A grammar that produces more than one parse tree for some sentence is called
a)
Ambiguous
b)
Unambiguous
c)
Regular
d)
None of the mentioned
|
|
Shraddha Iyer answered |
Ambiguous grammar has more than one parse tree.
A bottom up parser generates- a)Right most derivation
- b)Rightmost derivation in reverse
- c)Leftmost derivation
- d)Leftmost derivation in reverse
Correct answer is option 'B'. Can you explain this answer?
A bottom up parser generates
a)
Right most derivation
b)
Rightmost derivation in reverse
c)
Leftmost derivation
d)
Leftmost derivation in reverse
|
|
Bijoy Iyer answered |
This corresponds to starting at the leaves of the parse tree also known as shift-reduce parsing.
Which of the following is the fastest logic- a)TTL
- b)ECL
- c)CMOS
- d)LSI
Correct answer is option 'B'. Can you explain this answer?
Which of the following is the fastest logic
a)
TTL
b)
ECL
c)
CMOS
d)
LSI
|
|
Arka Dasgupta answered |
In electronics, emitter-coupled logic (ECL) is a high-speed integrated circuit.
A self-relocating program is one which- a)Cannot execute in any area of storage other than the one designated
- b)Consists of a program and information for its relocation
- c)None of the mentioned
- d)All of the mentioned
Correct answer is option 'C'. Can you explain this answer?
A self-relocating program is one which
a)
Cannot execute in any area of storage other than the one designated
b)
Consists of a program and information for its relocation
c)
None of the mentioned
d)
All of the mentioned
|
|
Nabanita Basak answered |
A self-relocating program is a program which can perform the relocation itself
•A table of information about address sensitive instruction in the program.
•Relocating logic that can perform the relocation of the address sensitive instructions.
•A table of information about address sensitive instruction in the program.
•Relocating logic that can perform the relocation of the address sensitive instructions.
When there is a reduce/reduce conflict?- a)If a state does not know whether it will make a shift operation using the production rule i or j for a terminal
- b)If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal
- c)If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
When there is a reduce/reduce conflict?
a)
If a state does not know whether it will make a shift operation using the production rule i or j for a terminal
b)
If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal
c)
If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal
d)
None of the mentioned
|
|
Neha Mishra answered |
It occurs when If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal.
Running time of a program depends on- a)Addressing mode
- b)Order of computations
- c)The usage of machine idioms
- d)All of the mentioned
Correct answer is option 'D'. Can you explain this answer?
Running time of a program depends on
a)
Addressing mode
b)
Order of computations
c)
The usage of machine idioms
d)
All of the mentioned
|
|
Arnab Kapoor answered |
Run time, runtime or execution time is the time during which a program is running (executing).
When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head- a)Will be affecting
- b)Does not have any affect
- c)Shift will take place
- d)Reduction will take place
Correct answer is option 'B'. Can you explain this answer?
When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head
a)
Will be affecting
b)
Does not have any affect
c)
Shift will take place
d)
Reduction will take place
|
|
Sanchita Chauhan answered |
There is no terminal before the non terminal beta.
A CFG is closed under- a)Union
- b)Kleene star
- c)Concatenation
- d)None of the mentioned
Correct answer is option 'D'. Can you explain this answer?
A CFG is closed under
a)
Union
b)
Kleene star
c)
Concatenation
d)
None of the mentioned
|
|
Sounak Joshi answered |
CFG is closed under the above mentioned 3 operations.
A top down parser generates- a)Rightmost Derivation
- b)Right most derivation in reverse
- c)Left most derivation
- d)Left most derivation in reverse
Correct answer is option 'C'. Can you explain this answer?
A top down parser generates
a)
Rightmost Derivation
b)
Right most derivation in reverse
c)
Left most derivation
d)
Left most derivation in reverse
|
|
Bijoy Iyer answered |
Top-down parsing is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar.
Terminal table- a)Contains all constants in the program
- b)Is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
- c)Consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation
- d)Is a permanent table which lists all keywords and special symbols of the language in symbolic form
Correct answer is option 'D'. Can you explain this answer?
Terminal table
a)
Contains all constants in the program
b)
Is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
c)
Consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation
d)
Is a permanent table which lists all keywords and special symbols of the language in symbolic form
|
|
Sounak Joshi answered |
A permanent database that has entry for each terminal symbols such as arithmetic operators, keywords, punctuation characters such as ‘;’, ‘,’etc Fields: Name of the symbol.
The linker- a)Is similar to interpreter
- b)Uses source code as its input
- c)Is required to create a load module
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
The linker
a)
Is similar to interpreter
b)
Uses source code as its input
c)
Is required to create a load module
d)
None of the mentioned
|
|
Arka Dasgupta answered |
It is a program that takes one or more object files generated by a compiler and combines them into a single executable file, library file, or another object file.
The specific task storage manager performs- a)Allocation/ deal location of programs
- b)Protection of storage area assigned to the program
- c)Both of the mentioned
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
The specific task storage manager performs
a)
Allocation/ deal location of programs
b)
Protection of storage area assigned to the program
c)
Both of the mentioned
d)
None of the mentioned
|
Snehal Desai answered |
Its basic function is that of the task storage manager.
Chapter doubts & questions for Intermediate Code Generation - 6 Months Preparation for GATE CSE 2025 is part of Computer Science Engineering (CSE) exam preparation. The chapters have been prepared according to the Computer Science Engineering (CSE) exam syllabus. The Chapter doubts & questions, notes, tests & MCQs are made for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.
Chapter doubts & questions of Intermediate Code Generation - 6 Months Preparation for GATE CSE in English & Hindi are available as part of Computer Science Engineering (CSE) exam.
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
6 Months Preparation for GATE CSE
453 videos|1305 docs|700 tests
|
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up
within 7 days!
within 7 days!
Takes less than 10 seconds to signup