Question

Java assignment :
A string S is made of symbols only in {a, b}. The regular expression anbn represent a string that is made of a certain number of letter a followed by exactly same number of letter b. Using both queue and stack, design an algorithm (in pseudo code) and a set of data structures (in interfaces), and implement them in a Java program (Eclipse project) which could judge if S matches anbn