The Bad programming language
BadLang is an experimental programming language. It has underwent a number of iterations, from a tree-walking interpreter, to a stack based bytecode interpreter, to natively compiled to ASM/machine code. A series of articles follow the developemnt of the language since its inception. Parts 0 to 6 cover the implementation of the tree-walking interpreter.
The current in-progress implementation follows a more structured approach to its design, the rationale to which can be found in part 7. In summary, the language sheds some of the conventions followed by Lisps and attempts to become a statically typed, ahead of time compiled language with an optimizing compiler. Also, there is support for serializing a bunch of the internal data structures so that they can be visualized via graphviz.
Currently there is a functioning compiler from bad -> C and an advanced work in progress implementation of a self-hosted compiler.
BDL Articles
- 2021-10-11 :: BDL: A Scheme inspired programming language - Part 0
- 2021-10-12 :: BDL: Part 1 (Lexing and error handling)
- 2021-10-13 :: BDL: Part 2 (Object types and parsing)
- 2021-10-14 :: BDL: Part 3 (Evaluation and environments)
- 2021-10-15 :: BDL: Part 4 (Lambdas and closures)
- 2021-10-17 :: BDL: Part 5 (Garbage collection and tail-call optimizations)
- 2021-10-21 :: BDL: Part 6 (Dynamic arrays and hash tables)
- 2022-01-31 :: BDL: Part 7 (Designing a language)
- 2022-04-19 :: BDL: Part 8 (A simple type system)
- 2022-04-22 :: BDL: Part 9 (Designing an intermediate assembly language)