The grammar definitions in the article looked very similar to PEG at the first glance. And the article seems to confirm, “The parsing algorithm that RLMeta implements is based on parsing expression grammars (PEG), but is extended to match arbitrary objects, not just characters.”
I didn’t quite get the “match arbitrary objects” bit... Is this basically the same technique as PEG or what am I missing?
I didn’t quite get the “match arbitrary objects” bit... Is this basically the same technique as PEG or what am I missing?