11 lines
565 B
C
11 lines
565 B
C
/*
|
|
** Just Some Ideas:
|
|
**
|
|
** - Predictive Optimisation. Check all first character of all possible roots. If no conflict then predictive.
|
|
** - Or Optimisation. Check if any terminal parses are _ored_ together. If so condence into single large range.
|
|
** - Not Optimisation. Similar to the above. Convert _nots_ into positive cases by inverting full range of characters.
|
|
** - Also Optimisation. Two Character parsers together can be condensed to a single string parser.
|
|
** - Lookup Optimisation. Finite State Machine Parser.
|
|
** - Or Fail Removal.
|
|
**
|
|
*/ |