CS606 Midterm Online Quiz

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

Parser takes tokens from scanner and tries to generate ______ .

Front end of two pass compiler takes________ as input.

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

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

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

Lexer and scanner are two different phases of compiler

Left factoring is enough to make LL1 grammar

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

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

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

Lexical Analyzer generator _______ is written in Java.

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

In PASCAL ___________ represent the inequality test.

Lexical Analyzer generator _______ is written in Java.

45.Follow of C is ____ .

NFA is easy to implement as compared to DFA.

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

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.

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

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

In predictive parsing table the rows are ___________ .

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

In predictive parsing table the rows are ___________ .

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

Parser takes tokens from scanner and tries to generate______ .

______ phase which supports macro substitution and conditional compilation.

Optimal registers allocation is an NP-hard problem.

Follow of B is ____ .

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

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

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

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

Optimal registers allocation is an NP-hard problem.

Consider the grammar

___________ phase which supports macro substitution and conditional compilation.

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

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

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

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

AST summarizes the grammatical structure with the details of derivations.

Functions of Lexical analyzer are?

First of C is ______ .

Lexer and scanner are two different phases of compiler

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

Responsibility of _____ is to produce fast and compact code.

A lexical analyzer generator automatically constructs a _____ that recognizes tokens.

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

____is evaluated to yield a value.