Melody 0.19.0 | A language that compiles to regular expressions and aims to be more readable and maintainable
Melody 0.19.0 | A language that compiles to regular expressions and aims to be more readable and maintainable
Melody is a language that compiles to regular expressions and aims to be more easily readable and maintainable - GitHub - yoav-lavi/melody: Melody is a language that compiles to regular expressions...
Who is this for? People who write lots of regular expressions won't need it because they know what they're doing and people who don't write lots of regular expressions probably won't find it anyway.
It just seems like a weird type of user who actually wants this.
I almost never use regex, but when I do, I'd love something like this. Exactly because I don't use regex enough to be bothered learning it's impenetrable syntax.
I learned enough to see how powerful it was, then started using it within Sublime Text to edit data from time to time. (Extract URLs or something from a websites code, reformat X or Y data for a script I’m hacking together) and I’ve slowly retained more and more of the elements I repeatedly use. I think I’ve actually got a pretty good grasp on it. Maybe you should be using it more.
i mean, you can learn the basics of matching in 30 minutes or less. that core knowledge will be broadly applicable across any tool that uses regex. things get much easier once to have a handle on the basics.
…or you can learn this regex dsl and still have to learn regex. the difference is you’re learning a non-portable regex syntax.
I think it's for me. I occasionally need regular expressions, like any career programmer. I also hate regular expressions. I have to complely relearn the every time I use them.
I'm not a programmer, but I do have to write scripts, and I'm the same way with regex.
OK, let's say you've got a bunch of regexes in a source repository that need to get modified frequently. It can be difficult to code-review complex regexes, and even harder to code-review changes to an existing regex.
Something like this might actually help. A change to a complex regex might actually produce a more clear diff of a subset of lines.
Also, I think being able to comment in the middle of a regex would be super handy for that type of code.
But you can do that already in many languages using extended Regex syntax.This doesn't add anything except more verbosity and another syntax to learn.
me for example. I don't write regex often enough to be really familar with the cryptic syntax. But I do use them every once in a while and dread the occasion every time. Having a more expressive way to write pattern matching instructions would be really useful to me.
It might be used in education. Some who learned it this way might stick to it, or advance to your first group.
Oh great. A new flavour of regex, but it's less portable and more verbose. https://xkcd.com/927/
I wouldn't consider Melody a new flavour of regex as it compiles to ECMAScript regular expressions.
I'd consider being more verbose than regular expressions as a great thing for what this project aims to do, regular expressions are very write optimized which is the wrong (IMO) tradeoff to make in a shared codebase (or even your personal code that's more than a few days old) where code is read much more often.
respectfully disagree—this is very much a regex dsl. folks still need to conceptually understand regex to use this, which begs the question about who this is for.
the best use case i can think of is large and complicated expressions, but i’d need to see more of that to have a definitive opinion.
I don’t know all the forms of regex but might it be useful to have this capable of compiling to different types of regex?
if it can only be used to create regexes, and all programs compile to regexes, then it is a regex flavor in itself.
And let's not kid ourselves, regexes are not that hard. They can look cryptic, but in most cases they're not really that hard to understand.
all this does is make it much more verbose and introduce the HUGE inconvenience of a separate compiler for regexes, since regexes are typically embedded within other files written in other languages that this compiler can't understand. So somehow regexes would end up needing their own file.
but it’s less portable and more verbose
you misspelled "less obtuse and more expressive"
Also it doesn't compete with regex. It's an abstraction layer. You know, the thing programmers have been building since the dawn of programming to make everyone's lives easier. There's a reason why everyone who has the option to has stopped working directly with assembly and C.
Sure, but can it go the other way — turn a regexp string into a parse tree and then into Melody syntax?
Or, at least, the equivalent of CL-PPCRE's
parse-string?Nothing makes sense about this, how can anyone understand this. I think I will stick with standard RegExp. It's short, it's simple yet complex at the same time. And it gets the job done
oh god no, that's an even bigger abomination than regex themselves
I am very much in the market for a way to do regex without resorting to incantations that look like someone spilled a bag of special characters. Just not on JS...
You seem to be the author. A suggestion to you. You should really rethink your playground. All it currently does is turning melody into regex, which is important to have for comparison. But you're specifically courting people who DON'T want to deal with regex syntax. What you desperately need is a way to run melody expressions. And - if possible - a way to translate regex into melody wouldn't hurt as well.
Many (most?) of us tend to google regex on the web and pasting them in our code. Having them converted into a syntax that we can better understand would be hugely helpful.
This look greats! Hopefully I can start skipping chatGPT for regex
I can’t say this is for me. What I really need is something that will convert one flavor of regex to another. It’s really annoying to always have to look up the shortcuts and capture group syntax.
Yes! I actually had this exact desire years ago, and went searching for it. RegexBuddy does this, best $US 40 I've spent. It'll even do its best to make something that'll match the same things, even if you're using features that aren't technically supported in the target. Don't worry, it'll describe exactly what doesn't work, and why, when it does that.
For example, if I ask it to convert from C#
/(?>atomic) case-(?i)insensitive(?-i) string/to JavaScript (chrome) it'll throw out:/(?:atomic) case-[iI][nN][sS][eE][nN][sS][iI][tT][iI][vV][eE] string/, along with the warning:Conversion is incorrect because the target application's regular expression flavor doesn't have certain features: JavaScript (Chrome) does not support atomic grouping
eh, If your goal is to make regular expression simpler, a web application where users can click to generate things would prob be easier.
Quickly looking at the readme, it seems nice and readable. I’d be curious though to see examples of monster expressions, as I’d be worried that Melody’s syntax wouldn’t be so helpful there (not sure though).
I don’t mind the verbosity, but it does feel like it leans a tad too much plain language with the
some of …stuff.It’d be cool if it could also produce train track diagrams.
But I learned Perl in the 00's and I don't want those neurons to go to waste!
Think I'll just stick to regular expressions...
so, where’s the email address regex? that’s where this lives or dies. there is no reason to use this for extremely simple happy-path regexes.
i’m having a tough time understanding who this is for. a beginner might think this is great, but they’re shooting themselves in the foot by adding an additional layer of abstraction rather than reading something to learn the basics.
I am of the opinion that regex for email address is a bad idea. The only two things that you need to check an email address are:
Does the address contain an @ symbol?
Is there a dot to the right of the @ symbol?Then just try to deliver to it, and let the MTA do the rest.
Email addresses can be complicated, and there's plenty of valid addresses that can be excluded by attempts at regex validation.
i said “email” but what i meant was “show me a complicated example”. i don’t disagree with anything you said.
If it can do that, i might just use it. It'll make code a whole lot cleaner to read.
I disagree. Anyone familiar with regex can debug these statements post conversion. Anyone not familiar with regex is going to have to learn something in order to debug the statement. I'd rather learn something that's expressive and easy to visually parse.
regex syntax is a vestige of the old "as few bytes as possible" era where every character of code had to be written personally. It's an obsolete way of thinking for the vast majority of programming.
Oh nice. An entire language that is write-only.
this is really the problem here. it’s very much lipstick-on-a-pig and doesn’t actually reduce complexity.
Hmm, I think I will give it a star in case I need something like this. I did use regex enough to know how it works though I do have a offline regex101 software to aid into that.
Just use parser combinators
Permanently Deleted
It's more readable and maintainable than ECMAScript regular expressions, which it compiles into
I prefer the pomsky syntax. https://pomsky-lang.org/
I used to hate regex, but after having had to use it a bunch and slowly getting used to the syntax, I can sort of read it quickly, and fully parse it if I stare at a regex expression long enough. It seems like having a DSL like regex is important because it does something well with a much shorter section of code than the equivalent host language code that does the same thing. But, it probably takes as long to understand a section of regex code as it does to understand the equivalent host language code, so it feels like you're staring at a small block of impenetrable code, where you would otherwise be scanning a larger block of code. If that makes sense
Props to the authors of this language