60 PerlMonks - Newest Nodes New nodes appearing on PerlMonks http://perlmonks.org/index.pl?node_id=30175 http://blogs.law.harvard.edu/tech/rss PerlMonks Newest Nodes XML Generator Sat Oct 21 04:30:47 2017 Sat Oct 21 04:30:47 2017 Anonymous Monk PerlMonks clean,rss 20171021043047 http://perlmonks.org/ 961 30 2017-10-21 14:30:47 More effective way of doing this bisimen http://perlmonks.org/index.pl?node_id=1201797 I was trying to write a code that generates all possible combination of a word with X length and with any string of number/letters This is what I came up with. So, this will work for any ... perlquestion Sat, 21 Oct 2017 14:29:11 +0000 http://perlmonks.org/index.pl?node_id=1201797 1201797 1201403 2017-10-21 10:29:11 bisimen Regex: matching character which happens exactly once LanX http://perlmonks.org/index.pl?node_id=1201795 Hi ( DISCLAIMER this is a theoretical question about pure regexes, I know how to solve this in Perl, it's a follow up to <a href="?node_id=1201500">this thread</a>) I'm banging my head at this pro... perlquestion Sat, 21 Oct 2017 13:46:22 +0000 http://perlmonks.org/index.pl?node_id=1201795 1201795 708738 2017-10-21 09:46:22 LanX