Aptitude Reasoning English GK Computer Knowledge Programming Skill Banking Software Testing



Question - 1

________ is considered as a sequence of characters in a token.

  • Texeme
  • Pattern
  • Lexeme
  • Mexeme
Solutions
Question - 2

What is the name of the process that determining whether a string of tokens can be generated by a grammar?

  • Analysing
  • Recognizing
  • Translating
  • Parsing
Solutions
Question - 3

Which of the following cannot be used as an intermediate code form?

  • Quadruples
  • Syntax trees
  • Three address codes
  • Post fix notation
Solutions
Question - 4

Which of the following is the fastest logic?

  • TTL
  • ECL
  • CMOS
  • LSI
Solutions
Question - 5

Which of the following can be used to identify loops?

  • Dominators
  • Reducible graphs
  • Depth first ordering
  • All of these
Solutions
Question - 6

A latch is constructed using which two cross coupled?

  • AND OR gates
  • AND gates
  • NAND and NOR gates
  • NAND gates
Solutions
Question - 7

The cost of developing a compiler is proportional to

  • Flexibility of the available instruction set
  • Complexity of the architecture of the target machine
  • Complexity of the source language
  • All of these
Solutions
Question - 8

 An intermediate code form is __________

  • Postfix notation
  • Syntax Trees
  • Three Address code
  • All of the mentioned
Solutions
Question - 9

Replacement of an expensive operation by a cheaper one is called

  • Reduction in strength
  • Loop-invariant computation
  • Code motion
  • None of these
Solutions
Question - 10

Which of the following is not a source of error?

  • Faulty design specification
  • Faulty algorithm
  • Compilers themselves
  • None of these
Solutions
Question - 11

Which grammar is not regular?

  • 0^n
  • 0^n 1^n n
  • 0^m 0^n n
  • 0^n 0^n n
Solutions
Question - 12

Semantic errors can be detected at

  • Compile time only
  • Run-time only
  • Both (a) and (b)
  • None of these
Solutions
Question - 13

CFG (Context Free Grammar) can be recognized by a

  • Push down automata
  • Finite state automata
  • 2 way linear bounded automata
  • Both A & C
Solutions
Question - 14

Handle pruning is the technique used to obtain

  • Canonical reduction sequence
  • Canonical derivation sequence
  • Both A & B
  • None of these
Solutions
Question - 15

Interpreter is preferred over a compiler is

  • During program development phase
  • When storage space is to be minimized
  • When efficient use of computer resources is the consideration
  • All of these
Solutions
Question - 16

A parser with the valid prefix property is advantageous because it __________

  • Detects errors
  • None of the mentioned
  • Errors are passed to the text phase
  • All of the mentioned
Solutions
Question - 17

Type checking is normally done during

  • Code optimization
  • Syntax directed translation
  • Lexical analysis
  • Syntax analysis
Solutions
Question - 18

Back- patching is useful for handling

  • Forward references
  • Backward references
  • Conditional jumps
  • Unconditional jumps
Solutions
Question - 19

A top down parser generates __________

  • Rightmost Derivation
  • Right most derivation in reverse
  • Left most derivation
  • Left most derivation in reverse
Solutions
Question - 20

Recursive descent parsing belongs to the class of

  • Top-down parsing
  • Bottom-up parsing
  • Predictive parsing
  • None of these
Solutions
Tags:
Compiler Design MCQs,Quiz on Compiler Design ,Compiler Designtest,Compiler Design MCQs and Answers,Multiple choice questions on Compiler Design PDF,Compiler Design test,Compiler Design quiz