An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals.

Wikipedia

After entering the required data, click on the "Create now!" button and follow the commands below

Supported grammar :

- letters from 'A' to 'T' : Draw a line
- letters from 'a' to 't' : Move without drawing a line
- + : Turn left
- - : Turn right
- | : Turn around
- [ : Save state (position and direction)
- ] : Restore last saved state