I completed the implementation of the new call syntax.

The syntax is documented on the wiki page on a level that should be
understandable for a user that is already familiar with Fast Downward.

One thing that is still to do is reintegrating the iterative search. I split
this off to issue105.

I was not sure whether I should set the status of this issue to "resolved" or to
"done-cbb" because there is one thing that still could be improved:
Specifying a parser for a new heuristic/search/open list/... is currently done
on a very low level but more abstract level would be much more convenient (and
probably more readable). I split this off as a wish to issue104.

I hereby declare this issue resolved.

This may require moving the anytime search out of the main loop first. Erez, can
you tell Gabi when this is done? If there is an issue on that, it'd be good to
cross-reference it from here.

The planner should be called with a more readable (and more flexible) call syntax.

For example,
./search lazy(alt(use_preferred=true, ff, lama(lm-gen=zg)))
would call lazy best first search with an alternation open list
that alternates between the ff heuristic and the lama heuristic
(with some option lm-gen=zg) and uses additional queues for the 
preferred operators.