« first day (4836 days earlier)   

2:10 AM
0
Q: Enumerate all matches of a regex

emanresu AFor this challenge, we'll be using a simplified dialect of regular expressions, where: A lowercase letter from a to z matches itself. (expr1|expr2) matches either of expr1 and expr2. You will not have to handle more than two operands, and you can assume there will always be parentheses around th...

 
Achievement get: First question
 
 
2 hours later…
4:11 AM
> For example, given (a)*(b)*, your output should contain all strings consisting of zero or more as followed by zero or more bs.
> , a , b , aa , ab , ba , bb , aaa , aab , aba , abb , baa , bab ...
ba does not match (a)*(b)*
@emanresuA
 
I'm dumb and I pasted in the wrong testcase output
 
lol
 
Fixed
 

« first day (4836 days earlier)