IN JAVA LIKE PSUEDO CODE USING STACKS

IN JAVA LIKE PSUEDO CODE USING STACKS

An input string is defined as:

x C y

where x is a string consisting only of the letters A and B and y is the reverse of the x (i.e. if x=ABABBA then y must equal ABBABA).

Write an algorithm to determine whether an input character string is of the form a D b D c D D z Where each string a, b, z is of the form of the string defined above (xCy). (Thus a string is in the proper form if it consists of any number of such strings separated by the character D, e.g. ABBCBBADACADBABCBABDAABACABAA.) At each point you may read only the next character in the string, i.e. you must process the string on a left to right basis. You may not use string functions.