# T.2. Interpreters, Coroutines

In this set, there are 2 interpreters of simple languages – one with
recursion and closures, another with explicit pointers and garbage
collection. The third task is focused on the use of semi-coroutines
(generators).

 1. ‹rec› – recursive programs
 2. ‹ptr› – pointers and garbage collection
 3. ‹rst› – real-time splay trees