GOVT.
MODEL ENGINEERING COLLEGE
THRIKKAKKARA, ERNAKULAM
.......................................................................................................................................................
NAME: ALEX ROY
BRANCH: COMPUTER SCIENCE AND ENGINEERING
SEMESTER : 7 ROLL NO : 20CSA13
Certified that this is the bonafide work done by
. .....................................................................................................................................
Staff- in Charge Head of the Department
Register No............................................................ Date:.............................................
Year and month.............................................................. Thrikkakkara
Internal Examiner External Examiner
INDEX
SL.N DATE NAME OF THE PROGRAM PAG REMARKS
O. E.
NO
.
Program to find ԑ closure of all states of any
1 given NFA with ԑ transition
21/08/23
3
Program to convert NFA with ԑ transition 6
2 to NFA without ԑ transition
21/08/23
Program to convert NFA to DFA 14
3
21/08/23
Program to minimize any given DFA 22
4
04/09/23
Implement a lexical analyzer for given
5
04/09/23 language using C and the lexical analyzer
should ignore redundant spaces, tabs and 34
newlines
Implement a lex program to recognize all
6
20/09/23 strings which does not contain first four
characters of your name as a substring 38
YACC program to recognize a valid variable
7 20/09/23 which starts with a letter followed by any 40
number of digits or letters
Implementation of calculator using lex and yacc 42
8
08/10/23
Convert BNF rules into YACC form and write 46
9
08/10/23 code to generate abstract syntax tree
YACC program to check the syntax of FOR 54
10
16/10/23 statement in C
Develop an operator precedence parser for a 57
11 given language
21/10/23
Program to find First and Follow of any given 62
12 21/10/23
grammar
Construct a recursive descent parser for 70
13
08/11/23 an expression
Construct a shift reduce parser for a given 74
14 language
08/11/23
Implement intermediate code generation 78
15
15/11/23 for simple expressions
Implement back end of compiler which takes
three address code and produces the 8086
16 22/11/23 assembly language instructions that can be 81
assembled and run using an 8086 assembler.