Context Free Grammar Checker

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: a b S A S —> aSbA S -> # A -> bbAa A -> aa *** aabaabbbaaa 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 thank you.