difference between predictive & recursive descent parser grammar

Question

A recursive descent parser is a top-down parser built from a set of mutually-recursive procedures (or a non-recursive equivalent).

I want to know that is the predictive parser and recursive descent parser are one and the same.Please explain with reasons.

Explain the following grammar rules of recursive descent parser :

E ::= T{+T}* T ::= V{*V} * V ::=

Thanks...

Answer 1

I am confused that whether the predictive parsers and recursive descent parsers are same or are different. I have read D M Dhamdhere but somewhat confused with the grammar rules... If anyone can help me out then Thanks..