Fix a problem in the lexer: would not consider 0 (zero) as
a numerical constant, and the "count" interperter command
could not "reset" to not terminating after a given number of
reductions without a "count 0" command.
9 lines of code changed in:
Add T, M as built-ins: T x y -> y x, M x -> x x.
Lots of consequnces, including lexer changes, command-line
option changes, additions to node.h and graph.c
Add a "mudflap' target to makefile to try to use GNU libmudflap
for memory debugging.
Add a BTMK-basis bracket abstraction algorithm. Probably not in
its final form. Seems klunky.
252 lines of code changed in:
Add unit tests for T, M built-in primitives.
Change a few tests that used T as a non-built-in, either
a define or a non-primitive combinator.
24 lines of code changed in: