My intention is not to spam this low-volume group. There are discussions taking place about next-generation parsing for Python, one of the mainstream programming languages of our time, and I'm summoning the expertise I have access to.
https://discuss.python.org/t/preparing-for-new-python-parsing/ It should be provable that PEG memoization is O(Output) for a language known to be LL(1). It should be the same for runtime complexity. Are there any papers that settle this? Thanks in advance, -- Juancarlo *Añez*
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
