CS606 Midterm Online Quiz

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

_______ algorithm is used in DFA minimization.

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

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

Lexical Analyzer generator _______ is written in Java.

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

In compilation process Hierarchical analysis is also called

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

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

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

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

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

Bottom-up parsers handle a ________ class of grammars.

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.

An important component of semantic analysis is _________ .

Front end of two pass compiler takes________ as input.

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

Left factoring is enough to make LL1 grammar

___________ phase which supports macro substitution and conditional compilation.

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

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

A _______ is a top down parser.

Front end of two pass compiler takes________ as input.

The non-terminal _______ is left recursive.

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

Which of the statement is true about Regular Languages?

Optimal registers allocation is an NP-hard problem.

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

Functions of Lexical analyzer are?

Can a DFA simulate NFA?

The regular expressions a*|b* and (a|b)* describe the _____set of strings.

Left factoring is enough to make LL1 grammar

Consider the grammar

LR parsers can handle _______ grammars.

Parser takes tokens from scanner and tries to generate ______ .

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

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

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

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

First of C is ______ .

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

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

AST summarizes the grammatical structure with the details of derivations.

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.

Which of the statement is true about Regular Languages?

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

______ phase which supports macro substitution and conditional compilation.