Problem 3 (Parsing)
-------------------

To make your life easier, the parser can stop after seeing the first
valid BE (the skeleton provided does it this way).  As a consequence,
invalid BEs such as `T & F' will return `true', since the `& F' part
is ignored.  This is perfectly fine behavior.


Problem 7 (Running Time)
------------------------

Mea culpa!  We accidently distributed a buggy binary search routine
with RunTime2.java (and RunTime.java) that produced these infamous
`0 msecs' results.  So, as in real life, we are happy to ship the
all-new improved RunTime3.java version, and all users are encouraged to
upgrade.  Versions 2 and 3 differ only in the binary search routine, so
you do not have to redo the other experiments (and again my apologies
if you already got incorrect results for `bin').

In Code Warrior you can increase the amount of available memory by
selecting `Target Settings', then `Target', then `x86 Target' and
changing `Reserved Heap Size' according to taste.  An integer takes 4
bytes of memory, so if you want to process one million integers you'll
need _at least_ 4 MB for linear search and even more for the other
algorithms.

NB. I found the setting but wasn't able to run RunTime3 in Code
Warrior (talk about an intuitive user interface!).  Don't spend too
much time fiddling with the guts of the compiler; if you can't make it
work, just use the largest possible array, even if you still get
dubious results.


Older Errata
------------

See previous announcement.