CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

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

None

Bindings

Declarations

Static information

2 / 50

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

TRUE

FALSE

3 / 50

____is evaluated to yield a value.

Declaration and Command

Expression

Command

Declaration

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

5 / 50

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

Compiler

Loader/link-editor

Preprocessor

Assembler

6 / 50

Functions of Lexical analyzer are?

Removing white space

All of the given

Removing comments

Removing constants, identifiers and keywords

7 / 50

Functions of Lexical analyzer are?

Removing constants, identifiers and keywords

All of the given

Removing white space

Removing comments

8 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

9 / 50

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

Output

None of the given

Input

Input and Output

10 / 50

An important component of semantic analysis is _________ .

None of the given

flush checking

type checking

code checking

11 / 50

Optimal registers allocation is an NP-hard problem.

TRUE

FALSE

12 / 50

Front end of two pass compiler takes________ as input.

Source code

Machine code

Intermediate representation

None

13 / 50

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

None of the given

Shifts

Adds

Reduces

14 / 50

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

Front End

Both Front end and Back end

Back End

Middle End

15 / 50

_______ algorithm is used in DFA minimization.

James’s

None of given

Robert’s

Hopcroft’s

16 / 50

45.Follow of C is ____ .

g, h, $

h, g, $

g, h, i, $

h, i, $

17 / 50

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

FALSE

TRUE

18 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

19 / 50

Lexical Analyzer generator _______ is written in Java.

Jlex

None of given

Complex

Flex

20 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

None of given

Flex

Jlex

21 / 50

An important component of semantic analysis is _________ .

flush checking

type checking

code checking

None of the given

22 / 50

______ phase which supports macro substitution and conditional compilation.

Semantic

Syntax

Preprocessing

None

23 / 50

AST summarizes the grammatical structure with the details of derivations.

TRUE

FALSE

24 / 50

___________ phase which supports macro substitution and conditional compilation.

Preprocessing

None

Syntax

Semantic

25 / 50

Compilers are sometimes classified as.

All of the given

Multi pass

Single pass

Load and go

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

27 / 50

The regular expressions a*|b* and (a|b)* describe the _____set of strings.

Different

Onto

Same

28 / 50

Front end of two pass compiler takes________ as input.

Machine Code

Intermediate Representation (IR)

Source code

None of the Given

29 / 50

Can a DFA simulate NFA?

Yes

Sometimes

30 / 50

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

conflicts.

Shift-reduce

Shift-second

Shift-Shift

31 / 50

The non-terminal _______ is left recursive.

None of the given

32 / 50

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

33 / 50

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

TRUE

FALSE

34 / 50

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

None

Link list

Array

Stack

35 / 50

____________avoid hardware stalls and interlocks.

Instruction selection

None of given

Instruction scheduling

36 / 50

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

FALSE

TRUE

37 / 50

Intermediate Representation (IR) stores the value of its operand in

Secondary storage

Hard disk

Memory

Registers

38 / 50

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

TRUE

FALSE

39 / 50

Intermediate Representation (IR) stores the value of its operand in ____________ .

Memory

Secondary storage

Registers

Hard disk

40 / 50

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

none of given

41 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

42 / 50

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

Start

Front end

None of given

Back end

43 / 50

____________avoid hardware stalls and interlocks.

Instruction scheduling

None of given

Instruction selection

44 / 50

AST summarizes the grammatical structure with the details of derivations.

FALSE

TRUE

45 / 50

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

Forward

Decent

Ascent

46 / 50

A _______ is a top down parser.

Predictive Parsing

None of the given

Reactive parser

Proactive parser

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

48 / 50

LR parsers can handle _______ grammars.

Left-recursive

End-recursive

file-recursive

Start-recursive

49 / 50

Compilers are sometimes classified as.

All of the given

Single pass

Load and go

Multi pass

50 / 50

Parser takes tokens from scanner and tries to generate ______ .

Binary Search tree

None of the given

Syntax trace

Parse tree

Your score is

The average score is 0%