« 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
 

« first day (4836 days earlier)