CD Lab Final Viva

Consider the following statements related to compiler construction :

I.                 Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.

II.               Syntax Analysis is specified by regular expressions and implemented by finite-state machine.

Which of the above statement(s) is/are correct ?

• Only I

• Only II

• Both

• None

• All

Consider the grammar

               S → aSAb | bSBc               A → +AB | ε

               B → *BC | ε                       C → aC | d

First(S) = {a, b},  First(A) = {+, ε}, First(B) = {*, ε}, First(C) = {a, d}

For the above What is in the Follow(S)?

• {a, b, c, +, $}

•   {a, c, +, *, $}

•   {b, c, +, *, $}

• {a, b, d, *, $}

Match all items in Group 1 with correct options from those given in Group 2.

P. Regular expression                     1. Syntax analysis

Q. Pushdown automata                 2. Code generation

R. Dataflow analysis                       3. Lexical analysis

S. Register allocation                      4. Code optimization

• P-4. Q-1, R-2, S-3

• P-3, Q-1, R-4, S-2

• P-3, Q-4, R-1, S-2

• P-2, Q-1, R-4, S-3

Type-checking is normally done during ____________

• Lexical analysis

• Syntax analysis

• Syntax-directed translation

• Code optimization

Which one of the following statements is FALSE?

• Context-free grammar can be used to specify both lexical andsyntax rules

• Type checking is done before parsing

• High-level language programs can be translated to differentIntermediate Representations.

• Arguments to a function can be passed using the program stack