Context Free Grammar Checker - repost

Mbyllur Postuar Jan 4, 2013 Paguhet në dorëzim
Mbyllur Paguhet në dorëzim

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.

Java

ID Projekti: #4095695

Rreth projektit

6 propozimet Projekti në distancë Aktiv Feb 10, 2013

6 profesionistë freelancer dërguan një ofertë mesatare prej $150 për këtë punë

tientaiTA

Let me help you. Please check PMB!

$150 USD për 3 ditë
(10 Përshtypje)
3.6
trunix

Hi, I can help You

$100 USD për 4 ditë
(0 Përshtypje)
0.0
aslathgulsar

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.

$200 USD për 7 ditë
(0 Përshtypje)
0.0
rowanTarek

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 Më shumë

$150 USD për 6 ditë
(0 Përshtypje)
0.0
keithgchapman

I do research in compilers and programming languages. I can do this for you.

$200 USD për 4 ditë
(0 Përshtypje)
1.6
sandipsandy

Hi i have good knowledge of JAVA and also subject of your the requirements. I will be satisfy you.

$100 USD për 5 ditë
(0 Përshtypje)
0.0