Assess students' ability to design and implement a small interpreted programming language: specify a lexer and parser grammar, define AST node types, choose an evaluation strategy (e.g., eager vs lazy), implement an interpreter supporting variables, arithmetic and boolean expressions, if and while control flow, first-class functions with recursion and closures, and provide test programs demonstrating correctness and scope/closure behavior.