L-systems
Created May 18, 2019
Last updated May 21, 2019
Published May 19, 2019
L-systems (or Lindenmayer-systems) are replacement systems based on strings. Rules apply, according to which letters (initiators) are replaced by letters or letter sequences (generators). Turtle actions are assigned to the letters: F forward (and draw line), G (go without drawing)+ turn to the left, - turn to the right, [ (push stack), ] (pull stack). This can ideally be implemented in Snap! lists.
