Re: Ambiguous recursive-descent parsing

gopi@sankhya.com (Gopi Bulusu)
27 Apr 2003 02:20:51 -0400

          From comp.compilers
Related articles
Ambiguous recursive-descent parsing stodghil@cs.cornell.edu (Paul Stodghill) (2003-03-24)
Re: Ambiguous recursive-descent parsing cfc@world.std.com (Chris F Clark) (2003-03-30)
Re: Ambiguous recursive-descent parsing rivers@dignus.com (Thomas David Rivers) (2003-03-30)
Re: Ambiguous recursive-descent parsing slk14@earthlink.net (SLK Parsers) (2003-03-30)
Re: Ambiguous recursive-descent parsing oliver@zeigermann.de (Oliver Zeigermann) (2003-04-13)
Re: Ambiguous recursive-descent parsing gopi@sankhya.com (2003-04-27)
| List of all articles for this month |
From: gopi@sankhya.com (Gopi Bulusu)
Newsgroups: comp.compilers
Date: 27 Apr 2003 02:20:51 -0400
Organization: http://groups.google.com/
References: 03-03-148
Keywords: parse, LL(1)
Posted-Date: 27 Apr 2003 02:20:51 EDT

We are building a dynamic model driven parsing and translation
framework
called SANKHYA Translation Framework (STF).


        http://www.sankhya.com/info/products/data/stf.html


STF translators can pursue multiple (all) paths and pick the best
match. Although, simple ordering of alternate STML "Model Elements"
often provides a lot more efficient handling of potential ambiguities.


Regards,
gopi


---


Gopi Kumar Bulusu
Sankhya Technologies Private Limited
http://www.sankhya.com
Tel: +91 44 2822 7358
Fax: +91 44 2822 7357


Paul Stodghill <stodghil@cs.cornell.edu> wrote
> Could someone point me to a good survey of work that has been done on
> recusive-descent parsing that deals with ambiguities in the language?
> I have some ideas for how Tomita-style techniques for managing
> multiple parse "states" can be combined with LL(1) parsing to easily
> parse languages like C++, but I want to make sure that I am not
> re-inventing the wheel.

Post a followup to this message

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