The question stems from the following URL
http://en.wikipedia.org/wiki/LL_parser
For the following grammar rules
1. S $B"*(B F
2. S $B"*(B ( S + F )
3. F $B"*(B 1
They have a parsing table for ( 1 + 1 ) that looks like
|( |) |1|+|$
__________
S| 2| -|1|-| -
___________
F|- |- |3|-| -
How do they arrive at this table? For example, they use first '(' from
the input stream. How do they know know to apply rule 2 and say not
rule 1?
