Closed

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.

must be done in 2 or 3 days

Skills: Java

See more: context free grammar checker, java program checker, java free, grammar, free java, context , java project tree, input rule, java simple program example, context free grammar java, java context free grammar, project context system, checker grammar java, free case, tree java simple, objective grammar, terminals, grammar objective, java grammar checker, string objective, program tree java, rule java, tree project java, simple tree java, java simple tree

About the Employer:
( 0 reviews ) Saudi Arabia

Project ID: #4095680

5 freelancers are bidding on average $178 for this job

webprof2

msabouri jan, enghade payin gheymat nade!! ham bara khodet khoobe ham bara maa :-)

$250 USD in 3 days
(73 Reviews)
5.3
msabouri

I can help You

$90 USD in 3 days
(42 Reviews)
4.9
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 More

$200 USD in 2 days
(10 Reviews)
4.0
astinbenjer

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

$200 USD in 5 days
(0 Reviews)
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 in 5 days
(0 Reviews)
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 More

$200 USD in 3 days
(0 Reviews)
0.0