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