Compiler Construction MCQs for jobBy: Prof. Dr. Fazal Rehman | Last updated: April 30, 2025 10 Score: 0 Attempted: 0/10 Subscribe 1. : The binary of the decimal number 368 is equal to _____. (A) 10111000 (B) 111100101 (C) 110110000 (D) 110110010 2. : A lexical analyzer produces _____. (A) Tokens (B) Parser (C) Regular expression (D) Both A and B 3. : Compiler writers focus on which of the following? (A) Data dependence (B) Fast performance (C) Correctness (D) Both A and B 4. : The running time of a program is based on _____. (A) Addressing mode (B) Order of computations (C) Both A and B (D) All of these 5. : In the FSA (Finite State Automaton) technique, _____ is used in the compiler. (A) Parser (B) Lexical analysis (C) Token (D) Both A and C 6. : _____ is used to assign local variables. (A) Queue (B) Token (C) Registers (D) Stack 7. : A latch is built using _______ gates. (A) NAND and NOR (B) AND (C) AND, OR (D) Both A and B 8. : ________ are also called lexemes. (A) Identifiers (B) Keywords (C) Both A and B (D) None of these 9. : A compiler indicates which of the following errors? (A) Logical errors (B) Syntax errors (C) Grammatical errors (D) Both A and B 10. : One of the best parsers is ______. (A) Canonical LR (B) SLR (C) Both A and B (D) None of these Related Posts:Compiler construction tools and frameworks(MCQs)Compiler Construction MCQsFamous Recommended Books of Compiler ConstructionShift reduce parser | Compiler ConstructionFinite Automata(FA) in Compiler Construction and DesignRegular Expression in compiler construction