LindenmayerSystem class abstract

An abstract representation of a Lindenmayer System, or L-System.

An L-System is a formal grammar, described by the following triplet:

G = {V, ω, P}

Where V is the system's alphabet, ω is the system's axiom and P is the system's production rule set.

In other words, an L-System is composed of three things:

• A list of String representing the system's alphabet.
• A String representing the system's starting point, or the axiom.
• A set of ProductionRule.

Because some Lindenmayer System types behave differently when it comes to rules (see DolSystem as an example), they are not present in this abstraction.

Implementers

• DolSystem

Constructors

LindenmayerSystem({required String axiom, required List<String> alphabet})

An abstract representation of a Lindenmayer System, or L-System.

Properties

alphabet → List<String>

The L-System's alphabet.

final

axiom → String

The L-System's axiom. Has to be made up of symbols in alphabet.

final

hashCode → int

The hash code for this object.

no setter, inherited

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

Methods

generate(int iterations) → String

How the L-System will generate its string output for a number of iterations.

generateAsStream(int iterations) → Stream<(String, int)>

How the L-System will generate its string output for a number of iterations.

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

toString() → String

A string representation of this object.

inherited

Operators

operator ==(Object other) → bool

The equality operator.

inherited