Language processors

A. serially reusable
B. recursive module
C. reenterable module
D. non-reusable module

A. bootstrap loader
B. loader
C. linker
D. None of the above

A. Linking
B. Loading
C. Allocation
D. Reallocation

A. Program
B. Algorithm
C. Decision Table
D. All of the above

A. Reductions
B. Literal table
C. Identifier table
D. Terminal table

A. 40
B. 0111EF
C. 9001000000
D. DA000F

A. F8
B. 03 16
C. 0111EF
D. 42 65 61 72

A. to assign storage to literals, and to ensure that the storage is allocated and appropriate locations are initialized
B. to assign storage to all temporary locations that are necessary for intermediate results
C. to assign storage to all variables referenced in the source program
D. All of the above

A. Interpreter is a kind of translator
B. Interpreter generates an object program from the source program
C. Interpreter analyses each source statement every time it is to be executed
D. All of the above

A. consists of a program and relevant information for its relocation
B. can itself perform the relocation of its address-sensitive portions
C. cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation
D. All of the above