CS606 Midterm Online Quiz

Compilers are sometimes classified as.

Parser always gives a tree like structure as output

Follow of B is ____ .

Which of the statement is true about Regular Languages?

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

Which of the statement is true about Regular Languages?

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

LR parsers can handle _______ grammars.

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

Front end of two pass compiler takes________ as input.

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

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

NFA is easy to implement as compared to DFA.

In predictive parsing table the rows are ___________ .

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.

Lexical Analyzer generator _______ is written in Java.

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

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

NFA is easy to implement as compared to DFA.

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

Parser takes tokens from scanner and tries to generate ______ .

Left factoring is enough to make LL1 grammar

First of C is ______ .

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

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

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

45.Follow of C is ____ .

Functions of Lexical analyzer are?

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

_______ algorithm is used in DFA minimization.

In Flex specification file different sections are separated by ________ .

In PASCAL ___________ represent the inequality test.

A _______ is a top down parser.

Front end of two pass compiler takes________ as input.

Functions of Lexical analyzer are?

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