|Table-driven Parser firstname.lastname@example.org (Cobus Kruger) (2005-09-30)|
|Re: Table-driven Parser email@example.com (Paul Mann) (2005-10-02)|
|Re: Table-driven Parser firstname.lastname@example.org (Dmitry A. Kazakov) (2005-10-02)|
|Re: Table-driven Parser Meyer-Eltz@t-online.de (Detlef Meyer-Eltz) (2005-10-02)|
|Re: Table-driven Parser DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2005-10-02)|
|From:||"Dmitry A. Kazakov" <email@example.com>|
|Date:||2 Oct 2005 02:51:20 -0400|
|Organization:||cbb software GmbH|
On 30 Sep 2005 02:04:52 -0400, Cobus Kruger wrote:
> Does any of you have knowledge or experience of these kinds of parsers?
I am using them. See:
Parsing is controlled by a set of tables and no grammar is explicitly
specified. Also recursive descent parser can be easily built this way.
Producing good error messages is quite easy. Then it well fits into OO
approach, which is itself is a kind of "table-driven."
An obvious drawback, though, is that you don't have a written grammar to
validate and do other nice things you could do with it. Or if you have one,
you cannot easily figure out if it the grammar your parser recognizes.
Dmitry A. Kazakov
Return to the
Search the comp.compilers archives again.