CS606 Midterm Online Quiz

In predictive parsing table the rows are ___________ .

Responsibility of _____ is to produce fast and compact code.

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

LR parsers can handle _______ grammars.

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

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.

A _______ is a top down parser.

The non-terminal _______ is left recursive.

45.Follow of C is ____ .

Functions of Lexical analyzer are?

An important component of semantic analysis is _________ .

Follow of B is ____ .

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

Functions of Lexical analyzer are?

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

____is evaluated to yield a value.

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

Consider the following grammar,

In PASCAL ___________ represent the inequality test.

Which of the statement is true about Regular Languages?

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

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

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

____________avoid hardware stalls and interlocks.

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

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

Parser takes tokens from scanner and tries to generate ______ .

_______ algorithm is used in DFA minimization.

Parser always gives a tree like structure as output

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

First of C is ______ .

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

Compilers are sometimes classified as.

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

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

Responsibility of _____ is to produce fast and compact code.

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

Lexer and scanner are two different phases of compiler

Parser takes tokens from scanner and tries to generate______ .

Which of the statement is true about Regular Languages?

Left factoring is enough to make LL1 grammar

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.

Parser always gives a tree like structure as output

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

Optimal registers allocation is an NP-hard problem.

NFA is easy to implement as compared to DFA.