dcg - how to define (sometimes) recursive prolog trees -

I get two different types of sentences to parse, but I'll name them for names now. Actually, I have two parse trees

  1A -> A, PP A - & gt; DV, NP2A - & gt; TV, NP  

I hope that makes sense, I do not know how to do this program about how many loops to join in Proole! Any help would be great, please tell me if I can provide more information (using the first stack overflow)