How do I construct a parse tree from a series of S-expression tokens in Prolog?

Question

I\'m curious about Prolog as a parser, so I\'m making a little Lisp front-end. I have already made a tokenizer, which you can see here:

base_tokenize([], Buff