The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and ‘+’ and ‘-’ operators. 1. public static String convert(String postfix) { 2.    String operand1, operand2, infix; 3.    Stack s = new AStack; 4.    int i = 0; 5.    while(i < postfix.length) { 6.         char nextc = postfix.charAt(i); 7.         if ((nextc == '+')||(nextc == '-') { 8.              operand2 = s.pop(); operand1 = s.pop(); 9.              infix = '(' + operand1 + nextc + operand2 + ')'; 10.             s.push(infix); i++; 11.        } 12.        else if (Character.isDigit(nextc)){ 13.             int start = i; 14.             while(Character.isDigit(postfix.charAt(i)) i++; 15.             infix = postfix.substring(start,i); 16.             s.push(infix); 17.        } 18.        else i++; 19.  } 20   return s.pop(); 21. }     a) Rewrite only the lines of code that need to be changed so that the above function converts a postfix expression to a prefix expression.     b) Describe in words what changes are needed on the above given convert() function so that it also finds the value of the converted postfix expressio

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
  1.  The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and ‘+’ and ‘-’ operators.

1. public static String convert(String postfix) {

2.    String operand1, operand2, infix;

3.    Stack<String> s = new AStack<String>;

4.    int i = 0;

5.    while(i < postfix.length) {

6.         char nextc = postfix.charAt(i);

7.         if ((nextc == '+')||(nextc == '-') {

8.              operand2 = s.pop(); operand1 = s.pop();

9.              infix = '(' + operand1 + nextc + operand2 + ')';

10.             s.push(infix); i++;

11.        }

12.        else if (Character.isDigit(nextc)){

13.             int start = i;

14.             while(Character.isDigit(postfix.charAt(i)) i++;

15.             infix = postfix.substring(start,i);

16.             s.push(infix);

17.        }

18.        else i++;

19.  }

20   return s.pop();

21. }

 

 

a) Rewrite only the lines of code that need to be changed so that the above function converts a postfix expression to a prefix expression.

 

 

b) Describe in words what changes are needed on the above given convert() function so that it also finds the value of the converted postfix expression.

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education