it becomes a compiler - the parsed program is an executable closure - and over a neutral node-building algebra it emits a standard syntax tree. The grammar never changes; only the algebra does.
▪
The parser is tiny but recursive: the eight commands
>
<
+
-
.
,
[
]
are the only significant characters, every other character is a comment, and