I'm studying top-down parsing, especially LL(1) parsing. However, I cannot understand what is the meaning of rules.
Example grammer is like this
S → ( S ) S | $\epsilon$
How can I derive like below table?
I read all explanations of textbook, but I cannot totally understand the process of table construction. Are there anyone who can explain more easily about this process?