| 1. | In compiler design ‘reducing the strength’ refers to |
| a. | reducing the range of values of input variables |
| b. | code optimization using cheaper machine instructions |
| c. | reducing efficiency of program |
| d. | None of the above |
| View Answer Report Discuss Too Difficult! |
|
Answer: (b).code optimization using cheaper machine instructions
|
| 2. | A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail |
| a. | 50% |
| b. | 60% |
| c. | 10% |
| d. | 70% |
| View Answer Report Discuss Too Difficult! |
|
Answer: (d).70%
|
| 3. | The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called __________ |
| a. | Symbol resolution |
| b. | Parsing |
| c. | Assembly |
| d. | Relocation |
| View Answer Report Discuss Too Difficult! |
|
Answer: (d).Relocation
|
| 4. | Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right |
| a. | Leftmost derivation |
| b. | Leftmost derivation traced out in reverse |
| c. | Rightmost derivation traced out till reverse |
| d. | Rightmost derivation |
| View Answer Report Discuss Too Difficult! |
|
Answer: (a).Leftmost derivation
|
| 5. | Which of the following concepts means adding new concepts to a program as it runs? |
| a. | Data hiding |
| b. | Dynamic loading |
| c. | Dynamic typing |
| d. | Dynamic binding |
| View Answer Report Discuss Too Difficult! |
|
Answer: (b).Dynamic loading
|
| 6. | In a two-pass assembler, symbol table is |
| a. | Generated in first pass |
| b. | Generated in second pass |
| c. | Not generated at all |
| d. | Generated and used only in second pass |
| View Answer Report Discuss Too Difficult! |
|
Answer: (c).Not generated at all
|
| 7. | Match the following: (a) Forward Reference Table (i) Assembler directive (b) Mnemonic Table (ii) Uses array data structure (c) Segment Register Table (iii) Contains machine OP code (d) EQU (iv) Uses linked list data structure code: (a) (b) (c) (d) |
| a. | (ii) (iii) (iv) (i) |
| b. | (iii) (iv) (ii) (i) |
| c. | (iv) (i) (iii) (ii) |
| d. | (iv) (iii) (ii) (i) |
| View Answer Report Discuss Too Difficult! |
|
Answer: (d).(iv) (iii) (ii) (i)
|
| 8. | The translator which performs macro calls expansion is called : |
| a. | Macro processor |
| b. | Micro pre-processor |
| c. | Macro pre-processor |
| d. | Dynamic linker |
| View Answer Report Discuss Too Difficult! |
|
Answer: (c).Macro pre-processor
|
| 9. | Which one from the following is false ? |
| a. | LALR parser is Bottom - Up parser |
| b. | A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1) |
| c. | LR parser is Bottom - Up parser |
| d. | In LL(1), the 1 indicates that there is a one - symbol look - ahead |
| View Answer Report Discuss Too Difficult! |
|
Answer: (b).A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1)
|
| 10. | Which phase of compiler generates stream of atoms ? |
| a. | Syntax analysis |
| b. | Lexical Analysis |
| c. | Code generation |
| d. | Code optimization |
| View Answer Report Discuss Too Difficult! |
|
Answer: (a).Syntax analysis
|
