CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Consider the grammar

h, g, $

h, i, $

g, h, i, $

g, h, $

2 / 50

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

FALSE

TRUE

3 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

4 / 50

Follow of B is ____ .

g, i

g, h, i, $

5 / 50

Which of the statement is true about Regular Languages?

Regular Languages are based on simple and useful theory.

Regular Languages are the most popular for specifying tokens.

All of the given

Regular Languages are easy to understand.

6 / 50

Which of the statement is true about Regular Languages?

All of the given

Regular Languages are the most popular for specifying tokens.

Regular Languages are easy to understand.

Regular Languages are based on simple and useful theory.

7 / 50

A _______ is a top down parser.

Proactive parser

Predictive Parsing

None of the given

Reactive parser

8 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

9 / 50

One of the core tasks of compiler is to generate fast and compact executable code.

FALSE

TRUE

10 / 50

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

Back end

None of given

Front end

Start

11 / 50

____is evaluated to yield a value.

Expression

Declaration and Command

Declaration

Command

12 / 50

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

Static information

Declarations

None

Bindings

13 / 50

A lexical analyzer generator automatically constructs a _____ that recognizes tokens.

PDA

None of the given

14 / 50

_______ algorithm is used in DFA minimization.

James’s

Hopcroft’s

None of given

Robert’s

15 / 50

Consider the grammar

g, i

g, h, i, $

16 / 50

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

Backward

Ascent

Decent

Forward

17 / 50

Optimal registers allocation is an NP-hard problem.

TRUE

FALSE

18 / 50

First of C is ______ .

g, I

g, h, I, $

19 / 50

_______ algorithm is used in DFA minimization.

James‟s

Hopcroft’s

None of given

Robert‟s

20 / 50

Consider the following grammar,

None of the given

h, g, i

21 / 50

____________avoid hardware stalls and interlocks.

Instruction scheduling

None of given

Instruction selection

22 / 50

One of the core tasks of compiler is to generate fast and compact executable code.

TRUE

FALSE

23 / 50

Parser takes tokens from scanner and tries to generate ______ .

Parse tree

Binary Search tree

None of the given

Syntax trace

24 / 50

Parser takes tokens from scanner and tries to generate ______ .

Binary Search tree

Parse tree

Syntax tree

None of the given

25 / 50

Front end of two pass compiler takes________ as input.

Source code

None of the Given

Intermediate Representation (IR)

Machine Code

26 / 50

Lexical Analyzer generator _______ is written in Java.

None of the given

Jlex

Complex

Flex

27 / 50

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.

{0,1,2,3}

{0,1}

{0}

{0,1,2}

28 / 50

LR parsing _____ a string to the start symbol by inverting productions.

Adds

None of the given

Reduces

Shifts

29 / 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

30 / 50

Left factoring is enough to make a grammar LL(1).

FALSE

TRUE

31 / 50

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

Decent

Ascent

Forward

Backward

32 / 50

Flex is an automated tool that is used to get the minimized DFA (scanner).

TRUE

FALSE

33 / 50

_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.

Assembler

Loader/link-editor

Compiler

Preprocessor

34 / 50

LR parsers can handle _______ grammars.

Start-recursive

End-recursive

Left-recursive

file-recursive

35 / 50

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

Array

Link list

None

Stack

36 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction scheduling

Instruction selection

None of given

37 / 50

An important component of semantic analysis is _________ .

type checking

code checking

flush checking

None of the given

38 / 50

Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.

Shift action

De-allocation of memory

Reduce action

Shift and reduce actions

39 / 50

In predictive parsing table the rows are ___________ .

Both non-terminal and terminals

Non-terminals

Terminals

None of the given

40 / 50

One of the core tasks of compiler is to generate fast and compact executable code.

FALSE

TRUE

41 / 50

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.

{0,1}

{0}

{0,1,2,3}

{0,1,2}

42 / 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.

TRUE

FALSE

43 / 50

In Flex specification file different sections are separated by ________ .

44 / 50

Can a DFA simulate NFA?

Sometimes

Yes

45 / 50

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

O(log n)

O(n log n)

N P-Complete

None of the given

46 / 50

Left factoring of a grammar is done to save the parser from back tracking.

FALSE

TRUE

47 / 50

Yacc contains built-in support for handling ambiguous grammars resulting in _______

conflicts.

Shift-reduce

Shift-second

Shift-Shift

48 / 50

Typical compilation means programs written in high-level languages to low-level ____________.

Both Object Code and byte code

Object code

Byted code

Unicode

49 / 50

____________avoid hardware stalls and interlocks.

Instruction selection

None of given

Instruction scheduling

50 / 50

In parser the two LL stand(s) for ____________ .

Left-to-right scan of input

None of the given

left-most derivation

All of the given

Your score is

The average score is 0%