now I'm pondering how one could write a program that, given a regular expression, automatically generates a (possibly infinite) list of all strings that are matched by that regex

feel free to reply with your favorite programming languages

@typhlosion well they're graphs, so you could brite force it with a backtracking graph traversal

@confusedcharlot why do people keep making bruteforce suggestions ;w; these are regexes, it should be more straightforward than that

@typhlosion it's easy to track different paths through the fsa in parallel w/o back tracking
swtch.com/~rsc/regexp/regexp1.
but if your building strings, don't you kinda need to track the info you could trash when a matching terminates?

Sign in to participate in the conversation
Awoo Space

Awoo.space is a Mastodon instance where members can rely on a team of moderators to help resolve conflict, and limits federation with other instances using a specific access list to minimize abuse.

While mature content is allowed here, we strongly believe in being able to choose to engage with content on your own terms, so please make sure to put mature and potentially sensitive content behind the CW feature with enough description that people know what it's about.

Before signing up, please read our community guidelines. While it's a very broad swath of topics it covers, please do your best! We believe that as long as you're putting forth genuine effort to limit harm you might cause – even if you haven't read the document – you'll be okay!