Back to Index


Lindenmayer systems (L-systems) are a way of iterating on a grammar with an initial state and set of rules. The way that I have implemented L-systems are a little bit different than any others that I've seen, and it may be disparate enough that it isn't an L-system at all anymore, but I think it's a more explicit way to express the grammar.

My implementation of the L-system is made up of the following values:

Link to this render

Final string:

Suggested settings:

PreviewAxiomRulesTerminal RulesIterationsLink