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.
Dear Dr. Khalid
Alsalmo Alikom
I am karim mohamed and I am a senior java developer resident in Riyadh/KSA which I believe will facilitate my task with you isA , I am an Egyptian software engineer working in the Saudi market since 7 years in Java field and I believe I fit in your required tasks as for the time constraints I initially expect 3 weeks but if you need the task in less time we can arrange it isA
I have very good exposure towards JAVA and CFG(Context Free Grammer). I have already done several parsers in JAVA, which will definitely help me in completing the project at the earliest. Being a SCJP, OCDWCD, OCDBCD certified professional I can complete this project within expected time frame.