With backtracking and/or packratting, any parse engine for any subset of context-free can be extended to context-free.
One problem I've had in promoting Marpa, is that veteran watchers of the field have seen "revolutionary new parsers" announced every few years. These have often been "X with backtracking/packratting", where X could be any parse engine. The experts learned they could get away with not bothering to investigate claims of new developments. On Mon, Jan 11, 2016 at 10:34 PM, Anton Dyudin <[email protected]> wrote: > Regular expressions as in no recursion? The grammar > S = S ( S ) ∪ ε > is mentioned specifically as a context-free example, and how it > necessitates laziness + memorization. > > -- > 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. > -- 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.
