Write a program that converts infix expressions to postfix expressions. This program should use the Token and Scanner classes developed in the case study. The program should consist of a main function that performs the inputs and outputs, and a class named IFToPFConverter. The main function receives an input string and creates a scanner with it. The scanner is then passed as an argument to the constructor of the converter object. The converter object’s convert method is then run to convert the infix expression using the algorithm described in this chapter. This method returns a list of tokens that represent the postfix string. The main function then displays this string. You should also define a new method in the Token class, getPrecedence(), which returns an integer that represents the precedence level of an operator. (Note: You should assume for this project that the user always enters a syntactically correct infix expression.)
The post Write a program that converts infix expressions to postfix expressions appeared first on homeworkcrew.com.
Hi there! Click one of our representatives below and we will get back to you as soon as possible.