CS606 Midterm Online Quiz

0%

CS606-Midterm

1 / 50

NFA is easy to implement as compared to DFA.

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

____________avoid hardware stalls and interlocks.

6 / 50

_______ algorithm is used in DFA minimization.

7 / 50

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

8 / 50

Parser always gives a tree like structure as output

9 / 50

_______ algorithm is used in DFA minimization.

10 / 50

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

11 / 50

In compilation process Hierarchical analysis is also called

12 / 50

Lexical Analyzer generator _______ is written in Java.

13 / 50

Lexer and scanner are two different phases of compiler

14 / 50

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

15 / 50

AST summarizes the grammatical structure with the details of derivations.

16 / 50

Front end of two pass compiler takes________ as input.

17 / 50

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

18 / 50

Functions of Lexical analyzer are?

19 / 50

In predictive parsing table the rows are ___________ .

20 / 50

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

21 / 50

In PASCAL ___________ represent the inequality test.

22 / 50

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

23 / 50

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

24 / 50

Compilers are sometimes classified as.

25 / 50

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

26 / 50

Compilers are sometimes classified as.

27 / 50

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

28 / 50

Responsibility of _____ is to produce fast and compact code.

29 / 50

Parser takes tokens from scanner and tries to generate ______ .

30 / 50

____________avoid hardware stalls and interlocks.

31 / 50

LR parsers can handle _______ grammars.

32 / 50

In Flex specification file different sections are separated by ________ .

33 / 50

Parser takes tokens from scanner and tries to generate ______ .

34 / 50

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.

35 / 50

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

36 / 50

Functions of Lexical analyzer are?

37 / 50

Lexer and scanner are two different phases of compiler

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

Lexical Analyzer generator _______ is written in Java.

44 / 50

______ phase which supports macro substitution and conditional compilation.

45 / 50

Follow of B is ____ .

46 / 50

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

47 / 50

Consider the grammar

48 / 50

Optimal registers allocation is an NP-hard problem.

49 / 50

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

50 / 50

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

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