For patterns to be faster I used the method created by mathjp for Julia sets http://scratch.mit.edu/projects/mathjp/1477506 , but with a different compression program suitable for L-System, that I maked to compress each list in two lists (previous projects in Scratch) Not all L-System rules are good for compression. All four examples are faster than uncompressed, and example 2 would not work in Scratch without compression due to length of initial list (13008!). Thanks to mathjp. Choose an example and click the green flag Music: short excerpts from Strauss
