CS606 Midterm Online Quiz

A _______ is a top down parser.

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

Responsibility of _____ is to produce fast and compact code.

Compilers are sometimes classified as.

An important component of semantic analysis is _________ .

Lexical Analyzer generator _______ is written in Java.

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

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

Front end of two pass compiler takes________ as input.

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.

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.

Lexical Analyzer generator _______ is written in Java.

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

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

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

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

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

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

Parser takes tokens from scanner and tries to generate______ .

AST summarizes the grammatical structure with the details of derivations.

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.

Parser always gives a tree like structure as output

Front end of two pass compiler takes________ as input.

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

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

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

____________avoid hardware stalls and interlocks.

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.

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

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

Compilers are sometimes classified as.

Parser takes tokens from scanner and tries to generate ______ .

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

____is evaluated to yield a value.

Left factoring is enough to make LL1 grammar

Functions of Lexical analyzer are?

______ phase which supports macro substitution and conditional compilation.

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

LR parsers can handle _______ grammars.

Left factoring is enough to make LL1 grammar

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

Which of the statement is true about Regular Languages?

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

Can a DFA simulate NFA?

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

Responsibility of _____ is to produce fast and compact code.

First of C is ______ .