|parser table implementation and compression email@example.com (Damien Couderc) (2007-06-16)|
|Re: parser table implementation and compression firstname.lastname@example.org (Gene) (2007-06-16)|
|Re: parser table implementation and compression email@example.com (Larry Sonderling) (2007-06-22)|
|Re: parser table implementation and compression firstname.lastname@example.org (Gene) (2007-06-22)|
|From:||Damien Couderc <email@example.com>|
|Date:||Sat, 16 Jun 2007 11:58:43 +0200|
|Keywords:||parse, question, design, LL(1)|
|Posted-Date:||16 Jun 2007 10:21:26 EDT|
Thanks to your replies on my previous post i have been able to
bootstrap my lexer generator using lex and yacc.
Now i'm working on the LL parser generator and am being a bit stuck
with the structure of the parser table. I'd be glad if someone had
pointers on how to represent the production in the parse table. Of
course, i don't speak about the representation in memory which can be
handled by a linked list but more by how i can represent it in the
I've also read some people that talked about different ways of
compressing the parse table. The 2D model used in the dragon book is
simple but not usable for real world grammars. Any hints on this
subject too ?
Thanks for your help,
Return to the
Search the comp.compilers archives again.