CS606 Midterm Online Quiz

0%

CS606-Midterm

1 / 50

45.Follow of C is ____ .

2 / 50

In multi pass compiler during the first pass it gathers information about __________ .

3 / 50

Optimal registers allocation is an NP-hard problem.

4 / 50

In multi pass compiler during the first pass it gathers information about __________ .

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

_______ algorithm is used in DFA minimization.

9 / 50

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

10 / 50

Can a DFA simulate NFA?

11 / 50

Front end of two pass compiler takes________ as input.

12 / 50

In Flex specification file different sections are separated by ________ .

13 / 50

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

14 / 50

Lexical Analyzer generator _______ is written in Java.

15 / 50

Compilers are sometimes classified as.

16 / 50

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

17 / 50

LR parsers can handle _______ grammars.

18 / 50

Left factoring is enough to make LL1 grammar

19 / 50

Left factoring is enough to make LL1 grammar

20 / 50

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

21 / 50

First of C is ______ .

22 / 50

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

23 / 50

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

24 / 50

NFA is easy to implement as compared to DFA.

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

The non-terminal _______ is left recursive.

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

___________ phase which supports macro substitution and conditional compilation.

34 / 50

Front end of two pass compiler takes________ as input.

35 / 50

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

36 / 50

Which of the statement is true about Regular Languages?

37 / 50

An important component of semantic analysis is _________ .

38 / 50

______ phase which supports macro substitution and conditional compilation.

39 / 50

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

40 / 50

In predictive parsing table the rows are ___________ .

41 / 50

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

42 / 50

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

43 / 50

NFA is easy to implement as compared to DFA.

44 / 50

Front end of two pass compiler takes________ as input.

45 / 50

Follow of B is ____ .

46 / 50

Parser takes tokens from scanner and tries to generate ______ .

47 / 50

Functions of Lexical analyzer are?

48 / 50

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

49 / 50

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

50 / 50

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

Your score is

The average score is 0%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi