What are the criteria for determining if a language can be parsed using recursive descent parsing?

Question

How do i know if a language can be parsed by recursive descent parsing?

For example, how would i go about determining whether this language can be parsed in that manner:

Language = { s^p r^q | p > q }?

I have tried reading about the concept but it doesn't click.