Context Free Grammar Checker - repost

CLOSED
Bids
9
Avg Bid (USD)
$147
Project Budget (USD)
$30 - $250

Project Description:
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.

Skills required:
Java
About the employer:
Verified
Public Clarification Board
Bids are hidden by the project creator. Log in as the employer to view bids or to bid on this project.
You will not be able to bid on this project if you are not qualified in one of the job categories. To see your qualifications click here.


$ 200
in 3 days
$ 150
in 3 days
$ 100
in 2 days
Hire sandipsandy
$ 100
in 5 days
$ 120
in 3 days
$ 200
in 4 days
$ 150
in 6 days
Hire aslathgulsar
$ 200
in 7 days
Hire trunix
$ 100
in 4 days