Context Free Grammar Checker - repost
$30-250 USD
货到付款
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.
项目ID： #4095695
关于项目
有6名威客正在参与此工作的竞标，均价$150/小时
Hi I am an experienced java programmer with knowledge in natural language programming and algorithms. I can get it done for you please see the private message for details.
Hello Sir, I have an excellent Experience with Java and CFG. I have developed similar projects; I developed mini-programming language interpreter (both language and interpreter) and syntax checker and Command line 更多
Hi i have good knowledge of JAVA and also subject of your the requirements. I will be satisfy you.
