Forums before death by AOL, social media and spammers... "We can't have nice things"
| comp.compilers | Compiler construction, theory, etc. (Mod | 2,753 messages |
[ << oldest | < older | list | newer > | newest >> ]
| Message 1,323 of 2,753 |
| grocery_stocker to All |
| I don't see how they arrive at the parsi |
| 26 Apr 08 15:48:16 |
XPost: comp.theory
From: cdalten@gmail.com
The question stems from the following URL
http://en.wikipedia.org/wiki/LL_parser
For the following grammar rules
1. S → F
2. S → ( S + F )
3. F → 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?
--- SoupGate-Win32 v1.05
* Origin: you cannot sedate... all the things you hate (1:229/2)
|
(c) 1994, bbs@darkrealms.ca