CS606 Midterm Online Quiz

Lexer and scanner are two different phases of compiler

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

AST summarizes the grammatical structure with the details of derivations.

45.Follow of C is ____ .

Lexical Analyzer generator _______ is written in Java.

LR parsers can handle _______ grammars.

Left factoring is enough to make LL1 grammar

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 a transition table cells of the table contain the ________ state.

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

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 parser the two LL stand(s) for ____________ .

Consider the grammar

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

First of C is ______ .

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

Bottom-up parsers handle a ________ class of grammars.

Consider the grammar

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

____is evaluated to yield a value.

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

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

Optimal registers allocation is an NP-hard problem.

In predictive parsing table the rows are ___________ .

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.

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

In Flex specification file different sections are separated by ________ .

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

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

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

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

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

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.

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

The non-terminal _______ is left recursive.

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

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

In predictive parsing table the rows are ___________ .

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

_______ algorithm is used in DFA minimization.

LR parsers can handle _______ grammars.

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

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

Parser always gives a tree like structure as output

Front end of two pass compiler takes________ as input.

NFA is easy to implement as compared to DFA.

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

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

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