L-System Drawing Machine
A project that produces Lindenmayer system (L-System) visualizations through generative grammars. L-Systems can generate plant-like fractal morphologies through recursive geometry. The implementation in a functional language like Haskell is quite elegant.
In the fall of 2018 I wanted to re-orient my self with Haskell, a purely functional, lazy-evalutation programming language that was part of University of Chicago’s Honors Introduction to Computer science sequence. I had always been interested in formal languages and context-free grammars, and I had briefly heard about L-Systems, a type of context-free grammar that was used to model some biological systems, including algae and plant growth. I decided to implement an L-System package in Haskell as a combination of these interests.
