Cycle 1

• Count the number of voewls and consonants in a given string
• Count the number of lines words and characters in the given file
• Replace "abc" with "ABC" from the given input string
• Generate a YACC specification to recognize a valid arithmetic expression that uses operators +, – , *,/ and parenthesis. Lex Yacc
• Generate a YACC specification to recognize a valid identifier which starts with a letter followed by any number of letters or digits. Lex Yacc
• Implementation of Calculator using LEX and YACC. Lex Yacc
• Design and implement a lexical analyzer using C language to recognize all valid tokens in the input program
• Implement a Lexical Analyzer for a given program using Lex Tool
• Convert the BNF rules into YACC form and write code to generate abstract syntax tree Lex Yacc

Cycle 2

• Write a program to find ε – closure of all states of any given NFA with ε transition
• Write a program to convert NFA with ε transition to NFA without ε transition
• Write a program to convert NFA to DFA
• Write a program to minimise any given DFA

Cycle 3

• Write a program to find First and Follow of any given grammar
• Design and implement a recursive descent parser for a given grammar
• Construct a Shift Reduce Parser for a given language

Cycle 4

• Write a program to perform constant propagation

Cycle 5

• Implement Intermediate code generation for simple expressions

Cycle 6

• Implement the back end of the compiler which takes the three address code and produces the 8086 assembly language instructions