1.

Compiler translates the source code to

 A. Executable code

 B. Machine code

 C. Binary code

 D. Both B and C

2. Which of the following groups is/are token together into semantic structures?

 A. Syntax analyzer

 B. Intermediate code generation

 C. Lexical analyzer

 D. Semantic analyzer

3. Compiler should report the presence of __________ in the source program, in

translation process.

 A. Classes

 B. Objects

4. What is the output

of lexical analyzer?

 A. A parse tree
 B. A list of tokens

 C. Intermediate

code

 D. Machine code

5. Compiler translates

the source code to

 A. Executable code

 B. Machine code

 C. Binary code

 D. Both B and C

6. Which of the

following groups

is/are token together

into semantic

structures?

 A. Syntax analyzer

 B. Intermediate

code generation
 C. Lexical analyzer

 D. Semantic

analyzer

7. Compiler should

report the presence

of __________ in the

source program, in

translation process.

 A. Classes

 B. Objects

 C. Errors

 D. Text

8. What is the output

of lexical analyzer?

 A. A parse tree

 B. A list of tokens

 C. Intermediate

code

 D. Machine code

9. Compiler can check

 ________ error.

 A. Logical

 B. Syntax

 C. Content

 D. Both A and B

10.A grammar that

produces more than

one parse tree for

some sentence is

called as

 A. Ambiguous

 B. Unambiguous

 C. Regular

 D. All of these

11.Lexical analysis is

about breaking a

sequence of
 characters into

 A. Groups

 B. Packets

 C. Lines

 D. Tokens

12.
16.Three

address

code

involves

 A. Exactly 3

address

 B. At most

most 3

address

 C. No unary

operators

 D. None of

these

_______ is the most

general phase

structured
 14.What is the name

of the process that

determining
grammar.
whether a string of  C. Errors

 A.can
tokens Context
be sensitive
 D. Text
generated by a
 B. Regular
grammar?

 C. Context free
 A. Analysing

 D. All of these
 B. Recognizing

13.________ is
 C. Translating
considered as a

 sequence of
D. Parsing

characters in a
15.A _________ is a
token.
software utility

 A. Texeme
tha

t tra B. Pattern

 C. code
nslates Lexeme

written in higher
 D. Mexeme
language into a

low level language.

 A. Converter
 B. Compiler

 C. Text editor

17. Which of the following is a phase of a compilation process ?

 D. Code optimizer

A.Lexical analysis

B.Code generation

C.Both (a) and (b)

D.None of these

18. System program such a s compiler are designed so that they are

A.re-enterable

B.non-reusable

C.serially usable

D.None of these

19. A series of statements explaining how the data is to be processed is called

A.assembly

B.machine

C.COBOL
 D.program

20. A system program that setup an executable program in main memory ready for execution

is

A.assembler

B.linker

C.loader

D.load and go

21. Which of the following system program forgoes the production of object code to generate

absolute machine code and load it into the physical main storage location from which it will

be executed immediately upon completion of the assembly ?

A.Two pass assembler

B.Load-and-go-assembler

C.Macroprocessor

D.Linker

22. Compiler can diagnose

A.grammatical errors only

B.logical errors only

C.grammatical as well as logical errors

 D.None of these

23. A system program that set-up an executable program in main memory ready for execution

is

A.assembler

B.linker

C.Loader

D.text editor

24. A programmer, by mistake, writes an instruction to divide, instead of a multiply, such

error can be detected by a/an

A.compiler

B.interpreter

C.compiler or interpreter test

D.None of these

25. The computer language generally translated to pseudocode is

A.Assembly

B.Machine
 C.Pascal

D.FORTRAN

26. A system program that combines separately compiled modules of a program into a form

suitable for execution is

A.assembler

B.linking loader

C.cross compiler

D.None of these

27. In which way a macro processor for assembly language can be implemented?

A.Independent two-pass processor

B.Independent one-pass processor

C.Processor incorporated into pass 1 of a standard two pass assembler

D.All of these

28. Resolution of externally defined symbols is performed by

A.Linker

B.Loader

C.Compiler
 D.Interpreter

29. The symbol table implementation is based on the property of locality of reference is

A.linear list

B.search tree

C.hash table

D.self-organization list

30. In operator precedence parsing, precedence relations are defined

A.for all pair of non-terminals

B.for all pair of terminals

C.to delimit the handle

D.none of these

31. LR parsers are attractive because

A.it can be constructed to recognize CFG corresponding to almost all programming constructs

B.it doesnot backtrack

C.both (a) and (b)

D.none of these

32. The most powerful parser is

 A.SLR

B.LALR

C.Canonical LR

D.Operator-precedence

33. YACC builds up

A.SLR parsing table

B.canonical LR parsing table

C.LALR parsing table

D.none of these