CS606 Midterm Online Quiz

Functions of Lexical analyzer are?

First of C is ______ .

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

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

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

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

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

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

Consider the grammar

____________avoid hardware stalls and interlocks.

Optimal registers allocation is an NP-hard problem.

In predictive parsing table the rows are ___________ .

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

Front end of two pass compiler takes________ as input.

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

AST summarizes the grammatical structure with the details of derivations.

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

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

An important component of semantic analysis is _________ .

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

Bottom-up parsers handle a ________ class of grammars.

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

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

A _______ is a top down parser.

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

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

Compilers are sometimes classified as.

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

Lexical Analyzer generator _______ is written in Java.

Parser always gives a tree like structure as output

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.

NFA is easy to implement as compared to DFA.

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

In compilation process Hierarchical analysis is also called

Can a DFA simulate NFA?

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.

In predictive parsing table the rows are ___________ .

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

____is evaluated to yield a value.

The non-terminal _______ is left recursive.

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

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

LR parsers can handle _______ grammars.

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

NFA is easy to implement as compared to DFA.

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

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

Parser takes tokens from scanner and tries to generate______ .

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 multi pass compiler during the first pass it gathers information about __________ .