Java code need

This assignment implements ADT Queue and uses Queue and Stack for a calculator application.

Below is Stack code

Just write the code that i need is ok and tell me put them at where

Thanks!

package application; /* Basic node element that is used by the linked list/ class StackNode { String data; //the node stored value StackNode next; //pointing to next node //Default constructor public StackNode() //Constructor with data value assigned public StackNode (String value) data = value; //Constructor with data value and next node assigned public StackNode (String value, StackNode next) data = value; this.next = next; //Basic setters and getters public String getData() { return data; public void setData(String data) { this.data = data; public StackNode getNext() { return next; public void setNext(StackNode next) { this.next = next; /* MyStack class is used to store string into the stack * According to the stack logic, you need to implement the function members of MyStack based on the linked list structure * * public class MyStack{ private StackNode top_node; //pointing to the first node //Default constructor public Mystack() /* MyStack class is used to store string into the stack * According to the stack logic, you need to implement the function members of MyStack based on the linked list structure public class MyStack{ private StackNode top_node; //pointing to the first node //Default constructor public MyStack() top_node = null; //by default, the node is empty. //Constructor with the first node public Mystack(StackNode node) { top_node = node; //check if the stack is empty public boolean isEmpty() if(top_node == null) return true; else return false; //clear the stack public void clear() top_node = null; // A general push() method for stack public void pushNode (StackNode node) { if (top_node == null) { top_node = node; } else { node.setNext(top_node); top_node = node; //insert a node into the stack public void push(StackNode node) //if there is no any element in the stack, the calculator only accepts numbers or "-" if(top_node == null) if(node.getData().matches("*[0-9]+$") || node.getData().equals("-")> top_node = node; else if(node.getData().matches("[0-9]+$")) //if the inserted node is a number node.setNext(top_node); ton node = node. //insert a node into the stack public void push(StackNode node) //if there is no any element in the stack, the calculator only accepts numbers or "-" if(top_node == null) if(node.getData().matches("[0-9]+$") || node.getData().equals("-")) top_node = node; else if(node.getData().matches ("^[0-9]+$")) //if the inserted node is a number node.setNext(top_node); top_node = node; else //if the inserted node is "+", "-", "*" if(top_node.getData().matches ("^[0-9]+$")) //if the recently inserted node is a number, then just insert the "node" straight away node.setNext(top_node); top_node = node; else //if recently inserted node is an operator, e.g. "+", "-", "*", then replace its value by the "node" value if(top_node.getNext() != null ) top_node.setData(node.getData(); //remove the most recently inserted node public void pop() if(top_node != null) top_node = top_node.getNext(); else System.out.println("The stack is already empty"); //get recently inserted node public StackNode getTop() { if(top_node == null) System.out.println("The stack is empty"); else return top_node; return null. //get recently inserted hode public StackNode getTop() { if(top_node == null) System.out.println("The stack is empty"); return top_node; return null; //get and remove the most recently inserted node public StackNode getTopandPop() { if(top_node == null) System.out.println("The stack is empty"); StackNode temp = top_node; top_node = top_node.getNext(); return temp; return null; //This function will all the stored strings connected and return it as a single string public String getAllNodeValues() StringBuilder all_strings = new StringBuilder(); // used to store all the strings from the stack int i = 0; StackNode temp = top_node; while(temp != null) all_strings.append(temp.getData(); temp = temp.getNext(); all_strings.reverse(); return all_strings.toString(); /*This function will to implement the "=" key that process the expression entered by users and calculates a final number. In addition to the calculation, the final number needs to be converted into a string format and output to the display. So there are five basic steps involved below. public void computeExp() String exp = getAllNodeValues(); //get the current expression 1/Step 1: convert a string into an infix queue MyQueue infix_queue = getInfixFromString(getAllNodeValues(); public void computeExp() String exp = getAllNodeValues(); //get the current expression 1/Step 1: convert a string into an infix queue MyQueue infix_queue = getInfixFromString(getAllNodeValues()); //Step 2: convert an infix queue into an postfix queue MyQueue postfix_queue = infix2postfix(infix_queue); //Step 3: Compute the final value from the postfix queue String final_value = processPostfix(postfix_queue); //Step 4: Clear the stack this.clear(); //Step 5: put the final_value into the stack for(int i = 0; i = exp.length) // check whether this move causes out of // range infix queue.enqueue (builder.toString(); break; while (exp.substring(i, i + 1).matches ("^[0-9]+$")) { builder.append(exp.substring(i, i + 1)); i++; if (i >= exp.length() // check whether this move causes out // of range break; infix queue.enqueue (builder.toString(); i--; // let the cursor moves one step back as at the end of the // for-loop i++ automatically return infix_queue; /*Convert an input infix queue into A postfix queue, which is the output of the function */ private MyQueue infix2postfix(MyQueue infix_queue) //Declare queue to store postfix MyQueue postfix_queue = new MvQueue(); //store the conversion result from infix_queue //Go through the infix_queue and convert it to a postfix_queue MyStack operator_stack = new MyStack(); while(!infix_queue.isEmpty()) String current = (string) infix_queue.dequeue(); //get the top token De /* Convert an input infix queue into A postfix queue, which is the output of the function */ private MyQueue infix2postfix(MvQueue infix_queue) //Declare queue to store postfix MvQueue postfix_queue = new MvQueue(); //store the conversion result from infix_queue //Go through the infix_queue and convert it to a postfix_queue MyStack operator_stack = new MyStack(); while(!infix_queue. isEmpty()) String current = (string) infix_queue.dequeue (); //get the top token //if the current token is an operator if(current.equals("+") || current.equals("*") || current.equals("-")) if (operator_stack.isEmpty() operator_stack.pushNode(new StackNode (current)); else String top = (string)operator_stack.getTopandPop().getData(); if(greaterThan(current, top)) //if the current operator has higher priority operator_stack.pushNode (new StackNode (top)); //push the just popped top node back to the stack operator_stack.pushNode(new StackNode(current)); else //Pop the stack until you find a symbol of lower priority number than the current one while(!greaterThan(current, top)) //add the top to the queue postfix..queue. enqueue((String) top); StackNode top_node - operator_stack.getTopandPop(); //keep popping if(top_node == null) //if the stack is empty, stop popping the queue top = null; operator_stack.pushNode(new StackNode(current)); break; else top - top_node.getData(); if(top != null) //the last popped element has lower priority, so push it back operator_stack.pushNode(new StackNode (top)); //push the just popped top node back to the stack operator_stack.pushNode (new StackNode (current)); operator_stack.pushNode(new StackNode(top)); //push the just popped top node back to the stack operator_stack.pushNode(new StackNode(current)); else //if the current token is an operand postfix_queue.enqueue ((String)current); // Check operator_stack if it is not empty, put them into while (!operator_stack.isEmpty()) { StackNode node = operator_stack.getTopandPop(); postfix..queue. enqueue (node.getData(); //Debug: see what are stored in the postfix_stack MyQueue copy_postfix_queue = new MyQueue(); while(!postfix_queue.isEmpty()) String token = (string) postfix_queue. dequeue(); System.out.println(token); copy_postfix_queue. enqueue (token); postfix_queue = copy_postfix_queue; return postfix_queue; /*A priority comparison function between two operators opt1 and opt2"/ private boolean greater Than(String opti, String opt2) if(opt1.equals("*") && !opt2.equals("*")) return true; else return false; /* Process the postfix expression to compute the final value */ private String processPostfix(MyQueue postfix) //Implementation here... //Below is just a start, you need to fill the values for final_value String final_value = ""; return final_value; package application; /* Basic node element that is used by the linked list/ class StackNode { String data; //the node stored value StackNode next; //pointing to next node //Default constructor public StackNode() //Constructor with data value assigned public StackNode (String value) data = value; //Constructor with data value and next node assigned public StackNode (String value, StackNode next) data = value; this.next = next; //Basic setters and getters public String getData() { return data; public void setData(String data) { this.data = data; public StackNode getNext() { return next; public void setNext(StackNode next) { this.next = next; /* MyStack class is used to store string into the stack * According to the stack logic, you need to implement the function members of MyStack based on the linked list structure * * public class MyStack{ private StackNode top_node; //pointing to the first node //Default constructor public Mystack() /* MyStack class is used to store string into the stack * According to the stack logic, you need to implement the function members of MyStack based on the linked list structure public class MyStack{ private StackNode top_node; //pointing to the first node //Default constructor public MyStack() top_node = null; //by default, the node is empty. //Constructor with the first node public Mystack(StackNode node) { top_node = node; //check if the stack is empty public boolean isEmpty() if(top_node == null) return true; else return false; //clear the stack public void clear() top_node = null; // A general push() method for stack public void pushNode (StackNode node) { if (top_node == null) { top_node = node; } else { node.setNext(top_node); top_node = node; //insert a node into the stack public void push(StackNode node) //if there is no any element in the stack, the calculator only accepts numbers or "-" if(top_node == null) if(node.getData().matches("*[0-9]+$") || node.getData().equals("-")> top_node = node; else if(node.getData().matches("[0-9]+$")) //if the inserted node is a number node.setNext(top_node); ton node = node. //insert a node into the stack public void push(StackNode node) //if there is no any element in the stack, the calculator only accepts numbers or "-" if(top_node == null) if(node.getData().matches("[0-9]+$") || node.getData().equals("-")) top_node = node; else if(node.getData().matches ("^[0-9]+$")) //if the inserted node is a number node.setNext(top_node); top_node = node; else //if the inserted node is "+", "-", "*" if(top_node.getData().matches ("^[0-9]+$")) //if the recently inserted node is a number, then just insert the "node" straight away node.setNext(top_node); top_node = node; else //if recently inserted node is an operator, e.g. "+", "-", "*", then replace its value by the "node" value if(top_node.getNext() != null ) top_node.setData(node.getData(); //remove the most recently inserted node public void pop() if(top_node != null) top_node = top_node.getNext(); else System.out.println("The stack is already empty"); //get recently inserted node public StackNode getTop() { if(top_node == null) System.out.println("The stack is empty"); else return top_node; return null. //get recently inserted hode public StackNode getTop() { if(top_node == null) System.out.println("The stack is empty"); return top_node; return null; //get and remove the most recently inserted node public StackNode getTopandPop() { if(top_node == null) System.out.println("The stack is empty"); StackNode temp = top_node; top_node = top_node.getNext(); return temp; return null; //This function will all the stored strings connected and return it as a single string public String getAllNodeValues() StringBuilder all_strings = new StringBuilder(); // used to store all the strings from the stack int i = 0; StackNode temp = top_node; while(temp != null) all_strings.append(temp.getData(); temp = temp.getNext(); all_strings.reverse(); return all_strings.toString(); /*This function will to implement the "=" key that process the expression entered by users and calculates a final number. In addition to the calculation, the final number needs to be converted into a string format and output to the display. So there are five basic steps involved below. public void computeExp() String exp = getAllNodeValues(); //get the current expression 1/Step 1: convert a string into an infix queue MyQueue infix_queue = getInfixFromString(getAllNodeValues(); public void computeExp() String exp = getAllNodeValues(); //get the current expression 1/Step 1: convert a string into an infix queue MyQueue infix_queue = getInfixFromString(getAllNodeValues()); //Step 2: convert an infix queue into an postfix queue MyQueue postfix_queue = infix2postfix(infix_queue); //Step 3: Compute the final value from the postfix queue String final_value = processPostfix(postfix_queue); //Step 4: Clear the stack this.clear(); //Step 5: put the final_value into the stack for(int i = 0; i = exp.length) // check whether this move causes out of // range infix queue.enqueue (builder.toString(); break; while (exp.substring(i, i + 1).matches ("^[0-9]+$")) { builder.append(exp.substring(i, i + 1)); i++; if (i >= exp.length() // check whether this move causes out // of range break; infix queue.enqueue (builder.toString(); i--; // let the cursor moves one step back as at the end of the // for-loop i++ automatically return infix_queue; /*Convert an input infix queue into A postfix queue, which is the output of the function */ private MyQueue infix2postfix(MyQueue infix_queue) //Declare queue to store postfix MyQueue postfix_queue = new MvQueue(); //store the conversion result from infix_queue //Go through the infix_queue and convert it to a postfix_queue MyStack operator_stack = new MyStack(); while(!infix_queue.isEmpty()) String current = (string) infix_queue.dequeue(); //get the top token De /* Convert an input infix queue into A postfix queue, which is the output of the function */ private MyQueue infix2postfix(MvQueue infix_queue) //Declare queue to store postfix MvQueue postfix_queue = new MvQueue(); //store the conversion result from infix_queue //Go through the infix_queue and convert it to a postfix_queue MyStack operator_stack = new MyStack(); while(!infix_queue. isEmpty()) String current = (string) infix_queue.dequeue (); //get the top token //if the current token is an operator if(current.equals("+") || current.equals("*") || current.equals("-")) if (operator_stack.isEmpty() operator_stack.pushNode(new StackNode (current)); else String top = (string)operator_stack.getTopandPop().getData(); if(greaterThan(current, top)) //if the current operator has higher priority operator_stack.pushNode (new StackNode (top)); //push the just popped top node back to the stack operator_stack.pushNode(new StackNode(current)); else //Pop the stack until you find a symbol of lower priority number than the current one while(!greaterThan(current, top)) //add the top to the queue postfix..queue. enqueue((String) top); StackNode top_node - operator_stack.getTopandPop(); //keep popping if(top_node == null) //if the stack is empty, stop popping the queue top = null; operator_stack.pushNode(new StackNode(current)); break; else top - top_node.getData(); if(top != null) //the last popped element has lower priority, so push it back operator_stack.pushNode(new StackNode (top)); //push the just popped top node back to the stack operator_stack.pushNode (new StackNode (current)); operator_stack.pushNode(new StackNode(top)); //push the just popped top node back to the stack operator_stack.pushNode(new StackNode(current)); else //if the current token is an operand postfix_queue.enqueue ((String)current); // Check operator_stack if it is not empty, put them into while (!operator_stack.isEmpty()) { StackNode node = operator_stack.getTopandPop(); postfix..queue. enqueue (node.getData(); //Debug: see what are stored in the postfix_stack MyQueue copy_postfix_queue = new MyQueue(); while(!postfix_queue.isEmpty()) String token = (string) postfix_queue. dequeue(); System.out.println(token); copy_postfix_queue. enqueue (token); postfix_queue = copy_postfix_queue; return postfix_queue; /*A priority comparison function between two operators opt1 and opt2"/ private boolean greater Than(String opti, String opt2) if(opt1.equals("*") && !opt2.equals("*")) return true; else return false; /* Process the postfix expression to compute the final value */ private String processPostfix(MyQueue postfix) //Implementation here... //Below is just a start, you need to fill the values for final_value String final_value = ""; return final_value