Re: Other General Parsing Algos like Earley's

mefrill@yandex.ru (Vladimir)
9 May 2004 22:26:32 -0400

          From comp.compilers
Related articles
Other General Parsing Algos like Earley's push189@yahoo.com (2004-05-08)
Re: Other General Parsing Algos like Earley's mefrill@yandex.ru (2004-05-09)
Re: Other General Parsing Algos like Earley's wyrmwif@tsoft.com (SM Ryan) (2004-05-16)
Re: Other General Parsing Algos like Earley's martin@cs.uu.nl (Martin Bravenboer) (2004-05-16)
| List of all articles for this month |
From: mefrill@yandex.ru (Vladimir)
Newsgroups: comp.compilers
Date: 9 May 2004 22:26:32 -0400
Organization: http://groups.google.com
References: 04-05-027
Keywords: parse
Posted-Date: 09 May 2004 22:26:32 EDT

Recent modification of Tomita's algorithm allows to parse languages
defined by any CFG. You can find more information about this in
"Tomita-Style Generalised LR Parsers". The article is avalable online
use google to find this.
Cocke-Yanger-Kasami algorithm can parser grammar in normmal Chomsky
form. It is known that any CFG can be tranformed to Chomsky form.
Thus, the algorithm allows to parser any CFG as well.


Vlad.

Post a followup to this message

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