Incorrect LL Parsing Table Entries

[MammarDr]

I was working on my parser and wanted to validate my outputs but i may ended up finding a bug here, or.... my theory is just bad.

Grammar:

S: A B C;
A: a A |  /*eps*/ ;
B: b B | C d| /*eps*/ ;
C: c C | A e | /*eps*/ ;
D: S f | A D | g;

FIRST sets:
S = { a, b, c, d, e, ε }
A = { a, ε }
B = { a, b, c, d, e, ε }
C = { a, c, e, ε }
D = { a, b, c, d, e, f, g }

FOLLOW sets:
S = { $, f }
A = { a, b, c, d, e, f, g, $ }
B = { a, c, e, $, f }
C = { d, $, f }
D = {}

Wrong LL Parsing Table:

       a       b       c       d       e      f      g       $

S      1       1       1       1       1      -      -       -

S derives ε from First(ABC) so next it should be calculating Follow(S) ∈ {f, $}

Correct LL Parsing Table:

       a       b       c       d       e      f      g       $

S      1       1       1       1       1      1      -       1

[DmitrySoshnikov]

@MammarDr - thanks for the analysis, this indeed may be an incorrect calculation in your example, although the grammar may have conflicts, so I'm not sure how practical this bug is. In any case - I'll appreciate a PR with a fix on this. Thanks for spotting!

[MammarDr]

the grammar may have conflicts, so I'm not sure how practical this bug is.

That's true, but for educational purposes i think it worth fixing.

In any case - I'll appreciate a PR with a fix on this.

I'm planning to do that but I'm waiting for the approval of my first commit, can you check it out please ?