1. FL(S) := {ε}
2. for each A ∈ N - {S} do
        FL(A) := ∅
3. repeat
        foreach A ∈ N do
             FL'(A) := FL(A)
        foreach A → X₁X₂...X_n ∈ P do
             L := FL'(A)
             for i := n downto 1 do
                  L := FIRST_k(X_i+1)⋅_k L
                  if X_i ∈ N then
                       FL(X_i) := FL(X_i) ∪ L
             end for
        end for
   until FL(A) = FL'(A) ∀ A ∈ N
4. FOLLOW_k(A) := FL(A)

Otra versión del mismo algoritmo es:

1. FL(S) := {ε}
2. for each A ∈ N - {S} do
        FL(A) := ∅
3. repeat
        foreach A ∈ N do
             FL'(A) := FL(A)
        foreach A → X₁X₂...X_n ∈ P do
             for i := n downto 1 do
                  if X_i ∈ N then
                       FL(X_i) := FL(X_i) ∪ FIRST_k(X_i+1) ⋅_k FIRST_k(X_i+2) ⋅_k ... ⋅_k FIRST_k(X_n) ⋅_k FL'(A)
             end for
        end for
   until FL(A) = FL'(A) ∀ A ∈ N
4. FOLLOW_k(A) := FL(A)