From: mips@cyberspace.org   
      
   Hello everybody,   
      
   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   
   generated parser.   
      
   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,   
   Damien   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)