<<HELP with recursive descent parser>>

[x91nikorawal@wmich.edu (HACKER)]

Hi,
 The Recursive Descent procedure I have, takes care of all cases
except one, the number + (expression) case. Ex 2 + (3 * 4).

 The grammar I am following is...

        E  ==>	E + T
	E  ==>  T
	T  ==> 	T * F
	T  ==>	F
	F  ==>	(E)
	F  ==>	NUMBER

i.e Only taking care of addition and multiplication




Here are the pseudo-codes for my procedures...


          Procedure F
	  Begin
		Symbol := lex();
		If symbol == number then return TRUE
		If symbol == Lpar then do begin  /* lpar is Left 
						  paranthesis */
		  If E() == TRUE then do begin
			symbol := lex();
			If symbol == Rpar then return TRUE
		end;
		else return FALSE



		Procedure T
		Begin
		  If F() == TRUE then return TRUE
		else begin
		If T()==TRUE the do begin
		Symbol := lex();
		If symbol == '*' then
		   If F() == TRUE return TRUE
		else return FALSE


		Procedure E
		Begin
		If T() == TRUE then return TRUE
		else begin
		If E()== TRUE then 
		symbol = lex();
		If symbol == '+' then
		If T() == TRUE then return TRUE
		else return FALSE;

		


	Any help/suggestion will be appreciated

Thanks
Percy