CS606 Midterm Online Quiz

NFA is easy to implement as compared to DFA.

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

Lexer and scanner are two different phases of compiler

______ phase which supports macro substitution and conditional compilation.

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

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

An important component of semantic analysis is _________ .

The non-terminal _______ is left recursive.

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

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

AST summarizes the grammatical structure with the details of derivations.

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

NFA is easy to implement as compared to DFA.

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

Parser takes tokens from scanner and tries to generate______ .

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 predictive parsing table the rows are ___________ .

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

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

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

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

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

LR parsers can handle _______ grammars.

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

AST summarizes the grammatical structure with the details of derivations.

LR parsers can handle _______ grammars.

Compilers are sometimes classified as.

Can a DFA simulate NFA?

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.

Bottom-up parsers handle a ________ class of grammars.

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

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

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

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

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

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

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.

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

Optimal registers allocation is an NP-hard problem.

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

In Flex specification file different sections are separated by ________ .

____________avoid hardware stalls and interlocks.

Lexical Analyzer generator _______ is written in Java.

Which of the statement is true about Regular Languages?

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

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

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

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

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

An important component of semantic analysis is _________ .