A question about an LL parser
- From: Chad <cdalten@xxxxxxxxx>
- Date: Sat, 26 Apr 2008 15:53:08 -0700 (PDT)
The question comes from the following URL
http://en.wikipedia.org/wiki/LL_parser
They parse ( 1 + 1 ), using the following grammar rules.
1. S → F
2. S → ( S + F )
3. F → 1
On the first '(' from the input stream and from the 'S' stack, they
apply rule 2. How do they know it's rule 2 and say no rule 1?
.
- Prev by Date: Re: Tangent for 3D vectors
- Next by Date: A question about a LL parser
- Previous by thread: Tangent for 3D vectors
- Next by thread: A question about a LL parser
- Index(es):
