generating recursive descent parser I have a grammar,

$L \to A \langle A \rangle^*$ 

$A \to () \mid (L)$

but I am not sure how to generate parser for $\langle A \rangle$. I know in other case, for example, if $E \to T \langle^*T\rangle^*$ then I can create parser like 

proc E begin 
  T; 
  while symbol='*' do 
    T 
  od 


However in my case don't have any symbol. So how can I check symbol for while process? Or my grammar is incorrect?
You do have a symbol, "$($". A bit more generally though (if I understand the notation you're using), if you're processing an $L$ and you see anything, it must come from an $A$, if it's not an error, so you can recurse to processing an $A$.