Context Free Grammar Checker - repost
This project received 9 bids from talented freelancers with an average bid price of $147 USD.Get free quotes for a project like this
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:
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
Looking to make some money?
- Set your budget and the timeframe
- Outline your proposal
- Get paid for your work
Hire Freelancers who also bid on this project
Looking for work?
Work on projects like this and make money from home!Sign Up Now
- The New York Times
- Wall Street Journal
- Times Online