Context Free Grammar Checker

Avg Bid (USD)
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 —> aSbA
S -> #
A -> bbAa
A -> aa

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.

Additional Project Description:
01/05/2013 at 2:55 BDT
must be done in 2 or 3 days

Skills required:
About the employer:
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.

$ 250
in 3 days
Hire msabouri
$ 90
in 3 days
$ 200
in 2 days
Hire panayk
$ 200
in 3 days
$ 200
in 5 days
$ 200
in 5 days