The objective of this project is to determine if a given string can be generated by a context free grammar (CFG) by showing its derivation tree. The inputs are:
1. Set of terminals
2. Set of non-terminals.
3. Set of all the production rules, one per line. Use # in place of empty string
Place *** after the last rule.
4. The input string.
For example, an input of:
S —> aSbA
S -> #
A -> bbAa
A -> aa
The system will indicate whether the string belongs or not to the given CFG, and in case it does belong then proceed to show its full derivation tree
the program must be simple , clear ,commented and documented
must be done in 2 or 3 days
5 freelancers are bidding on average $178 for this job
Dear sir, your problem is natural language processing field, this is field which I am researching. So I can solve your problem, please choose me for your project. All field, function will be commented.