Navigation -
Options
Web Content Display -
Options
Lecture Notes:

 Section A

View the PDF file Lecture 1
PDF : 105 KB
   
View the PDF file Lecture 3
PDF : 105 KB
   
View the PDF file Lecture 5
PDF : 105 KB
View the PDF file Lecture 2
PDF : 105 KB
   
View the PDF file Lecture 4
PDF : 105 KB
   
View the PDF file Lecture 6
PDF : 105 KB
   

     Section B

View the PDF file Lecture 7
PDF : 105 KB
   
View the PDF file Lecture 9
PDF : 105 KB
   
View the PDF file Lecture 11
PDF : 105 KB
   
View the PDF file Lecture 13
PDF : 105 KB
   
View the PDF file Lecture 15
PDF : 105 KB
   
View the PDF file Lecture 17
PDF : 105 KB
   
View the PDF file Lecture 19
PDF : 105 KB
View the PDF file Lecture 8
PDF : 105 KB
   
View the PDF file Lecture 10
PDF : 105 KB
   
View the PDF file Lecture 12
PDF : 105 KB
   
View the PDF file Lecture 14
PDF : 105 KB
   
View the PDF file Lecture 16
PDF : 105 KB
   
View the PDF file Lecture 18
PDF : 105 KB

     Section C

View the PDF file Lecture 20
PDF : 105 KB
View the PDF file Lecture 21
PDF : 105 KB

      Section D

View the PDF file Lecture 22
PDF : 105 KB
   
View the PDF file Lecture 24
PDF : 105 KB
   
View the PDF file Lecture 26
PDF : 105 KB
View the PDF file Lecture 23
PDF : 105 KB
   
View the PDF file Lecture 25
PDF : 105 KB
   
View the PDF file Lecture 27
PDF : 105 KB
   

Important Question 

1.     State the main differences between a compiler and an interpreter.

2.     What is Cross Compiler? Explain Briefly Requiement of 1 Pass, 2 Pass and multipass compiler.

3.     What is Input Buffering? Explain.

4.     Convert the regular expression (a|b)*ab(a+b)into corresponding minimized finite state automata.

5.     Explain Different Phases of Compiler.

6.     .Explain why a left-recursive grammar cannot be parsed using the predictive top-down parsing algorithms.

7.      Consider the following CFG G = (N={S, A, B, C, D}, T={a,b,c,d}, P, S) where the set of productions P is given below:

8.     What is parser? Write the predictive parsing algorithm with example.

9.     Create 3- address code quadruple, triple and indirect triple for the following expression:  a + a* (b-c) + (b-c)*d

10. What are syntax trees  and how these can be constructed.

11. Explain syntax directed translation scheme with examples.

12. What are the attributes associated with a symbol table?  Discuss the operations possible with a symbol table.

13. Explain code optimization and its utility.

14. Explain Dag representation with the help of example.

15. Write a short note on loop unwinding.

16. What do you mean by common subexpression? What are the advantage of identifying it.

17. What is meant by register allocation? Why it is considered as important.