[BusyBox] Today's ash improvements

[Vladimir N. Oleynik]

Aaron,

> > This optimization takes into account, that position and quantity tokens will not
> > change.
> > Look my variant. In the sum we receive a prize in 300 bytes without loss of an
> > opportunity
> > to correct the tokens table.
> 
> I like your version. It makes things much cleaner.
> 
> But I have a better idea.
> 
> How about we reorder the tokens so that the ones that can "end a list"
> come first? Then we can just check if the token is <= the last token
> that ends a list (which would be a #define). Do you like it?

Unfortunately, it to make it is impossible. Lineo mantainers very much love 
function bsearch ;-), and it will not give to make such optimization. 
Look attentively.


--w
vodz