Parser that uses a set of objects as rules.

I have a set of objects in the form of a collection of parent child relationships: ... **rule_left_part1 ** token_collection1 token_collecton2 //a real example: **if_statement ** "if" "(" condition ")" statement ";" ... It represents a set of BNF rules like, for example: if_statement ::= "if" "(" condition ")" statement ";" I need to write a parser that based on this collection. Meaning, the parser must take the BNF rules as a set of objects in C# and build the parsing tree based on their properties. --- The number of objects in the collection is DYNAMIC, and they can be dynamically changed as well. You can not use tools like YACC etc to generate source code and build a parser. No, you can NOT do it. For one thing, everything must be done in C#. Another thing, the rules change dynamically, and I do not want to recompile the application for it. Also, you must understand how to write parser that use regular expressions and other special rules, for example: some_statement ::= (* another_statement) another_statement; which means "some_statement consists of no matter what, that is not another_statement, followed by another_statement" another example would be: some_statement ::= '[0-9]+'; which means "some_statement is a number with at least one digit" Also see an example of grammar tree in the picture This is for C# and the following snippet of code: if ([login to view URL](i)) { [login to view URL]("Error loading image " + i + "; quitting."); return; } ## Deliverables 1) Complete and fully-functional working program(s) in complete source code of all work done. 2) Deliverables must be in ready-to-run condition 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Visual C# on Win32