blog.weirdx.io
FIRST and FOLLOW 알고리즘 연습 - 이상한모임
LL Parsing FIRST and FOLLOW FIRST for ∀A ∈ NON-TERMINAL do FIRST(A) = ∅ // FIRST(A)는 공집합으로 시작 for A → α ∈ P do if α = aβ where a ∈ TERMINAL then --------------------- [1] FIRST(A) = FIRST(A) ∪ {a} and P = P - {A - a} else if α = ε then ------------------------------------ [2]