www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Compiler Design
32

Compiler Design MCQ with Answers

32) In which way a macro processor for assembly language can be implemented?

Independent two-pass processor

Independent one-pass processor

Processor incorporated into pass 1 of a standard two pass assembler

All of these

Answer is:

All of these

Explanation:

Macro processor for assembly language can be implemented by
* Independent two-pass processor
* Independent one-pass processor
* Processor incorporated into pass 1 of a standard two pass assembler

Compiler Design MCQ with Answers

For more MCQ's Click Here

33) Resolution of externally defined symbols is performed by

Linker

Loader

Compiler

Interpreter

Answer is:

Linker

34) A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar
S----> xxW ( PRINT "1")
S----> y { print " 2 " }
S----> Sz { print " 3 " )
What is the translation of xxxxyzz using the syntax directed translation scheme described by the above rules ?

23131

11233

11231

33211

Answer is:

23131

35) The symbol table implementation is based on the property of locality of reference is

linear list

search tree

hash table

self-organization list

Answer is:

hash table

36) In operator precedence parsing, precedence relations are defined

for all pair of non-terminals

for all pair of terminals

to delimit the handle

none of these

Answer is:

for all pair of non-terminals

Compiler Design MCQ with Answers

For more MCQ's Click Here

32) In which way a macro processor for assembly language can be implemented?

All of these

Compiler Design MCQ with Answers

Related Compiler Design MCQ with Answers

33) Resolution of externally defined symbols is performed by

Linker

23131

35) The symbol table implementation is based on the property of locality of reference is

hash table

36) In operator precedence parsing, precedence relations are defined

for all pair of non-terminals

Compiler Design MCQ with Answers