CS606 Midterm Online Quiz

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

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

Consider the grammar

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

In PASCAL ___________ represent the inequality test.

Grammars with LL(1) conflicts can be made LL(1) by applying left-factoring, substitution, and left-recursion removal. Left-factoring takes care of ________conflicts.

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

First of C is ______ .

NFA is easy to implement as compared to DFA.

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

Functions of Lexical analyzer are?

____is evaluated to yield a value.

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

Follow of B is ____ .

Lexical Analyzer generator _______ is written in Java.

Optimal registers allocation is an NP-hard problem.

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

Bottom-up parsers handle a ________ class of grammars.

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

Which of the statement is true about Regular Languages?

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

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

Parser takes tokens from scanner and tries to generate ______ .

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.

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

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

45.Follow of C is ____ .

Compilers are sometimes classified as.

____________avoid hardware stalls and interlocks.

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

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

Can a DFA simulate NFA?

Parser takes tokens from scanner and tries to generate ______ .

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

Consider the following grammar,

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

Lexer and scanner are two different phases of compiler

In Flex specification file different sections are separated by ________ .

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

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

The non-terminal _______ is left recursive.

Which of the statement is true about Regular Languages?

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

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

_______ algorithm is used in DFA minimization.

Responsibility of _____ is to produce fast and compact code.

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

In predictive parsing table the rows are ___________ .

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

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