Skip to content

Latest commit

 

History

History
27 lines (19 loc) · 1004 Bytes

README.md

File metadata and controls

27 lines (19 loc) · 1004 Bytes

L-systems in Haskell

Relatively advanced L-system library written in Haskell. Out of the box it supports symbols with parameters, conditional rewriting, and it can evaluate expressions with binary and unary operators. There are two available L-system interpreters: text and SVG vector graphics. The code is well commented and written with extensibility in mind. It is easy to add new operators, new interpreters, or even extend the grammar. This project was my final program of Non-procedural programming class.

Author: Marek Fiser < [email protected] >

Project page: http://www.marekfiser.com/Projects/Lsystems-in-Haskell

License: Public domain, see LICENSE.txt for details.

Features

  • L-system interpreter with support for conditional rewrite rules.
  • Full support for expressiong with binary and unary operators.
    • The cool unary operator is √.
  • Two types of interpreters: text and SVG vector graphics.
  • Wel commented and extensible.