Intermediate Code-Generation MCQ

Test your knowledge with important Intermediate Code-Generation MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Intermediate Code-Generation MCQs at Bissoy

• What data structure in a complier is used for managing information about variables and their attributes?
  ক

  Abstract syntax tree

  খ

  Symbol table

  গ

  Semantic stack

  ঘ

  Parse table
• 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
  ক

  I and II

  খ

  I and IV

  গ

  III and IV

  ঘ

  I, III and IV
• An LALR(1) parser for a grammar can have shift-reduce (S-R) conflicts if and only if ___________
  ক

  The SLR(1) parser for G has S-R conflicts

  খ

  The LR(1) parser for G has S-R conflicts

  গ

  The LR(0) parser for G has S-R conflicts

  ঘ

  The LALR(1) parser for G has reduce-reduce conflicts
• 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.
  ক

  (ii) and (v) only

  খ

  (i), (iii) and (iv) only

  গ

  (i), (ii) and (v)

  ঘ

  (ii), (iii) and (v) only
• Some code optimizations are carried out on the intermediate code because _______________
  ক

  They enhance the portability of the complier to other target processors

  খ

  Program analysis is name accurate on intermediate code than on machine code

  গ

  The information from data flow analysis cannot otherwise be used for optimization

  ঘ

  The information from the front end cannot otherwise be used for optimization
• 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?
  ক

  Both P and Q are true

  খ

  P is true and Q is false

  গ

  P is false and Q is true

  ঘ

  Both P and Q are false
• In the correct grammar above, what is the length of the derivation (number of steps starting from S to generate the string a l b m with l ! m?
  ক

  max (l, m) + 2

  খ

  l+m+2

  গ

  l + m + 3

  ঘ

  max (l, m) + 3