Compiler Design
Compiler Design
- What is the name for the use of regular expressions by a lexical analyzer to define and recognize valid tokens?
- Which of the following best describes Lexical pattern matching?
- Identify the correct concept described as: a technique that compiles code into machine instructions at runtime rather than before execution.
- Just-in-time (JIT) compilation is best defined as which of the following?
- A code optimization technique that examines a small set of adjacent instructions to replace them with a more efficient sequence. What is this concept called?
- Choose the correct description of Peephole optimization.
- Which of the following best names the concept in which a compiler capable of creating executable code for a platform other than the one on which the compiler itself runs?
- What is the function or purpose of Cross-compiler?
- The concept in which an intermediate, platform-independent representation of source code designed to be executed by a virtual machine is best known as which of these terms?
- Identify the correct definition of Bytecode.
- What term describes the following? a compiler process that verifies whether operations in a program are performed on compatible data types.
- In computer science, Type checking refers to which of the following?
- Select the correct name for: the part of a compiler responsible for analyzing source code, including lexical, syntax, and semantic analysis.
- The concept in which a program that translates assembly language source code into machine code is best known as which of these terms?
- Identify the correct definition of Assembler.
- What term describes the following? a program that combines multiple object files generated by a compiler into a single executable program.
- In computer science, Linker refers to which of the following?
- Select the correct name for: a program that loads an executable file into memory and prepares it for execution.
- Which statement correctly explains Loader?
- Which concept is defined as follows: a parsing strategy that builds a parse tree starting from the input tokens and working up toward the start symbol?