https://dokuwiki.grogra.de/ 2026-05-16T11:08:10+00:00 https://dokuwiki.grogra.de/ https://dokuwiki.grogra.de/lib/exe/fetch.php?media=wiki:dokuwiki.svg text/html 2025-12-17T11:34:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:01_parallel_mode&rev=1765971288&do=diff PARALLEL_MODE The a true parallel derivation mode. All rules are applied via every possible match parallel. A single node may be deleted/replaced by several rule applications. This works similar to the interpretation of a D0L-System but in GroIMP it can be actually applied thanks to the graph representation. Assuming to apply a rule set: text/html 2025-12-17T11:40:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:02_parallel_non_deterministic_mode&rev=1765971648&do=diff PARALLEL_NON_DETERMINISTIC_MODE The parallel non-deterministic derivation mode ensures that a single node is deleted by at most one actual rule application. If several rule applications delete the same node, one actual application is chosen pseudo-randomly. text/html 2025-12-17T11:45:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:03_sequential_mode&rev=1765971908&do=diff SEQUENTIAL_MODE In this mode one rule application is performed in a single step. If several applications are possible, only the first one is chosen. One rule application means replacing one match. Assuming a rule A ==> B is applied on an axiom text/html 2025-12-17T14:56:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:04_sequential_non_deterministic_mode&rev=1765983413&do=diff SEQUENTIAL_NON_DETERMINISTIC_MODE In none deterministic sequential derivation mode only one rule application is performed in each step. If several applications are possible, one is chosen pseudo-randomly. Assuming a set of two rules A ==> B A ==> text/html 2025-12-17T14:59:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:05_interpretive_flag&rev=1765983586&do=diff INTERPRETIVE_FLAG A flag which indicates that rules have to be applied as interpretive rules. text/html 2025-12-17T15:00:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation:04_modes:08_exclude_deleted_flag&rev=1765983632&do=diff EXCLUDE_DELETED_FLAG Bit mask for the derivation mode which indicates that nodes which were already deleted by previous rule applications of the current derivation step shall be excluded from matches of the same step.