[Sbp-users] Parsing Expression Grammar (PEG) vs. SBP

[Bernhard Damberger]

I am curious as to what you think about the current rage in the parsing world
with PEGs (and Packrat parsing)?

Caveat: I don't know much about SBP or the boolean grammars.

I know PEGs are linear (in both time and memory). I noticed that SBP is  O(n^3
log n) in time. How about in memory?

The thing about PEGs that interests me is their application with regards to
extensible langauges and DSLs. It sounds like SBP might be good for an
extensible language.

Any insight or comments appreciated.

_bernhard