Re: Table-driven Parser

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
2 Oct 2005 02:51:20 -0400

          From comp.compilers

Related articles
Table-driven Parser spamwontwork@kplanet.co.za (Cobus Kruger) (2005-09-30)
Re: Table-driven Parser paul@parsetec.com (Paul Mann) (2005-10-02)
Re: Table-driven Parser mailbox@dmitry-kazakov.de (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)
| List of all articles for this month |

From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.compilers
Date: 2 Oct 2005 02:51:20 -0400
Organization: cbb software GmbH
References: 05-09-142
Keywords: parse

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:


http://www.dmitry-kazakov.de/ada/components.htm#Parsers_etc


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.


--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.