Re: Question about Earley's algorithm

alan@ez0.ezlink.com (Alan L Wendt)
1 Jul 1999 15:00:39 -0400

          From comp.compilers
Related articles
Question about Earley's algorithm scavadini@hotmail.com (Salvador V.Cavadini) (1999-06-29)
Re: Question about Earley's algorithm alan@ez0.ezlink.com (1999-07-01)
Re: Question about Earley's algorithm friwi@prosun.first.gmd.de (1999-07-05)
| List of all articles for this month |
From: alan@ez0.ezlink.com (Alan L Wendt)
Newsgroups: comp.compilers
Date: 1 Jul 1999 15:00:39 -0400
Organization: EZLink Internet Access
References: 99-06-113
Keywords: parse

Salvador V.Cavadini (scavadini@hotmail.com) wrote:


: How does Earley's algorithm work with the following grammar?


: D -> D
: D -> id


You'll get one parse state that contains a link to itself,


                    D -> .D
                    D -> .id


Note that Earley's algorithm does not return parse trees.
If it did, it could not run in cubed time.


Alan Wendt

Post a followup to this message

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