|Question about Earley's algorithm firstname.lastname@example.org (Salvador V.Cavadini) (1999-06-29)|
|Re: Question about Earley's algorithm email@example.com (1999-07-01)|
|Re: Question about Earley's algorithm firstname.lastname@example.org (1999-07-05)|
|From:||email@example.com (Alan L Wendt)|
|Date:||1 Jul 1999 15:00:39 -0400|
|Organization:||EZLink Internet Access|
Salvador V.Cavadini (firstname.lastname@example.org) 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.
Return to the
Search the comp.compilers archives again.