|LL(1) Grammar for Expressions with Assignment firstname.lastname@example.org (1995-06-27)|
|Re: LL(1) Grammar for Expressions with Assignment email@example.com (1995-06-30)|
|Re: LL(1) Grammar for Expressions with Assignment firstname.lastname@example.org (1995-07-01)|
|From:||email@example.com (Terence John Parr)|
|Organization:||Parr Research Corporation|
|Date:||Sat, 1 Jul 1995 16:55:53 GMT|
Seth Bergmann (firstname.lastname@example.org) wrote:
: I've been trying to find an LL(1) grammar for the language of
: expressions such as:
: but excluded would be things like:
: 3+a=4 and 2 = a
: analysis. I suspect this language of expressions is not LL(1).
I believe that it is non-LL(k) for any finite k; for example,
I can write this
(((((((((((3+a))))))))))) = 4
You would never be able to see past the '('s with finite lookahead.
I believe a semantic analysis of the resulting AST would be the best
I suspect that any grammar that could describe this lvalue problem
(purely) syntactically would be very very large.
Return to the
Search the comp.compilers archives again.