Design and implement and ADT Interpreter for algebraic infix expressions involving only constants and binary operators. The interpreter uses a stack ADT and a list ADT. Also requires recursive computation.
Bonus for timely delivery
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
MS Visual C++ 6.0