CS606 Midterm Online Quiz

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

The non-terminal _______ is left recursive.

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

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

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

Lexer and scanner are two different phases of compiler

Optimal registers allocation is an NP-hard problem.

Compilers are sometimes classified as.

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

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

Functions of Lexical analyzer are?

First of C is ______ .

Compilers are sometimes classified as.

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.

An important component of semantic analysis is _________ .

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

Bottom-up parsers handle a ________ class of grammars.

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

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

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

In parser the two LL stand(s) for ____________ .

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

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.

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

Parser always gives a tree like structure as output

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

A _______ is a top down parser.

____is evaluated to yield a value.

In Flex specification file different sections are separated by ________ .

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

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

Consider the grammar

In predictive parsing table the rows are ___________ .

Parser takes tokens from scanner and tries to generate______ .

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.

Functions of Lexical analyzer are?

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

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

Which of the statement is true about Regular Languages?

Parser takes tokens from scanner and tries to generate ______ .

LR parsers can handle _______ grammars.

____________avoid hardware stalls and interlocks.

LR parsers can handle _______ grammars.

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

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

NFA is easy to implement as compared to DFA.

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

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

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

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.