Exalted ones:
I have been attempting to get a firm grasp on the ins and outs of simplifying regular expressions. I have come to some conclusions on my own, but am wondering if there is some font of wisdom I can tap into on my way to the path of regex enlightenment.
My latest discovery was the list of pages that I Googled for "regular expression algebraic laws"https://www.google.com/search?q=regular+experession+algebra&sourceid=ie7&rls=com.microsoft:en-US:IE-Address&ie=&oe=&safe=active&gws_rd=ssl#safe=active&q=regular+expression+algebraic+laws. When these talk about Regular Expressions, are they talking about the exact same type of Regexes that we spend so much time talking about?
It would appear that the laws that they mention in these pages would apply to the Regexes we so dearly love, with some caveats or questions:
The Commutative Law would need a slight modification. They say L+M=M+L, or LUM=MUL, or L|M=M|L. This would almost be true the way we handle things except for the left-most, longest rule.
Not having had a course in Regular Expressions or Finite Automata or such, what does ɛ correspond to in our usage? I assume that Ø means empty set or no results.
Are there some scrolls somewhere that I may read to become enlightened? Some website of wonderful wisdom?
Many thanks
In reply to Simplifying regexes by ExReg
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |