Question 1 : Shift reduce parsers are
1. Top down Parser
2. Bottom Up parser
3. May be top down or bottom up
4. None of the mentioned
View Answer   Discuss with Members

Question 2 : The optimization which avoids test at every iteration is
1. Loop unrolling
2. Loop jamming
3. Constant folding
4. None of the mentioned
View Answer   Discuss with Members

Question 3 : Pee Hole optimization
1. Loop Optimization
2. Local Optimization
3. Constant folding
4. Data Flow analysis
View Answer   Discuss with Members

Question 4 : A latch is constructed using two cross coupled
1. AND OR gates
2. AND gates
3. NAND and NOR gates
4. NAND gates
View Answer   Discuss with Members

Question 5 : The linker
1. Is similar to interpreter
2. Uses source code as its input
3. Is required to create a load module
4. None of the mentioned
View Answer   Discuss with Members

Question 6 : An optimizer Compiler
1. Is optimized to occupy less space
2. Both of the mentioned
3. Optimize the code
4. None of the mentioned
View Answer   Discuss with Members

Question 7 : A grammar that produces more than one parse tree for some sentence is called
1. Ambiguous
2. Unambiguous
3. Regular
4. None of the mentioned
View Answer   Discuss with Members

Question 8 : A bottom up parser generates
1. Right most derivation
2. Rightmost derivation in reverse
3. Leftmost derivation
4. Leftmost derivation in reverse
View Answer   Discuss with Members

Question 9 : Which of the following is the fastest logic
1. TTL
2. ECL
3. CMOS
4. LSI
View Answer   Discuss with Members

Question 10 : Running time of a program depends on
1. Addressing mode
2. Order of computations
3. The usage of machine idioms
4. All of the mentioned
View Answer   Discuss with Members