Section A

  Attempt any two questions. (2×10=20)

1. Explain the role of Lexical Analyzer. Define Regular Expression. Convert the 1.(0+1)*.0 to DFA directly. (3+1+6)

• Answer :

2. What do you understand by top down parsing? Construct an LL(1) parse table for the following grammar. (2+8)

A→BC C→bBC|E B→ED D→CED|Є E⇒(A)|a

• Answer :

3. Write the advantages of Intermediate Code Generation. Explain different types of intermediate code representation methods with example. (10)

• Answer :

                                                    **Section B**
  
     Attempt any eight questions.            (8×5-40)
  

4. Draw block diagram with phases of compiler and explain any two phases.

• Answer :

5. What is symbol table? What information is stored in symbol table? Explain.