For the first comment, I can see both sides equally. If the two suboptimal regexes are equivalent, then it should find two optimal regexes for each, since I figure this is a machine where I put one input in and get one output out. But if these two inputs are equivalent, then there should be a single "most optimal" regex and if there is a difference in the results from putting r1 and r2, then either one isn't fully optimized since there is a single "most optimal", or my argument has a flaw since I assume that there exists a "most optimal" state.
Admittedly, some time has passed since I was knee deep in language theory, so I may have missed some very critical points that cause a regex optimizer to fail. So, here's a question: If heuristics are employed in the development of this machine (and mind you at this point, the REO is going to remain purely theoretical), does it doom the optimization from the point at which a heuristic is employed? Does this machine require that it can only operate on the input regex with algorithmic manipulations?
And finally, for the second point, that just rules out the ability to do the problem within a certain context. ALL HAIL BRAK!!!
In reply to RE: RE: Regular Expression Optimizer
by PsychoSpunk
in thread Regular Expression Optimizer
by PsychoSpunk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |