Look at your favorite programming language and identify the little functional logic languages embedded in it (meaning: backtracking evaluation with unification to find unknowns). JavaScript, C#, and Java have one for regular expressions.
-
-
Consider: if(/[A-Z][A-Za-z]/.matches(x)).. with embedded regular expressions, versus if(x==a+b where a:[1]('A'..'Z'), b:[](('A'..'Z')+('a'..'z'))).. Granted the simple regex looks cleaner, but it scales and composes far worse.
-
I see parallel evolution + lazy programmer virtue combining to make a suboptimal but widely learned DSL in an outer imperative language. Unity of form would be nice, though.
End of conversation
New conversation -
-
-
It could be argued that the subset of regular expressions are actually regular expressions in the original meaning of the term, and that what are now called regulare expressions aren't actually regular expressions. Be that as it may, I'm happy with what's in awk.
-
I mean, I like awk and grep REs because they are clean and easy to understand, and based on a consistent theory. All this new stuff since Perl just seems like a random bunch of stuff based on what a few random people found useful at one point or another.
- 3 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.