CS606 Midterm Online Quiz

Parser always gives a tree like structure as output

Consider the grammar

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

Functions of Lexical analyzer are?

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

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

Lexical Analyzer generator _______ is written in Java.

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

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

Responsibility of _____ is to produce fast and compact code.

Functions of Lexical analyzer are?

First of C is ______ .

Can a DFA simulate NFA?

LR parsers can handle _______ grammars.

NFA is easy to implement as compared to DFA.

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

An important component of semantic analysis is _________ .

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

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

Optimal registers allocation is an NP-hard problem.

Optimal registers allocation is an NP-hard problem.

Parser always gives a tree like structure as output

Lexical Analyzer generator _______ is written in Java.

In PASCAL ___________ represent the inequality test.

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 parsing _____ a string to the start symbol by inverting productions.

Compilers are sometimes classified as.

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

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

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

____is evaluated to yield a value.

AST summarizes the grammatical structure with the details of derivations.

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

Bottom-up parsers handle a ________ class of grammars.

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

_______ algorithm is used in DFA minimization.

A _______ is a top down parser.

___________ phase which supports macro substitution and conditional compilation.

Parser takes tokens from scanner and tries to generate______ .

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

____________avoid hardware stalls and interlocks.

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

NFA is easy to implement as compared to DFA.

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

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

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

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

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

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

LR parsers can handle _______ grammars.