An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar: en.wikipedia.org/wiki/l-system.
#fractal #lsystem #snowflake
Log in to post a comment.
// Global code will be evaluated once. const turtle = new Turtle(-80,-47); // l-system function createLSystem(numIters, axiom) { let s = axiom; for (let i=0; i<numIters; i++) { s = processString(s); } return s; } function processString(oldStr) { let newstr = ""; for (let i=0; i<oldStr.length; i++) { newstr += applyRules(oldStr[i]); } return newstr; } function applyRules(ch) { switch (ch) { case "F": return "F-F++F-F"; // # Rule 1 default: return ch; } } const inst = createLSystem(5, "F++F++F"); // number of iterations and axiom const distance = 2/3; const angle = 60; // The walk function will be called until it returns false. function walk(i) { const cmd = inst[i]; switch (cmd) { case "F": turtle.forward(distance); break; case "B": turtle.backward(distance); break; case "+": turtle.right(angle); break; case "-": turtle.left(angle); break; default: } return i < inst.length - 1; }