Compilers Questions and Answers – Intermediate Code-Generation – 2

This set of Compilers Questions and Answers for Entrance exams focuses on “Intermediate Code – Generation – 2”.

1. Consider the following two statements:
P: Every regular grammar is LL(1)
Q: Every regular set has LR(1) grammar
Which of the following is TRUE?
a) Both P and Q are true
b) P is true and Q is false
c) P is false and Q is true
d) Both P and Q are false
View Answer

2. In a simplified computer the instructions are:

OP R j, Ri − Performs Rj OP Ri and stores the result in register Ri 
OP m, Ri − Performs val OP Ri abd stores the result in Ri. value denotes the content of memory location m. 
MCVm, Ri −Moves the content off memory loction m to register Ri.
MCVm, Ri, m −Moves the content of register Ri to memory location m.

The computer has only two registers, and OP is either ADD or SUB. Consider the following basic block:

t1 = a + b 
t2 = c + d 
t3 = e − t2
t4 = t 1 − t2

Assume that all operands are initially in memory. The final value of the computation should be in memory. What is the minimum number of MOV instructions in the code generated for this basic block?
a) 2
b) 3
c) 5
d) 6
View Answer

3. Which of the following strings is generated by the grammar?

S->bA       S->aB
A->a          B->b
A->aS           B->bS
A->bAA          B->aBB

a) aaaabb
b) aabbbb
c) aabbab
d) abbbba
View Answer

4. How many derivation trees are there?

S->bA       S->aB
A->a          B->b
A->aS           B->bS
A->bAA          B->aBB

a) 1
b) 2
c) 3
d) 4
View Answer

5. Which of the following describes a handle (as applicable to LR-parsing) appropriately?
a) It is the position in a sentential form where the next shift or reduce operation will occur
b) It is a non-terminal whose production will be used for reduction in the next step
c) It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur.
d) It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be found
View Answer

6. Some code optimizations are carried out on the intermediate code because _______________
a) They enhance the portability of the complier to other target processors
b) Program analysis is name accurate on intermediate code than on machine code
c) The information from data flow analysis cannot otherwise be used for optimization
d) The information from the front end cannot otherwise be used for optimization
View Answer

7. Which of the following are true?
(i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation
(ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function
(iii) Recursion in programming languages cannot be implemented with dynamic storage allocation
(iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records
(v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
a) (ii) and (v) only
b) (i), (iii) and (iv) only
c) (i), (ii) and (v)
d) (ii), (iii) and (v) only
View Answer

8. An LALR(1) parser for a grammar can have shift-reduce (S-R) conflicts if and only if ___________
a) The SLR(1) parser for G has S-R conflicts
b) The LR(1) parser for G has S-R conflicts
c) The LR(0) parser for G has S-R conflicts
d) The LALR(1) parser for G has reduce-reduce conflicts
View Answer

9. Which of the following statements are TRUE?
I There exist parsing algorithms for some programming languages hose complex are less than θ(n 3)
II A programming language which allows recursion can be implemented with static storage allocation
III No L-attributed definition can be evaluated in the framework of bottom-up parsing
IV Code improving transformations can be performed at both source language and intermediate code level
a) I and II
b) I and IV
c) III and IV
d) I, III and IV
View Answer

10. What data structure in a complier is used for managing information about variables and their attributes?
a) Abstract syntax tree
b) Symbol table
c) Semantic stack
d) Parse table
View Answer

Sanfoundry Global Education & Learning Series – Compilers.

To practice all areas of Compilers for Entrance exams, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]