Context Free Grammar Checker

Κλειστό Αναρτήθηκε Jan 4, 2013 Πληρώθηκε κατά την παράδοση
Κλειστό Πληρώθηκε κατά την παράδοση

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

Java

Ταυτότητα Εργασίας: #4095680

Σχετικά με την εργασία

5 προτάσεις Απομακρυσμένη εργασία Ενεργό Feb 10, 2013

5 freelancers κάνουν προσφορές κατά μέσο όρο $178 για αυτή τη δουλειά

msabouri

I can help You

$90 USD σε 3 μέρες
(77 Αξιολογήσεις)
5.8
oanagoge

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 Περισσότερα

$200 USD σε 2 μέρες
(13 Αξιολογήσεις)
4.5
astinbenjer

its simple , I did several project before. Consider it done. Check pm

$200 USD σε 5 μέρες
(0 Αξιολογήσεις)
0.0
linhchisoft

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.

$200 USD σε 5 μέρες
(0 Αξιολογήσεις)
0.0
panayk

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 Περισσότερα

$200 USD σε 3 μέρες
(0 Αξιολογήσεις)
0.0