Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!news.musoftware.de!wum.musoftware.de!news.ripco.com!news.glorb.com!news2.glorb.com!news.glorb.com!news.mv.net!news.lightlink.com!news.iecc.com!nerds-end From: Alex Newsgroups: comp.compilers Subject: GLR state of the art? Date: Tue, 5 Apr 2011 10:41:09 -0700 (PDT) Organization: Compilers Central Lines: 7 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <11-04-005@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: gal.iecc.com 1302060610 1328 64.57.183.58 (6 Apr 2011 03:30:10 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Wed, 6 Apr 2011 03:30:10 +0000 (UTC) Keywords: parse, question, GLR Posted-Date: 05 Apr 2011 23:30:10 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: x330-a1.tempe.blueboxinc.net comp.compilers:72 I'm looking into technologies allowing to parse languages from arbitrary CF grammars. I know there are several approaches, Tomita parsing being one example. I don't however know what is the current opinion on various such technologies is. Is there, for example, something which is considered superior to Tomita parsing by all interesting measures?