CS606 Midterm Online Quiz

____________avoid hardware stalls and interlocks.

Consider the following grammar,

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

LR parsers can handle _______ grammars.

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

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

Parser takes tokens from scanner and tries to generate ______ .

Functions of Lexical analyzer are?

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

NFA is easy to implement as compared to DFA.

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

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

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

____________avoid hardware stalls and interlocks.

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

Front end of two pass compiler takes________ as input.

The non-terminal _______ is left recursive.

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

___________ phase which supports macro substitution and conditional compilation.

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

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

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

Functions of Lexical analyzer are?

_______ algorithm is used in DFA minimization.

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.

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

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

An important component of semantic analysis is _________ .

Lexical Analyzer generator _______ is written in Java.

Optimal registers allocation is an NP-hard problem.

Responsibility of _____ is to produce fast and compact code.

In predictive parsing table the rows are ___________ .

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

A _______ is a top down parser.

Left factoring is enough to make LL1 grammar

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

Lexical Analyzer generator _______ is written in Java.

An important component of semantic analysis is _________ .

In predictive parsing table the rows are ___________ .

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

Which of the statement is true about Regular Languages?

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

Front end of two pass compiler takes________ as input.

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

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

____is evaluated to yield a value.

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

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

Can a DFA simulate NFA?

Optimal registers allocation is an NP-hard problem.