You are required to implement a basic calculator that supports integer operands like 60, 19, 83,...

 

Transcribed Image Text:

You are required to implement a basic calculator that supports integer operands like 60, 19, 83, 73, and -15 as well as the (binary) integer operators +, -, *,/, and %. The style of arithmetic expressions our calculator will evaluate is also called a post-fix notation. Stacks are great for doing this job! Your task is to write a program that uses Stack ATD and one of the given implementations to perform these calculations as specified here. Your program should be called Calculator and work as follows: • The user enters input through console consisting of operands and operators, presumably in post-fix notation. We can also include some extra operators to get information about results and the current state of the stack. • If the user enters a valid integer, you push that integer onto the stack. • If the user enters a valid operator, you pop two integers off the stack, perform the requested operation, and push the result back onto the stack. If the user enters the symbol ^ (that's a caret), power will be calculated. (2^3 = 8) and pop the LIFO value only. • If the user enters the symbol! (that's an exclamation mark or bang), you the program. Here is an example for interacting with Calculator that will hopefully help you understand what you're trying to achieve. 20 30 [10] [20 10] [30 20 10] [600 10] [610] 610 101 You are required to implement a basic calculator that supports integer operands like 60, 19, 83, 73, and -15 as well as the (binary) integer operators +, -, *,/, and %. The style of arithmetic expressions our calculator will evaluate is also called a post-fix notation. Stacks are great for doing this job! Your task is to write a program that uses Stack ATD and one of the given implementations to perform these calculations as specified here. Your program should be called Calculator and work as follows: • The user enters input through console consisting of operands and operators, presumably in post-fix notation. We can also include some extra operators to get information about results and the current state of the stack. • If the user enters a valid integer, you push that integer onto the stack. • If the user enters a valid operator, you pop two integers off the stack, perform the requested operation, and push the result back onto the stack. If the user enters the symbol ^ (that's a caret), power will be calculated. (2^3 = 8) and pop the LIFO value only. • If the user enters the symbol! (that's an exclamation mark or bang), you the program. Here is an example for interacting with Calculator that will hopefully help you understand what you're trying to achieve. 20 30 [10] [20 10] [30 20 10] [600 10] [610] 610 101

Answer rating: 100% (QA)

The belw is the JV de fr the bve rblem imrt jvutilSnner imrt jvutilStk ubli lss lultr returns th... View the full answer