CS606 Midterm Online Quiz

The non-terminal _______ is left recursive.

Front end of two pass compiler takes________ as input.

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

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

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

AST summarizes the grammatical structure with the details of derivations.

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

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

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

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

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

First of C is ______ .

A _______ is a top down parser.

In PASCAL ___________ represent the inequality test.

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

Front end of two pass compiler takes________ as input.

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

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

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

In predictive parsing table the rows are ___________ .

An important component of semantic analysis is _________ .

Consider the following grammar,

Functions of Lexical analyzer are?

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

___________ phase which supports macro substitution and conditional compilation.

Left factoring is enough to make LL1 grammar

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 parsers can handle _______ grammars.

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.

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

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

______ phase which supports macro substitution and conditional compilation.

_______ algorithm is used in DFA minimization.

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

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

Ambiguity can easily be handled by Top-down Parser Select correct option:

Parser takes tokens from scanner and tries to generate______ .

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

Lexical Analyzer generator _______ is written in Java.

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

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

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

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

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

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

In predictive parsing table the rows are ___________ .

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

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

Left factoring is enough to make LL1 grammar

NFA is easy to implement as compared to DFA.