CS606 Midterm Online Quiz

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

An important component of semantic analysis is _________ .

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

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

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

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

Bottom-up parsers handle a ________ class of grammars.

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

____is evaluated to yield a value.

Compilers are sometimes classified as.

Lexical Analyzer generator _______ is written in Java.

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

Functions of Lexical analyzer are?

A _______ is a top down parser.

Consider the grammar

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

Left factoring is enough to make LL1 grammar

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

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.

_______ algorithm is used in DFA minimization.

Parser always gives a tree like structure as output

In predictive parsing table the rows are ___________ .

Optimal registers allocation is an NP-hard problem.

Parser takes tokens from scanner and tries to generate ______ .

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

Lexical Analyzer generator _______ is written in Java.

____________avoid hardware stalls and interlocks.

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

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

Front end of two pass compiler takes________ as input.

Lexical Analyzer generator _______ is written in Java.

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.

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

NFA is easy to implement as compared to DFA.

Left factoring is enough to make LL1 grammar

In compilation process Hierarchical analysis is also called

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

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

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

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

In PASCAL ___________ represent the inequality test.

Front end of two pass compiler takes________ as input.

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.

Which of the statement is true about Regular Languages?

Consider the grammar

_______ 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.

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

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

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