RLMeta
RLMeta is a programming language in which you write grammars. Grammars have rules that specify how to match objects from an input stream and specify what should happen when objects are matched. It can be used to write lexers, parsers, tree transformers, code generators, and similar tools. The RLMeta compiler is implemented in RLMeta itself which makes it a metacompiler.
There are multiple versions of RLMeta that all live in blog posts.
Related posts
- RLMeta poster 2: the poster that wasn't - 12 February 2022
- Creating the RLMeta poster - 24 May 2020
- DRAFT: Compiling expressions to x86 machine code - 20 May 2020
- DRAFT: Porting RLMeta to C++ - 10 April 2020
- Memoizing failures in RLMeta - 11 January 2020
- Parsing left associative operators using RLMeta - 7 September 2019
- RLMeta: a VM based approach - 6 August 2019
- Optimizing RLMeta - 28 June 2019
- DRAFT: Parsing off-side rule languages with RLMeta - 27 June 2019
- Modifying the RLMeta metacompiler - 28 May 2019
- A meta approach to implementing programming languages - 2 December 2018
Site proudly generated by Hakyll.