| 
									
										
										
										
											2013-11-10 12:01:23 +00:00
										 |  |  | /*
 | 
					
						
							|  |  |  | ** Just Some Ideas: | 
					
						
							|  |  |  | ** | 
					
						
							|  |  |  | **  - Predictive Optimisation. Check all first character of all possible roots. If no conflict then predictive. | 
					
						
							| 
									
										
										
										
											2013-11-11 16:56:20 +00:00
										 |  |  | **  - Or Optimisation. Check if any terminal parsers are _ored_ together. If so condence into single large range. | 
					
						
							|  |  |  | **  - And Optimisation. Check if any terminal parsers are _anded_ together. If so condence into single large string. | 
					
						
							| 
									
										
										
										
											2013-11-10 12:01:23 +00:00
										 |  |  | **  - 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. | 
					
						
							| 
									
										
										
										
											2013-11-10 14:17:32 +00:00
										 |  |  | **  - Or Fail Removal. | 
					
						
							| 
									
										
										
										
											2013-11-10 12:01:23 +00:00
										 |  |  | ** | 
					
						
							|  |  |  | */ |