Assess students' ability to design and specify a simple statically-typed mini programming language: define concrete and abstract syntax, create a lexical specification and token set, write a context-free grammar (BNF) for expressions and statements (variables, functions, conditionals, basic types like int and bool), design an explicit static type system with typing rules and error cases, and outline a compiler front-end implementation (lexer, parser strategy such as recursive-descent or parser-generator, AST node definitions, and a type-checking pass). Include short example programs and show expected token streams, parse trees/ASTs, and type-check outcomes including reported errors.