In the tools that I now work with that have been developed over many years, there are regexes that can be rather abstruse. Going through them with a /x can help. I have run across some regexes that are either recursive or part of a circular definition. I am looking for insight on how to refactor them into non self referential forms so that they can work, and am hoping to become more enlightened on Regexes. I never had courses on these kind of topics, so I have a huge void to fill. I have a lot of the practical down. Now I would like to get a bit of the theoretical.
In reply to Re^2: Simplifying regexes
by ExReg
in thread Simplifying regexes
by ExReg
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |