rickardlindberg

4 ms·

1. 1.▲
   by rickardlindberg 8y ago

   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 RLMeta after OMe
2. 2.▲
   by rickardlindberg 8y ago

   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?
3. 3.▲
   A meta approach to implementing programming languages (2018)(rickardlindberg.me)

   134 points by rickardlindberg 8y ago|40 comments