Finite State Automata defining spell syntax.
The spells use only three different characters to be written, "╭" (which can represent "0"), "ʌ" (which can represent "1") and a validation symbol "ᴎ" that can represent ";". When writing spells, spaces, indentation and parenthesis can be added to make them more readable. Those do not modify the spell meaning as only the three characters precedently mentionned matter.
A fourth glyph "╰" can be placed to signify the begining of a spell too, so indentations are more logical, but this character do not add meaning to the spell either.
This automaton is nearly deterministic, with the exception of the validating "root" state, that can only go back on itself to exit the current loop (an ongoing while, the spell itself or a function definition for exemple). The spell also cannot validate before exiting every ongoing loop, and can only validate once every loop are exited. Otherwise, the rest of the states and their transitions are entirely deterministic.
A more detailed version of the FSA :
