Related articles |
---|
[8 earlier articles] |
Re: .NET Compiler for Interactive Fiction marcov@toad.stack.nl (Marco van de Voort) (2003-03-14) |
Re: .NET Compiler for Interactive Fiction tbandrow@unitedsoftworks.com (2003-03-16) |
Re: .NET Compiler for Interactive Fiction tbandrow@unitedsoftworks.com (2003-03-16) |
Re: .NET Compiler for Interactive Fiction lex@cc.gatech.edu (Lex Spoon) (2003-03-17) |
Re: .NET Compiler for Interactive Fiction david.cornelson@iflibrary.com (David A. Cornelson) (2003-03-17) |
Re: .NET Compiler for Interactive Fiction JeffKenton@attbi.com (Jeff Kenton) (2003-04-05) |
Re: .NET Compiler for Interactive Fiction joachim_d@gmx.de (Joachim Durchholz) (2003-04-13) |
Re: parsing, was .NET Compiler for Interactive Fiction rpboland@math.uwaterloo.ca (Ralph P. Boland) (2003-04-15) |
Re: parsing, was .NET Compiler for Interactive Fiction cfc@TheWorld.com (Chris F Clark) (2003-04-15) |
Re: parsing, was .NET Compiler for Interactive Fiction joachim_d@gmx.de (Joachim Durchholz) (2003-04-20) |
Re: parsing, was .NET Compiler for Interactive Fiction bobduff@shell01.TheWorld.com (Robert A Duff) (2003-04-20) |
Re: parsing, was .NET Compiler for Interactive Fiction bobduff@shell01.TheWorld.com (Robert A Duff) (2003-04-27) |
Re: parsing, was .NET Compiler for Interactive Fiction rpboland@math.uwaterloo.ca (Ralph P. Boland) (2003-04-27) |
[12 later articles] |
From: | Joachim Durchholz <joachim_d@gmx.de> |
Newsgroups: | comp.compilers |
Date: | 13 Apr 2003 12:17:49 -0400 |
Organization: | Compilers Central |
References: | 03-02-125 03-02-147 03-03-043 03-03-061 03-03-103 03-04-006 |
Keywords: | parse |
Posted-Date: | 13 Apr 2003 12:17:48 EDT |
John wrote:
> [Parsing has indeed been well studied. The main changes in recent
> years is that algorithms that used to be considered too slow for
> production use aren't any more. -John]
Well, Kannapinn's recent work is still a noticeable improvement in LR
parsing, so there *is* progress in this area. But I agree that things
have come to a near-standstill, problems are either solved or
known/assumed to be unsolvable. Research has moved on to other topics.
Regards,
Joachim
--
Currently looking for a new job.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.