Recursion pt. II

I decided to write another post on recursion, since it's been giving me so much trouble. I think it's just a matter of syntax but I struggle with implementing it correctly. It's as if I understand it logically but I just can't get it to do as I desire. So I find my self working from an iterative perspective for most of my code even though I'm told that recursive methods are much easier and more powerful. I'm hoping that before Test II I'll have a much better grasp on recursion because I find it's the only portion of the course I'm struggling with. The main issue I have is in turning a problem into a recursive implementation, for example a fully parenthesized equation. I understand doing the idea of recursively solving portions but I wouldn't understand how to use the parenthesis to control that process. It'd make more sense to me to work through the equation front to back using the parentheses to control the iterative process, like I said something I'll just have to devote more study time to. I guess.