Question about Earley's algorithm

"Salvador V.Cavadini" <scavadini@hotmail.com>
29 Jun 1999 03:02:54 -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: "Salvador V.Cavadini" <scavadini@hotmail.com>
Newsgroups: comp.compilers
Date: 29 Jun 1999 03:02:54 -0400
Organization: Compilers Central
Keywords: parse, question
X-Originating-IP: [200.41.145.42]

I know that given any CFG and a secuence of terminals (generated using
the CFG), Earley's general algorithm of syntactic analysis for CFGs
allways:


1) accepts the sequence
2) shows ALL the trees that can be built for that secuence with the
grammar.




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


D -> D
D -> id


Secuence of tokens: id


Thanks,
Salvador Cavadini
salvador@ucseii.edu.ar

Post a followup to this message

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