CS606 Midterm Online Quiz

Left factoring is enough to make LL1 grammar

Optimal registers allocation is an NP-hard problem.

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

The non-terminal _______ is left recursive.

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

_______ algorithm is used in DFA minimization.

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

Front end of two pass compiler takes________ as input.

An important component of semantic analysis is _________ .

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

Compilers are sometimes classified as.

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

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.

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

____________avoid hardware stalls and interlocks.

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

Parser takes tokens from scanner and tries to generate ______ .

Lexical Analyzer generator _______ is written in Java.

Responsibility of _____ is to produce fast and compact code.

NFA is easy to implement as compared to DFA.

LR parsers can handle _______ grammars.

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

In compilation process Hierarchical analysis is also called

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

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

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

In Flex specification file different sections are separated by ________ .

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

Parser always gives a tree like structure as output

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

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

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.

____is evaluated to yield a value.

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

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

Lexer and scanner are two different phases of compiler

Front end of two pass compiler takes________ as input.

45.Follow of C is ____ .

Follow of B is ____ .

Responsibility of _____ is to produce fast and compact code.

AST summarizes the grammatical structure with the details of derivations.

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

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

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

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.