61. | At the end of parsing, |
Answer: (a).tokens are identified.
|
62. | Dead-code elimination in machine code optimization refers to: |
Answer: (b).removal of values that never get used.
|
63. | A parse tree is an annotated parse tree if: |
Answer: (a).it shows attribute values at each node.
|
64. | In a two pass compiler, during the first pass: |
Answer: (a).user defined address symbols are correlated with their binary equivalent
|
65. | A single instruction in an assembly language program contains: |
Answer: (b).one macro operation
|
66. | Absolute loader demands that the programmer needs to know the: |
Answer: (a).start address of the available main memory
|
67. | Top-down parsers are predictive parsers, because: |
Answer: (a).next tokens are predicted
|
68. | In the context of compiler design, “reduction in strength” refers to: |
Answer: (a).code optimization obtained by the use of cheaper machine instructions
|
69. | How many states can a process be in? |
Answer: (d).5
|
70. | The parsing technique that avoids back tracking is: |
Answer: (c).Predictive
|