Context Free Grammar Checker
$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.
must be done in 2 or 3 days
Ταυτότητα Εργασίας: #4095680
Σχετικά με την εργασία
5 freelancers κάνουν προσφορές κατά μέσο όρο $178 για αυτή τη δουλειά
I have been programming for over 10 years and I have 5+ years experience in Java. During my computer science degree, I have learned a lot about formal language theory, and CFG in particular. I am confident I can help y Περισσότερα
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.
This can be done, but is not trivial. 3 days is somewhat pressing. First we have to write a parser for the input (grammar) file, which is fairly simple, but we will need an exact meta-grammar. Then (or while we are doi Περισσότερα