CS606 Midterm Online Quiz

Can a DFA simulate NFA?

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

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

In predictive parsing table the rows are ___________ .

NFA is easy to implement as compared to DFA.

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

___________ phase which supports macro substitution and conditional compilation.

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.

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

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

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

First of C is ______ .

Which of the statement is true about Regular Languages?

Follow of B is ____ .

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

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

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

LR parsers can handle _______ grammars.

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

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

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.

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.

Lexical Analyzer generator _______ is written in Java.

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

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

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

Functions of Lexical analyzer are?

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

Left factoring is enough to make LL1 grammar

Front end of two pass compiler takes________ as input.

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.

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

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

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

Consider the grammar

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

Lexical Analyzer generator _______ is written in Java.

Parser takes tokens from scanner and tries to generate ______ .

____________avoid hardware stalls and interlocks.

Lexer and scanner are two different phases of compiler

Compilers are sometimes classified as.

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

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

AST summarizes the grammatical structure with the details of derivations.

An important component of semantic analysis is _________ .

Consider the grammar

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

NFA is easy to implement as compared to DFA.