Recursive Descent: Example 3/4
function T1: boolean;
begin
  T1 := false;
  if token = '*' then begin
           { simulation of rule 5: T’ ® *FT’ }
     GetNextToken;
     T1 := F and T1;
  end
  else
  if token in ['+', ')', '$'] then
           { simulation of rule 6: T’ ® e}
     T1 := true;
end;
• For T’ Î N: Rules 5: T’ ® *FT’,  6: T’ ® e
E
E’
T
T’
F
i
+
(
1
4
8
*
)
$
1
4
7
2
6
5
3
6
3
6
44/57
5
6