1. Design and implement a lexical analyzer for given language using C and the lexical analyzer         should ignore redundant spaces, tabs and new lines.

2. Implementation of Lexical Analyzer using Lex Tool.


3.  Program to recognize a valid arithmetic expression that uses operator +, – , * and /.
4.  Program to recognize a valid variable which starts with a letter followed by any number               of  letters or digits.
 5. Implementation of Calculator using LEX and YACC .
 6. Convert the BNF rules into YACC form and write code to generate abstract syntax tree.

 7. Write program to find ε – closure of all states of any given NFA with ε transition. 

 8. Write program to convert NFA with ε transition to NFA without ε transition. 

 9. Write program to minimize any given DFA.

10. Develop an operator precedence parser for a given language. 

11. Write program to find Simulate First and Follow of any given grammar. 

12. Construct a recursive descent parser for an expression. 

13. Construct a Shift Reduce Parser for a given language. 

11. Write a program to perform loop unrolling.

12. Write a program to perform constant propagation.

13. Implement Intermediate code generation for simple expressions.


14. Implement the back end of the compiler which takes the three address code and produces            the 8086 assembly language instructions that can be assembled and run using an 8086                  assembler. The target assembly instructions can be simple move, add, sub, jump etc.