CS606 Midterm Online Quiz

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

A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.

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

The non-terminal _______ is left recursive.

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

Front end of two pass compiler takes________ as input.

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

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

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

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

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

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

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.

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

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

Bottom-up parsers handle a ________ class of grammars.

Front end of two pass compiler takes________ as input.

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 DFA minimization we construct one ______ for each group of states from the initial DFA.

Functions of Lexical analyzer are?

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

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

LR parsers can handle _______ grammars.

____________avoid hardware stalls and interlocks.

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

In predictive parsing table the rows are ___________ .

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

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

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.

Consider the grammar

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

Optimal registers allocation is an NP-hard problem.

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

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 __________ .

______ phase which supports macro substitution and conditional compilation.

Parser always gives a tree like structure as output

Parser takes tokens from scanner and tries to generate______ .

A _______ is a top down parser.

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

_______ algorithm is used in DFA minimization.

First of C is ______ .

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

Parser takes tokens from scanner and tries to generate ______ .

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