Assess students' ability to design a simplified compiler for a Python subset (variables, arithmetic, conditionals, loops, and functions). Require clear token definitions, a concrete grammar and parsing strategy, AST and symbol-table design, and semantic checks (scope, name resolution, basic type consistency). Specify the three-address intermediate representation format, show generation rules for statements and expressions, and implement two basic optimizations: constant folding and dead-code elimination. Provide 2–3 sample input programs and show both the unoptimized and optimized generated IR with brief explanations of applied transformations.