Table of Contents
Growth grammars are a rule-based approach to the modelling of dynamic systems. In contrast to conventional imperative programming languages, rule-based approaches provide a natural and concise way of modelling: Most systems to be modeled behave according to a set of rules, and our perception works this way and not imperatively using a list of operations which have to be processed step by step.
Relational growths grammars (RGG) are part of the current research at the Chair for Practical Computer Science / Graphics Systems at the Brandenburg University of Technology Cottbus (Germany) and its cooperation partners. They are defined as a unification of L-systems and graph grammars. This user manual explains how relational growths grammars are used within GroIMP, more information about relational growth grammars can be found at the web page www.grogra.de, more information about the programming language XL, which is used within GroIMP as an implementation of the calculus of relational growth grammars, can be found in the XL language speficication.