Computer Science Engineering Language Processors MCQ - Set 02 - ObjectiveBooks
Computer Science Engineering Language Processors MCQ - Set 02

Computer Science Engineering Language Processors MCQ - Set 02

Edit

Practice Test: Question Set - 02

1. The function(s) of the Syntax phase is/ are:
    (A) To recognize the major constructs of the language and to call the appropriate action routines that will generate the intermediate form or matrix for these constructs
    (B) To build a literal table and an identifier table
    (C) To build a uniform symbol table
    (D) To parse the source program into the basic elements or tokens of the language
2. Convert the ASCII/BEAR/assembly language pseudo-ops into hexadecimal machine language
    (A) 0111EF
    (B) 03 16
    (C) F8
    (D) 42 65 61 72
3. Convert the CHARI h#000F, s assembly language instructions into hexadecimal machine language:
    (A) 0111EF
    (B) 9001E6
    (C) DA000F
    (D) 40
4. A translator which reads an entire program written in a high level language and converts it into machine language code is:
    (A) Assembler
    (B) Translator
    (C) Compiler
    (D) System software
5. A relocate program form is the one which
    (A) 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
    (B) Consists of a program and relevant information for its relocation
    (C) Can itself perform the relocation of its address-sensitive portions
    (D) All of the above
6. Which of the following functions is/ are performed by the loader?
    (A) Allocate space in memory for the programs and resolve symbolic references between object decks
    (B) Physically place the machine instructions and data into memory
    (C) Adjust all address dependent locations, such as address constants, to correspond to the allocated space
    (D) All of the above
7. In an absolute loading scheme, which loader function is accomplished by loader?
    (A) Reallocation
    (B) Allocation
    (C) Linking
    (D) Loading
8. A self-relocating program is one which
    (A) 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
    (B) Consists of a program and relevant information for its relocation
    (C) Can itself perform the relocation of its address-sensitive portions
    (D) All of the above
9. Convert the 48 machine language instructions into assembly language, assuming that they were not generated by pseudo-ops:
    (A) ASRA
    (B) LOADA h#OD4E, i
    (C) STOREA h#014B, d
    (D) ADDA h#01FE, i
10. Terminal Table
    (A) A permanent table which lists all key words and special symbols of the language in symbolic form
    (B) A permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
    (C) Consists of a full or partial list of the tokens as they appear in the program. Created by Lexical analysis and used for syntax analysis and interpretation
    (D) Contains all constants in the program
Show and hide multiple DIV using JavaScript View All Answers

    Blogger Comment
    Facebook Comment