developing C++ program to do the following tasks:
1- Building an NFA from a given regular expression.
2- Converting a giving NFA into an equivalent minimized DFA.
3- Building a DFA for a given regular expression directly without going through an NFA.
4- Implementing the LL(1) algorithm for a given context free grammar.
also i want to have s small session on skype to explain to me the code .
this project should be done by Sunday at morning(which means after only 1 day)
please send me your skype address by message to add you if i awarded the project to you