Yes, you are right that the parser grammars are much like PEGs and it's the code generator grammars that match other objects than characters. The reason I chose to implement it that way in the article is that I modeled…
As far as I know, PEGs work only on streams of characters. RLMeta works on streams of arbitrary Python objects. The syntax currently has support for matching characters, strings, and lists. Does that clarify it?
Yes, you are right that the parser grammars are much like PEGs and it's the code generator grammars that match other objects than characters. The reason I chose to implement it that way in the article is that I modeled…
As far as I know, PEGs work only on streams of characters. RLMeta works on streams of arbitrary Python objects. The syntax currently has support for matching characters, strings, and lists. Does that clarify it?