CS606 Midterm Online Quiz

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

Bottom-up parsers handle a ________ class of grammars.

Which of the statement is true about Regular Languages?

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

___________ phase which supports macro substitution and conditional compilation.

In PASCAL ___________ represent the inequality test.

Front end of two pass compiler takes________ as input.

Optimal registers allocation is an NP-hard problem.

LR parsers can handle _______ grammars.

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

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

First of C is ______ .

Consider the following grammar,

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

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

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

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

____is evaluated to yield a value.

Left factoring is enough to make LL1 grammar

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

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

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

Front end of two pass compiler takes________ as input.

Lexer and scanner are two different phases of compiler

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

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

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

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.

In Flex specification file different sections are separated by ________ .

Which of the statement is true about Regular Languages?

In compilation process Hierarchical analysis is also called

Parser always gives a tree like structure as output

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

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

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.

Parser always gives a tree like structure as output

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

Front end of two pass compiler takes________ as input.

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

Lexical Analyzer generator _______ is written in Java.

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.

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

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.

NFA is easy to implement as compared to DFA.

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 predictive parsing table the rows are ___________ .

Left factoring is enough to make LL1 grammar

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

AST summarizes the grammatical structure with the details of derivations.

Compilers are sometimes classified as.