Top-down Parsing (ASU Ch 4.4) Predictive Parsers (ASU 4.4 ...

Follow: example (ASU Ch 4.4)
E TE’
E’ +TE’ | ¤
T FT’
T’ *FT’ | ¤
F (E) | id
first(E) = { (, id }
first (E’) = { +, ¤ }
first(T) = { (, id }
first (T’) = { *, ¤ }
first(F) = { (, id }
follow(E) = { ), $ } F (E) and E is S
follow(E’) = { ), $ } E TE’; rule A aB & f(E’) += f(E)
follow(T) = { +, ), $ } E’+TE’|¤ f(T) += f(E’); ETE’ f(T) +=first(E’) -¤
follow(T’) = { +, ), $ } TFT’ & rule AaB f(T’) += f(T)
follow(F) = { +, *, ), $ } TFT’ f(F) += f(T); T’*FT’ f(F) += first(T’) -¤
12
14/10/2014 DFR - CC - TDP