Printed and screen in computer system are common from A.process device b. Computation unit c. Input units d.output units?

Write a java program that accept stack ADT converts infix expression to postfix form evaluates the postfix expression?

import java.io.*;class stack{char stack1[]=new char[20];int top;void push(char ch){top++;stack1[top]=ch;}char pop(){char ch;ch=stack1[top];top--;return ch;}int pre(char ch){switch(ch){case '-':return 1;case '+':return 1;case '*':return 2;case '/':return 2;}return 0;}boolean operator(char ch){if(ch=='/'ch=='*'ch=='+'ch=='-')return true;elsereturn false;}boolean isAlpha(char ch){if(ch>='a'&&ch='0'&&ch=='9')return true;elsereturn false;}void postfix(String str){char output[]=new char[str.length()];char ch;int p=0,i;for(i=0;ipre(stack1[top]))stack1[top]=='('){push(ch);}}else if(pre(ch)

Printed and screen in computer system are common from A.process device b. Computation unit c. Input units d.output units?

What else can I help you with?

Write a java program that accept stack ADT converts infix expression to postfix form evaluates the postfix expression?

Resources

Top Categories

Product

Company