CS606 Midterm Online Quiz

Optimal registers allocation is an NP-hard problem.

LR parsers can handle _______ grammars.

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

Compilers are sometimes classified as.

In compilation process Hierarchical analysis is also called

Which of the statement is true about Regular Languages?

Lexical Analyzer generator _______ is written in Java.

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

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

Which of the statement is true about Regular Languages?

AST summarizes the grammatical structure with the details of derivations.

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

Parser takes tokens from scanner and tries to generate ______ .

Consider the following grammar,

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

Front end of two pass compiler takes________ as input.

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

Lexer and scanner are two different phases of compiler

The non-terminal _______ is left recursive.

Front end of two pass compiler takes________ as input.

Parser takes tokens from scanner and tries to generate______ .

____________avoid hardware stalls and interlocks.

An important component of semantic analysis is _________ .

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

In PASCAL ___________ represent the inequality test.

A _______ is a top down parser.

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

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

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.

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

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

Parser always gives a tree like structure as output

Functions of Lexical analyzer are?

In predictive parsing table the rows are ___________ .

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

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

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

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

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

Parser always gives a tree like structure as output

Lexer and scanner are two different phases of compiler

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

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

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

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.

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

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.

____________avoid hardware stalls and interlocks.