CS606-Midterm
1 / 50
Left factoring is enough to make LL1 grammar
2 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
3 / 50
______ phase which supports macro substitution and conditional compilation.
4 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
5 / 50
Consider the grammar
6 / 50
The non-terminal _______ is left recursive.
7 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
8 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
9 / 50
AST summarizes the grammatical structure with the details of derivations.
10 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
11 / 50
Parser takes tokens from scanner and tries to generate______ .
12 / 50
In multi pass compiler during the first pass it gathers information about __________ .
13 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
14 / 50
Left factoring of a grammar is done to save the parser from back tracking.
15 / 50
16 / 50
In compilation process Hierarchical analysis is also called
17 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
18 / 50
LR parsers can handle _______ grammars.
19 / 50
Lexical Analyzer generator _______ is written in Java.
20 / 50
An important component of semantic analysis is _________ .
21 / 50
In predictive parsing table the rows are ___________ .
22 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
23 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
24 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
25 / 50
In Flex specification file different sections are separated by ________ .
26 / 50
Which of the statement is true about Regular Languages?
27 / 50
28 / 50
Lexer and scanner are two different phases of compiler
29 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
30 / 50
Responsibility of _____ is to produce fast and compact code.
31 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
32 / 50
33 / 50
We can get an LL(1) grammar by _______ .
34 / 50
Optimal registers allocation is an NP-hard problem.
35 / 50
LR parsing _____ a string to the start symbol by inverting productions.
36 / 50
37 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
38 / 50
Front end of two pass compiler takes________ as input.
39 / 50
40 / 50
41 / 50
42 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
43 / 50
NFA is easy to implement as compared to DFA.
44 / 50
In compilation process Hierarchical analysis is also called-----------
45 / 50
45.Follow of C is ____ .
46 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
47 / 50
Compilers are sometimes classified as.
48 / 50
Parser takes tokens from scanner and tries to generate ______ .
49 / 50
50 / 50
____________avoid hardware stalls and interlocks.
Your score is
The average score is 0%
Restart quiz
