CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Functions of Lexical analyzer are?

Removing white space

Removing constants, identifiers and keywords

All of the given

Removing comments

2 / 50

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

Decent

Backward

Ascent

Forward

3 / 50

In compilation process Hierarchical analysis is also called-----------

Both Parsing and Syntax analysis

Syntax analysis

Parsing

None of given

4 / 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,2}

{0}

{0,1}

5 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction scheduling

Instruction selection

None of given

6 / 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 and reduce actions

Reduce action

Shift action

De-allocation of memory

7 / 50

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

Forward

Ascent

Decent

8 / 50

Parser takes tokens from scanner and tries to generate ______ .

Parse tree

Binary Search tree

None of the given

Syntax tree

9 / 50

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

10 / 50

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

{0,1,2}

{0}

{0,1,2,3}

{0,1}

11 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

12 / 50

Which of the statement is true about Regular Languages?

Regular Languages are easy to understand.

Regular Languages are based on simple and useful theory.

All of the given

Regular Languages are the most popular for specifying tokens.

13 / 50

LR parsers can handle _______ grammars.

End-recursive

Left-recursive

file-recursive

Start-recursive

14 / 50

Optimal registers allocation is an NP-hard problem.

FALSE

TRUE

15 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

None of given

Complex

Jlex

16 / 50

Compilers are sometimes classified as.

All of the given

Load and go

Single pass

Multi pass

17 / 50

______ phase which supports macro substitution and conditional compilation.

Syntax

Semantic

Preprocessing

None

18 / 50

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

Middle End

Front End

Back End

Both Front end and Back end

19 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

20 / 50

_______ algorithm is used in DFA minimization.

Hopcroft’s

Robert‟s

James‟s

None of given

21 / 50

Front end of two pass compiler takes________ as input.

None of the Given

Machine Code

Source code

Intermediate Representation (IR)

22 / 50

____is evaluated to yield a value.

Declaration

Declaration and Command

Command

Expression

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

24 / 50

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

Memory

Registers

Hard disk

Secondary storage

25 / 50

An important component of semantic analysis is _________ .

type checking

None of the given

flush checking

code checking

26 / 50

Parser always gives a tree like structure as output

FALSE

TRUE

27 / 50

LR parsers can handle _______ grammars.

Left-recursive

file-recursive

End-recursive

Start-recursive

28 / 50

45.Follow of C is ____ .

h, i, $

g, h, $

h, g, $

g, h, i, $

29 / 50

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

None of the given

PDA

30 / 50

In predictive parsing table the rows are ___________ .

Non-terminals

Terminals

None of the given

Both non-terminal and terminals

31 / 50

First of C is ______ .

g, I

g, h, I, $

32 / 50

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

None of given

Start

Back end

Front end

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

34 / 50

Parser takes tokens from scanner and tries to generate ______ .

Parse tree

None of the given

Binary Search tree

Syntax trace

35 / 50

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

Onto

Same

Different

36 / 50

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

FALSE

TRUE

37 / 50

Consider the grammar

g, h, i, $

h, g, $

h, i, $

g, h, $

38 / 50

A _______ is a top down parser.

Proactive parser

Predictive Parsing

None of the given

Reactive parser

39 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

40 / 50

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

Unicode

Byted code

Object code

Both Object Code and byte code

41 / 50

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

Left-to-right scan of input

All of the given

left-most derivation

None of the given

42 / 50

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

FALSE

TRUE

43 / 50

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

conflicts.

Shift-Shift

Shift-reduce

Shift-second

44 / 50

We can get an LL(1) grammar by _______ .

Applying left factoring

None of the given

Removing left recurrence and Applying left factoring

Removing left recurrence

45 / 50

AST summarizes the grammatical structure with the details of derivations.

FALSE

TRUE

46 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

Jlex

None of given

Complex

47 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction scheduling

None of given

Instruction selection

48 / 50

In Flex specification file different sections are separated by ________ .

49 / 50

_______ algorithm is used in DFA minimization.

James’s

Robert’s

None of given

Hopcroft’s

50 / 50

Front end of two pass compiler takes________ as input.

Intermediate representation

Source code

Machine code

None

Your score is

The average score is 0%