Language Model

The language is class-oriented and deliberately compact. A program is a list of classes. Classes own global definitions, functions, and a constructor. Function bodies then contain definitions, reassignment, control flow, return, break, instantiation, function calls, variables, and expressions.

The type vocabulary is intentionally small: numbers, strings, booleans, and object instances. The interpreter stays focused on scope, references, object allocation, and expression evaluation rather than a large standard library.

The language therefore sits between a calculator language and a production scripting language. It has enough structure to demonstrate object identity, method calls, mutation, loops, and nested references, but it avoids modules, inheritance, generics, arrays, closures, and asynchronous behavior. Those omissions keep the runtime state small enough to inspect directly.

• Classes and constructors provide object allocation and initialization.
• Functions, while loops, if/elif/else blocks, break, and return provide imperative control flow.
• Scoped member access supports object graphs such as linked lists and nested instances.
• Example programs cover FizzBuzz, cube-root iteration, linked lists, nested classes, references, and randomized experiments.