Compiler-Design-Lab

Amrith M
S1710
TVE15CS010
Programs For Compiler Design Lab ==> S7-CS ==>Solutions to the Lab-Cycle

Completed

• Lab Cycle 1
• ============
• Program 1 - Closure of Epsilon-NFA
• Program 2 - Conversion of Epsilon-NFA to NFA
• Program 3 - Conversion of NFA to DFA
• Program 4 - Conversion of DFA to Minimised DFA using Myhill-Nerode Theorem

• Lab Cycle 2
• ============
• Program 1 - Lexical Analyzer for a given language
• Program 2 - Lexical Analyzer Using Lex Tool
• Program 3-A - Arithmetic Expression Validator using YACC
• Program 3-B - Identifier Validator using YACC
• Program 3-C - Calculator using YACC
• Program 3-D - BNF Demo(Removed From Cycle Due to Lack of Clarity in the question)

• Lab Cycle 3
• ============
• Program 1 - Operator Precedence Parser For Expression Grammar
• Program 2 - Custom Recursive Descent Parser For Grammar(Without Left Recursion)
• Program 3 - First & Follow of Expression Grammar(Without Left Recursion)
• Program 4 - Shift Reduce Parser

• Lab Cycle 4
• ============
• Program 1 - Tokenize and Parse the given program with the given grammar
• Program 2 - Symbol Table
• Program 3 - Generated Stack Machine Code
• Program 4 - Interpreted Output

• Lab Exam
• ============
• Program 1 - Find and Replace Using Lex
• Program 2 - RDP For a given grammar
• Program 3 - Infix to Postfix conversion using YACC

• Report
• ============
• Report and source code uploaded in Final Lab Report folder