CS606 Midterm Online Quiz

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

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

Lexical Analyzer generator _______ is written in Java.

In predictive parsing table the rows are ___________ .

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

An important component of semantic analysis is _________ .

In Flex specification file different sections are separated by ________ .

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

Which of the statement is true about Regular Languages?

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

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.

Lexer and scanner are two different phases of compiler

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

Follow of B is ____ .

45.Follow of C is ____ .

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

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.

____is evaluated to yield a value.

Front end of two pass compiler takes________ as input.

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

For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.

The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.

An important component of semantic analysis is _________ .

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

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

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

AST summarizes the grammatical structure with the details of derivations.

Compilers are sometimes classified as.

Responsibility of _____ is to produce fast and compact code.

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

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

Parser takes tokens from scanner and tries to generate ______ .

Optimal registers allocation is an NP-hard problem.

Lexical Analyzer generator _______ is written in Java.

Consider the following grammar,

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

First of C is ______ .

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

In PASCAL ___________ represent the inequality test.

LR parsers can handle _______ grammars.

Functions of Lexical analyzer are?

Parser takes tokens from scanner and tries to generate______ .

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

Compilers are sometimes classified as.

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

_______ algorithm is used in DFA minimization.

______ phase which supports macro substitution and conditional compilation.

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.

Can a DFA simulate NFA?

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