CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

A _______ is a top down parser.

None of the given

Predictive Parsing

Proactive parser

Reactive parser

2 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

3 / 50

Front end of two pass compiler takes________ as input.

Machine Code

None of the Given

Source code

Intermediate Representation (IR)

4 / 50

_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.

Backend

Frontend

Start

5 / 50

Optimal registers allocation is an NP-hard problem.

FALSE

TRUE

6 / 50

In multi pass compiler during the first pass it gathers information about __________ .

None of the given

Declaration

Bindings

Static information

7 / 50

In Three-pass compiler ____ is used for code improvement or optimization.

Back End

Middle End

Front End

Both Front end and Back end

8 / 50

The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.

9 / 50

Compilers are sometimes classified as.

Single pass

Load and go

All of the given

Multi pass

10 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

11 / 50

In Back End module of compiler, optimal register allocation uses______ .

O(log n)

None of the given

O(n log n)

N P-Complete

12 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

Jlex

None of the given

Complex

13 / 50

___________ phase which supports macro substitution and conditional compilation.

Syntax

None

Semantic

Preprocessing

14 / 50

LL(1) parsing is called non-predictive parsing.

FALSE

TRUE

15 / 50

In LL1() parsing algorithm _________ contains a sequence of grammar symbols.

Array

Link list

Stack

None

16 / 50

When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.

Sentence

Token

Character

Grammar

17 / 50

Compilers are sometimes classified as.

Multi pass

Single pass

Load and go

All of the given

18 / 50

____________avoid hardware stalls and interlocks.

None of given

Instruction scheduling

Instruction selection

19 / 50

In a transition table cells of the table contain the ________ state.

Next state

Reject state

Previous state

None of the given

20 / 50

Consider the grammar

g, i

g, h, i, $

21 / 50

Recursive ____________ parsing is done for LL(1) grammar.

Decent

Forward

Ascent

Backward

22 / 50

In LL1() parsing algorithm _________ contains a sequence of grammar symbols.

Link list

None

Stack

Array

23 / 50

Front end of two pass compiler takes________ as input.

Source code

None of the Given

Intermediate Representation (IR)

Machine Code

24 / 50

In Flex specification file different sections are separated by ________ .

25 / 50

In DFA minimization we construct one ______ for each group of states from the initial DFA.

State

None of given

PDA

NFA

26 / 50

Front-end of a two pass compiler is consists of Scanner.

FALSE

TRUE

27 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

28 / 50

LR parsers can handle _______ grammars.

End-recursive

file-recursive

Start-recursive

Left-recursive

29 / 50

AST summarizes the grammatical structure with the details of derivations.

FALSE

TRUE

30 / 50

Consider the grammar

g, h, $

h, g, $

h, i, $

g, h, i, $

31 / 50

Recursive _____ parsing is done for LL(1) grammar.

Forward

Decent

Backward

Ascent

32 / 50

Which of the statement is true about Regular Languages?

All of the given

Regular Languages are based on simple and useful theory.

Regular Languages are easy to understand.

Regular Languages are the most popular for specifying tokens.

33 / 50

In multi pass compiler during the first pass it gathers information about __________ .

Static information

None

Declarations

Bindings

34 / 50

Alternative of the backtrack in parser is Look ahead symbol in _________ .

Output

Input

None of the given

Input and Output

35 / 50

NFA is easy to implement as compared to DFA.

TRUE

FALSE

36 / 50

Which of the statement is true about Regular Languages?

All of the given

Regular Languages are based on simple and useful theory.

Regular Languages are easy to understand.

Regular Languages are the most popular for specifying tokens.

37 / 50

An important component of semantic analysis is _________ .

flush checking

code checking

type checking

None of the given

38 / 50

Front-end of a two pass compiler is consists of Scanner.

TRUE

FALSE

39 / 50

Responsibility of _____ is to produce fast and compact code.

None of given

Instruction selection

Instruction scheduling

40 / 50

Consider the following grammar,

None of the given

h, g, i

41 / 50

Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.

Non-terminal

Terminal

42 / 50

LR parsers can handle _______ grammars.

End-recursive

Left-recursive

Start-recursive

file-recursive

43 / 50

______ phase which supports macro substitution and conditional compilation.

None

Preprocessing

Semantic

Syntax

44 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

None of given

Flex

Jlex

45 / 50

This grammar contains a reduce-reduce conflict. If a DFA states contains both [X → α •, a] and [Y → β •, a], then on input “a” we don’t know which production to reduce with. This is called a reduce-reduce conflict. Usually due to gross ambiguity in the grammar.

FALSE

TRUE

46 / 50

Follow of B is ____ .

g, i

g, h, i, $

47 / 50

LR parsers can handle _______ grammars.

End-recursive

Start-recursive

Left-recursive

file-recursive

48 / 50

In PASCAL ___________ represent the inequality test.

49 / 50

NFA is easy to implement as compared to DFA.

TRUE

FALSE

50 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

Jlex

Complex

None of given

Your score is

The average score is 0%