1. compiler work, source code into______' 2. A. Machine code B. Executable code C. Binary code D. Both B and C E. Both A and C 2. How many numbers of tokens in this statement____. printf("k= %d, &k = %x”, k, &k); All B. 31 c.4 D.10 E. none of these 3. one ormore parse tree for some sentence, that is ________grammer. a) Unambiguous b) Ambiguous c) Both Aand B d) None of these 4. A lexical analyzer produce__________ ? A. Machine code B. Binary code C. tokens D. Both Aand B E. None of these 5. The parts of the compiler are ____.A6 B.8 c.2 D3 E. None of these 6. One of the fastest logic is ______ 2, A. ECL B. TTL C. Both A and B D. None of these 7. compiler indicate the ______enor. A. Syntax error B. Logical enor C. Run time error D, Allof these 8. is not a phase of compiler. C. lexiacal D. Both A and CE. None of these 9. Parsing is also called______ analysis? A. semantic B. lexical C. syntax D. Both A and B 10. A process, a string of tokens can be generated by_______. A. Parsing B, Analysing C. Translating D. Allof these 11. Which of the following is the fastest logic? a) TTL b) ECL c) CMOS d) LSI View Answer 12, A bottom up parser generates __________ a) Right most derivationb) Rightmost derivation in reverse c) Leftmost derivation d) Leftmost derivation in reverse ‘View Answer 13, 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 View Answer 14. An optimizer Compiler __________. a) Is optimized to occupy less space +) Is optimized to occupy less space & Optimize the code c) Optimize the code d) None of the mentioned View Answer 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 View Answer 16. A latch is constructed using which two cross coupled? a) AND OR gates b) AND gates c) NAND and NOR gates d) NAND gates View Answer 17. Pee Hole optimization __________ a) Loop Optimization b) Local Optimization c) Constant folding d) Data Flow analysis View Answer 18. The optimization which avoids test at every iteration is? a) Loop unrolling b) Loop jamming c) Constant folding d) None of the mentioned19. Scissoring enables __________ a) A part of data to be displayed b) Entire data to be displayed c) None of the mentioned d) No data to be displayed 20. Shift reduce parsers are __________ a) Top down Parser b) Bottom Up parser c) May be top down or bottom up d) None of the mentioned 21.Which table is a permanent database that has an entry for each terminal symbol? (A) Reductions (B) Identifier table (C) Literal table (D) Terminal table 22.The action of parsing the source program into proper syntactic classes is called (A) General syntax analysis(B) Interpretation analysis (C) Syntax analysis (D) Lexical analysis 23.A bottom-up parser generates (A) Left-most derivation in reverse (B) Left-mpst derivation (C) Right-most derivation in reverse (D) Right -most derivation 24.The bottom-up parsing method is also called (A) Shift reduce parsing (B) Predictive parsing (C) Recursive descent parsing (D) None of these 25.The method which merges the bodies of two loops is (A) Constant folding (B) Loop jamming (C) Loop unrolling (D) None of these 26.Which of the following techniques is used to replace run-time computations by compile time computations? (A) Constant folding(B) Code hoisting (C) Pee phole optimization (D) Invariant computation 27.The most general phase structured grammar (A) Context sensitive (B) Context free (C) Regular (D) None of these 28.Which of the following class of statement usually produces no executable code when compiled? (A) Assignment statement (B) Structural statements (C) Input and output statements (D) Declaration 29. Which of the following techniques is used to replace run-time computations by compile time computations? (A) Constant folding (B) Code hoisting (C) Pee phole optimization (D) Invariant computation 30.The most general phase structured grammar