Your question does not make any sense. How a data structure can accept a language? We need language acceptors like FA,PDA,Turing Machine for these.
By the way,
Finite Automata + Stack = PDA
Finite Automata + 2 Stacks = Finite Automata + Queue = TM
Hence if your question will be edited, then FA with a queue can easily accept the given CFL.