CS606 Midterm Online Quiz

Parser always gives a tree like structure as output

AST summarizes the grammatical structure with the details of derivations.

Lexer and scanner are two different phases of compiler

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

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

Optimal registers allocation is an NP-hard problem.

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

A _______ is a top down parser.

Which of the statement is true about Regular Languages?

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

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

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

Optimal registers allocation is an NP-hard problem.

Parser takes tokens from scanner and tries to generate ______ .

Consider the following grammar,

Can a DFA simulate NFA?

Lexical Analyzer generator _______ is written in Java.

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

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

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

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.

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

______ phase which supports macro substitution and conditional compilation.

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

____is evaluated to yield a value.

Functions of Lexical analyzer are?

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

Front end of two pass compiler takes________ as input.

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

In predictive parsing table the rows are ___________ .

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

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

In Flex specification file different sections are separated by ________ .

Front end of two pass compiler takes________ as input.

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

LR parsers can handle _______ grammars.

In predictive parsing table the rows are ___________ .

_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.

The non-terminal _______ is left recursive.

45.Follow of C is ____ .

Bottom-up parsers handle a ________ class of grammars.

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 compilation process Hierarchical analysis is also called

Responsibility of _____ is to produce fast and compact code.

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

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