Thanks for repeating your reply to the group. I have two follow-up questions inline below:
On Sunday, September 24, 2017 at 5:19:44 PM UTC-7, Jeffrey Kegler wrote: > > In addition to AH, a few papers have described ways to reduce the number > of Earley items, but these focus on taking things as far as the recognizer > -- they produce the Earley tables and stop. Often the question of the cost > of undoing the compression at evaluation time is not addressed, and the > cost of the more complex evaluation phase seems likely to eliminate any > speed-up in the recognizer. > I'd be interested in which papers you're referring to as having described ways to reduce the number of Earley items. Would you list a few? > I want to point out that in that same paper, Aycock and Horspool, as a > side issue, describe a way of handling nulled symbols and productions via > grammar rewrites. > To clarify, are you referring to "Practical Earley Parsing", section 8 "Reconstructing Derivations" [1]? [1]: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.4254 -- You received this message because you are subscribed to the Google Groups "marpa parser" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
