This is an experiment about:
"How much conventional language/runtime machinery can be lowered onto an absurdly minimal computational machine?"
MyLittleLang is a typed language compiled to standard 8-bit-cell Brainfuck through a real pipeline:source → lexer → parser/AST → semantic/type analysis → feature analysis → tape layout/code generation → runtime dependency closure → Brainfuck.
The language currently has:
Brainfuck has a interrestng history and it is a language to show that a turing complete language does not need a complex set of mnemnonics or commands keywords and so on. Brainfuck is absolute minimalistic. My little Language shows that it is possible to compile a higher level language to Brainfuck that means Brainfuck has all components needed for computing in a way that a Turing Complete language can be compiled to Braifuck. My Little language is up to now not complete but it is nearly complete and I think it works correct. What I will do is to check the output with a well known BrainFuck Compiler / Interpreter. NOTE: Tests will be executed soon.
The target of project is to show that computer languages must not be high sophisticated that they can work. Of course a little set of orders is enough to build programs with a very high complexity.
As stated in the tests and in the README the language is now Turing Complete