Python3

Convert among infix postfix prefix

Help!!!!!!!! Thank you!!!!!!!!

1. Background (https://en.wikipedia.org/wiki/Exponentiation) For this project, you will implement a program to convert infix to postfix and evaluate a postfix (Reverse Polish or RPN) expression. To make the program more versatile, you'll also provide code to convert infix expressions (the kind used in standard arithmetic) and prefix (Polish or PN) expressions to postfix expressions. In this way your program will be able to evaluate prefix, infix and postfix expressions For this assignment, you will use an implementation of the Abstract Data Type Stack. Make use of a stack array you implemented. Many language translators (e.g. compiler) do something similar to convert expressions into code that is easy to execute on a computer Section 3.9 of the text has a detailed discussion of this material that you should read carefully before building your implementation. You program must use your own implementations of the Abstract Data Type Stack. See the text and Lab 2 for further information on the ADT Stack. Notes Expression will only consist of numbers (integers, reals, positive or negative) and the five operatons separated by spaces. You may assume a capacity of 30 will be sufficient for any expression that your programs will be required to handle. The text discusses an easier version of this problem in detail. You should read it carefully before proceeding. In addition to the operators (shown in the text, your programs should handle the exponentiation operator. In this assignment, the exponential operator will be denoted by . For example, 2438 and 3 2->9 . The exponentiation operator has higher precedence than the or /. For example, 2*32- 2*9 18 not 6 2-36 .Also, the exponentiation operator associates from right to left. The other operators + associate left to right. Think carefully about what this means. For example: 23 2-23 2) 29-512 not (23y2-8 2-64 Every class and function must come with a brief comments you should explain the arguments and what is returned by the function or method. You must provide test cases for all functions. Use descriptive names for data structures and helper functions. You must name your files and functions (methods) as specified below . purpose statement in its docstring. In separate . You will not get full credit if you use built-in functions beyond the basic built in operations unless they are explicitly stated as being allowed. If you are in doubt ask me or one of the student assistants. 2. Functions The following bullet points provide a guide to implement some of the data structures and individual functions of your program. Start by downloading templates to be used. You can use your stack array from previous project. (Note if you didn't get full credit for stack array, contact me!) stack array.py exp eval.py (contains infix to postfix(infix expr) and postfix_ eval(postfix_expr) exp eval testcases.py from PolyLearn and use these are starting points for your project