optimization of `repeat` yields 2-3% improvement in benchmarks, mainly because repeat is used to drive the benchmarks.
Optimizations to 'if' yields 1.5-2% performance improvement in tight loops on `if` such as the fibonacci test case.  Cleanup of old `repeat` code.
More minor performance improvements, with a significant 8% performance improvement from moving the token reversal from the quotation execution to the creation of the quotation in the parser.
Improve `list` primitive performance.  This improved fibonacci's performance by 6%.  This also generally improved benchmarks by about 3.8-4% due to the use of `list` in the benchmark process.
We don't try to compile already compiled quotations now.
Testcase suite now compiles the functions being tested.
By moving the token assignment when executing a quotation, into the context definition, we improve performance further by about 4-8%.
Benchmark results updated to reflect 26-52% performance improvement due to accumulated optimizations.