Olle Fredriksson

Yeah, that's been very tricky to get right, especially when you want to do semantic actions as well. This library uses the approach from the linked paper. But maybe it...

I don't know anything about this, but am also interested in knowing this. Can anything be done with the current interface? What would need to be added? Does anyone have...

Agreed, this would be nice to have. I will think about it some more, but I don't think it can be done easily given the current implementation. Especially now that...

If we're not able to do this we should update the documentation to make it clear that there are no guarantees about the order of the results.

I would prefer (1). Setting aside the complication that is the partitioning into nullables and non-nullables, I think you're on the right track. Continuations are added to a list at...

I think the ordering that we're (somewhat implicitly) talking about here is what we might call "left-to-right grammar order" (basically that the results from parsing `p` come before those of...

@sboosali: I pushed it [here](https://github.com/ollef/Earley/tree/OrderedResults). Feel free to play around with it. There may be bugs. @fread2281: Regarding totality: It's still up to the user of the library to force...

Just found out from Guillaum on #haskell that the tests on that branch are failing, so it might need some work still. :/

Yeah, epsilons are calculated separately to avoid loops in the more general parsing machinery. That's what the `ruleNulls` field contains.

Does [this branch](https://github.com/ollef/Earley/tree/OrderedResults2) work for you?