I cant believe its n's Journal: HiLexed 2.0 comming along

HiLexed 2.0 may not be ready for the spotlight yet for a while, but I recently made a breakthough regarding the look-ahead. I can now predict very efficiently how HiLexed should parse segments and now have this baby doing left-recursion because of it. 10000 fully deterministic (and correct) predictions for java class body content in only 190ms. As most of the lower level parsing is deterministic to begin with, using reserved keywords = zero look-ahead, focus is on class-body and compound expressions. There is still one major and really complex algorithm that I need to get working in order for the 2.0 parser to run without having to send someone along each time a customer starts working on a new language.

The major problem is that as it stands now, the parser may have to go through a really large number of cases one time during "grammar-compilation" instead of as is common with other parsers, during each parse. Still, I feel (and have some ideas) that there must be a more efficient way of limiting the search without human intervention, and will be quite happy once found.