By combining equations (1) to (4) we conclude that, for each complete computation c of A, p A (c) = p G (f (c)) = p G (f (c)) = p A (c) = p G (f (c)).
our parsing strategy S can be probabilistically extended.