You are to write a program that reads infix expressions from an input file, one expression per line, evaluates these expressions, and displays the original expressions together with their values, one per line, in an output file. The program is actually more complex than this as will be explained below. In this assignment, you will write an infix calculator object that is called by an object that simulates a server. The pseudo-server reads input expressions and hands them to the calculator. You must use the STL stack and queue containers implemented in C++ in this assignment. You cannot use your own. If your compiler does not provide them, download them from the STL website.
complete assignment in attached file.
dead line is wednesday or Thursday morning.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
You must use the STL stack and queue containers implemented in C++