home bbs files messages ]

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,363 of 2,753   
   kamal to Thomas Chen   
   Re: LR(k) parser generator for k>1?   
   03 Jun 08 04:06:23   
   
   From: kamalpr@hp.com   
      
   On May 30, 9:26 am, "Thomas Chen"  wrote:   
      
   > That said, I'm very interested in this field and also very willing to   
   > exchange ideas with people. I would be most glad to be able to have   
   > more communication with you on various issues and possibilities of   
   > LR(k).   
      
   One way of doing look aheads is what is done in many commercial front-   
   ends. The lexer does a context-sensitive token matching and returns an   
   appropriate token thereby resolving ambiguities.  .  yacc/bison has a   
   facility to generate a re-entrant parser, so for specific constructs,   
   you could use specific rules and have a grammar for each. A C++   
   version is one that probably does this job better.   
      
   regards   
   -kamal   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca