We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
CLEAR
| Designed by | MY mind |
|---|---|
| Appeared in | 2026 |
| Computational class | Imperative, Turing complete |
| Reference implementation | Unimplemented |
CLEAR (an acronym for C Like Engineered Accent Language, also known as Wordless Control Flow Language or WCFL) is an esoteric programming language designed to explore imperative computation without textual keywords.
While traditional imperative languages rely on control words like if, else, while CLEAR replaces all language keywords with an accent constructed entirely of punctuation operators, status evaluation tokens, and data-flow pipelines.
Design Philosophy
CLEAR was created as an experiment in syntax minimization: can a fully functional register-based language operate without any reserved English keywords?
Rather than inventing an entirely new execution paradigm (such as a 2D instruction grid or a data stack), CLEAR maintains a familiar imperative layout—variables, sequential execution, memory scoping, and conditional branching—but strips away traditional keyword abstractions. Every operation, evaluation, and storage binding is instead driven by symbolic links and stream pipes.
Computational Model
CLEAR operates on a typeless, register-based memory model with explicit data streaming.
Registers and Quoted Identifiers
Data is stored inside named registers rather than pushed onto an implicit execution stack. Register names are enclosed within quotation marks, which allows identifiers to contain spaces. Registers (also referred to as variables) can hold numeric values or bare text, depending on the context in which they are accessed.
Symbolic Control Flow
Control flow in CLEAR uses non-keyword conditional pattern matching. Instead of evaluating a statement using boolean keywords (status tokens such as true or false act as evaluation expectations rather than traditional keywords), expressions are evaluated against status tokens. Branching is handled through fallthrough stream pipes, allowing execution to cascade through alternate paths without needing explicit branch keywords.
Memory Buckets
To prevent scope collisions in larger programs, registers can be isolated inside distinct namespaces called memory buckets. Buckets act as isolated storage compartments, allowing different modules or procedural units to maintain independent variable spaces.
Execution Triggers and Pipelines
The lifecycle of every operation in CLEAR is governed by three primary mechanics:
- Execution Trigger: A dedicated punctuation symbol '*' acts as the universal line and scope terminator, signaling to the parser that a unit of computation is complete and ready to execute.
- Streaming Pipes: Data and execution paths are moved using forward stream pipes '/>'. These pipes route the result of an evaluation directly into a target register or pass execution downstream to a fallback branch.
- Synchronous Coupling: A linking operator '-' binds dependent structures—such as tying a register assignment directly to a memory bucket—ensuring they resolve as a single unit.
Computational Expressiveness
CLEAR is designed to be Turing-complete. Through its combination of register storage, fallthrough conditional branching, user input capture, and postfix looping mechanics, it can express any algorithm printable by a standard imperative language.