L-Systems

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:

• Axiom: The initial state of the system.
• Rules: An object in JSON form that represents the replacement rules for each of the symbols.
• Terminal rules: An object in JSON form that represents the graphical behavior that happens when the number of iterations is reached. Available rules are:
  • MOV (NUM): Draws from the current line on the current angle (NUM) points. e.g. MOV 1
  • PUT (NUM): Moves the current line on the current angle (NUM) points without drawing a line. e.g. PUT 1
  • ROT (NUM): Rotates the current heading by (NUM) degrees. e.g. ROT 90
  • MULT (NUM): Multiplies future movements by (NUM). e.g. MULT 2.5
  • PUSH: Pushes the current state (position, angle, color) to the stack.
  • POP: Pops the last stored state from the stack.
  • COL (COLOR): Sets the color for future strokes to (COLOR), where (COLOR) is a hex color. e.g. COL #FF0000 for a red line.
• Iterations: The number of times to expand the axiom using the rules.

Link to this render

Final string:

Suggested settings: