String reversal using stack

This code snippet is to reverse the string using stack

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56

import java.io.IOException;   // Code to Reverse the string through the Stack Data structure   public class StringReverserThroughStack {    private String input;    private String output;    public StringReverserThroughStack(String in) {       input = in;    }    public String doRev() {       int stackSize = input.length();       Stack theStack = new Stack(stackSize);       for (int i = 0; i < input.length(); i++) {          char ch = input.charAt(i);          theStack.push(ch);       }       output = "";       while (!theStack.isEmpty()) {          char ch = theStack.pop();          output = output + ch;       }       return output;    }    public static void main(String[] args)    throws IOException {       String input = "Java Source and Support";       String output;       StringReverserThroughStack theReverser =       new StringReverserThroughStack(input);       output = theReverser.doRev();       System.out.println("Reversed: " + output);    }    class Stack {       private int maxSize;       private char[] stackArray;       private int top;       public Stack(int max) {          maxSize = max;          stackArray = new char[maxSize];          top = -1;       }       public void push(char j) {          stackArray[++top] = j;       }       public char pop() {          return stackArray[top--];       }       public char peek() {          return stackArray[top];       }       public boolean isEmpty() {          return (top == -1);       }    } }