# mw-parser A rule parser for MicroWorld ## Part of the overall Microworld system While this code works and is interesting on its own, you also need at least [https://github.com/simon-brooke/mw-engine](*mw-engine*) and [https://github.com/simon-brooke/mw-ui](*mw-ui*). There will be other modules in due course. ## Usage Main entry point is (parse-rule _string_), where string takes a form detailed in __[grammar](#grammar)__, below. If the rule is interpretted correctly the result will be the source code of a Clojure anonymous function; if the rule cannot be interpretted, an error 'I did not understand...' will be shown. The function (compile-rule _string_) is like parse-rule, except that it returns a compiled Clojure anonymous function. ### Generated function and evaluation environment The generated function is a function of two arguments + __cell__ a cell in a world as defined in mw-engine.world, q.v.; + __world__ the world of which that cell forms part. It returns a new cell, based on the cell passed. Actions of the rule will (can only) modify properties of the cell; there are two properties which are special and SHOULD NOT be modified, namely the properties __x__ and __y__. ### Execution Each time the world is transformed, exactly the same set of rules is applied to every cell. The rules are applied to the cell in turn, in the order in which they are written in the rule text, until the conditions of one of them match the cell. The actions of that rule are then used to transform the cell, and the rest of the rules are not applied. So, for example, if your first rule is if x is more than -1 then state should be new then no matter what your other rules are, your world will never change, because all cells have x more than -1. If you are having problems because one of your rules isn't working, look to see whether there is another rule above it which is 'blocking' it. ### Grammar #### Comments + Any line which starts with the hash character (#) is ignored; + Any line which starts with a semi-colon (;) is ignored. #### Rules A rule comprises: + if _conditions_ then _actions_ Each rule must be on a single line. There should be nothing else on that line. #### Conditions In rules, _conditions_ is one of: + _condition_ + _condition_ and _conditions_ + _condition_ or _conditions_ Note that 'and' takes precedence over or, so conditionA and conditionB or conditionC and conditionD is interpreted as (conditionA and (conditionB or (conditionC and conditionD))) A _condition_ is one of: + _property_ is _value_ + _property_ is not _value_ + _property_ is in _values_ + _property_ is not in _values_ + _property_ is more than _numeric-value_ + _property_ is less than _numeric-value_ + _number_ neighbours have _property_ equal to _value_ + _number_ neighbours have _property_ more than _numeric-value_ + _number_ neighbours have _property_ less than _numeric-value_ + more than _number_ neighbours have _property_ equal to _value_ + fewer than _number_ neighbours have _property_ equal to _value_ + some neighbours have _property_ equal to _value_ + more than _number_ neighbours have _property_ more than _numeric-value_ + fewer than _number_ neighbours have _property_ more than _numeric-value_ + some neighbours have _property_ more than _numeric-value_ + more than _number_ neighbours have _property_ less than _numeric-value_ + fewer than _number_ neighbours have _property_ less than _numeric-value_ + some neighbours have _property_ less than _numeric-value_ #### About neighbours Note that everywhere above I've used 'neighbours', you can use 'neighbours within _distance_', where _distance_ is a (small) positive integer. A cell has eight immediate neighbours - cells which actually touch it (except for cells on the edge of the map, which have fewer). If the cell we're interested in is the cell marked 'X' in the table below, its immediate neighbours are the ones marked '1'. But outside the ones marked '1', it has more distant neighbours - those marked '2' and '3' in the table, and still more outside those.
3 | 3 | 3 | 3 | 3 | 3 | 3 |
3 | 2 | 2 | 2 | 2 | 2 | 3 |
3 | 2 | 1 | 1 | 1 | 2 | 3 |
3 | 2 | 1 | X | 1 | 2 | 3 |
3 | 2 | 1 | 1 | 1 | 2 | 3 |
3 | 2 | 2 | 2 | 2 | 2 | 3 |
3 | 3 | 3 | 3 | 3 | 3 | 3 |