You can implement the project in any language,
I need a recorded video that you explain the major functions in the code , if you prefer to write , i need a full [url removed, login to view] that you list every function in the code and how it works.
It is butter if you can implement a simple user interface for the code , if you can it will be great.
The description of the project is :
a- Develop a programs to do the following tasks:
1- Building an NFA from a given regular expression.
2- Converting a giving NFA into a DFA.
3- Building a DFA from a given regular expression directly without going through an NFA.
b- For the following grammar write a program that uses the LR(1) method to decide whether a given string can be derived in the grammar. If the sentence is derivable, your program should output the derivation of the sentence.
1) S ->L=R
2) S ->R
4) L ->id
5) R ->L
c- Write an implementation for the type system rules included in the type checking slides.
you can assume 3 identifiers such as x,y,z
and assume only 3 functions names that can do simple operations
such as addition
also assume there are only primitive types such as int, double, string, char
the program will read the code(as input from the user) and check the rules while scanning to discover if there is type error or not.
you can make your own rules , example of a rule : if x is int , and y is int , then x+y is accepted , otherwise not accepted , you can implement a rule for assignment , subtraction , division , return type of a function , any rules you can implement