> So you just need a trickier one. You need some kind of meta term like
> ``... count 192.67/16'', that will recursively expand it bit by bit,
> creating the obvious binary tree.

But if it's that regular you should be able to process this whole set of
rules in O(1), not even wasting space for a binary tree. So the question is:
is this just the first time or a corne case, not likeley to appear again?


Martin