CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Front end of two pass compiler takes________ as input.

None

Source code

Intermediate representation

Machine code

2 / 50

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

TRUE

FALSE

3 / 50

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

Registers

Memory

Secondary storage

Hard disk

4 / 50

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

TRUE

FALSE

5 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction selection

None of given

Instruction scheduling

6 / 50

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

Bindings

Declarations

Static information

None

7 / 50

LR parsers can handle _______ grammars.

End-recursive

Left-recursive

Start-recursive

file-recursive

8 / 50

_______ algorithm is used in DFA minimization.

Robert’s

Hopcroft’s

None of given

James’s

9 / 50

For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.

TRUE

FALSE

10 / 50

Parser takes tokens from scanner and tries to generate______ .

Syntax trace

Parse tree

None of the given

Binary Search tree

11 / 50

______ phase which supports macro substitution and conditional compilation.

Semantic

Preprocessing

None

Syntax

12 / 50

Which of the statement is true about Regular Languages?

Regular Languages are easy to understand.

Regular Languages are the most popular for specifying tokens.

Regular Languages are based on simple and useful theory.

All of the given

13 / 50

An important component of semantic analysis is _________ .

type checking

flush checking

code checking

None of the given

14 / 50

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

Decent

Ascent

Forward

Backward

15 / 50

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

FALSE

TRUE

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

17 / 50

Consider the following grammar,

h, g, i

None of the given

18 / 50

LR parsers can handle _______ grammars.

file-recursive

Left-recursive

Start-recursive

End-recursive

19 / 50

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

FALSE

TRUE

20 / 50

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

output

input

input and output

none

21 / 50

We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.

None of the given

Epsilon

22 / 50

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

None of given

Both Parsing and Syntax analysis

Syntax analysis

Parsing

23 / 50

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

24 / 50

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

None of the given

Left-to-right scan of input

left-most derivation

All of the given

25 / 50

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

Link list

Stack

Array

None

26 / 50

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

TRUE

FALSE

27 / 50

Responsibility of _____ is to produce fast and compact code.

None of given

Instruction scheduling

Instruction selection

28 / 50

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

TRUE

FALSE

29 / 50

Lexical Analyzer generator _______ is written in Java.

None of given

Jlex

Complex

Flex

30 / 50

____is evaluated to yield a value.

Declaration and Command

Command

Declaration

Expression

31 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

None of given

Jlex

Complex

32 / 50

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

Registers

Hard disk

Memory

Secondary storage

33 / 50

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

Different

Onto

Same

34 / 50

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

TRUE

FALSE

35 / 50

An important component of semantic analysis is _________ .

type checking

flush checking

code checking

None of the given

36 / 50

An ----- does not need to examine the entire stack for a handle, the state symbol on the top of the stack contains all the information it needs

RL parser

BU parser

LR parser

None of the given

37 / 50

A _______ is a top down parser.

None of the given

Predictive Parsing

Reactive parser

Proactive parser

38 / 50

Lexical Analyzer generator _______ is written in Java.

None of the given

Jlex

Flex

Complex

39 / 50

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

Applying left factoring

None of the given

Removing left recurrence

Removing left recurrence and Applying left factoring

40 / 50

In PASCAL ___________ represent the inequality test.

41 / 50

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

None

Array

Link list

Stack

42 / 50

In predictive parsing table the rows are ___________ .

Both non-terminal and terminals

Terminals

Non-terminals

None of the given

43 / 50

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

FALSE

TRUE

44 / 50

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

None of the given

Removing left recurrence

Applying left factoring

Removing left recurrence and Applying left factoring

45 / 50

First of C is ______ .

g, I

g, h, I, $

46 / 50

Follow of B is ____ .

g, h, i, $

g, i

47 / 50

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

TRUE

FALSE

48 / 50

Bottom-up parsers handle a ________ class of grammars.

Large

small

none of the given

medium

49 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

50 / 50

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

Ascent

Decent

Backward

Forward

Your score is

The average score is 0%