[mpah]

This release includes a translator and and runtime framework to show that rules in the language machine can represent and evaluate expressions in the lambda calculus.

There is also an example which shows how associative arrays can be used to identify common stems, common subexpressions and the like.

Input can now be provided direct from the command line, and completed right-side recursion levels are now collapsed before new levels are started.

Various other bugs have been fixed.
_________________
The Language Machine - a toolkit for language and grammar