user Masem B.S., Chemical Engineering, U. Toledo, 1993 (Summa Cum Laude)<BR> M.S., Chemical Engineering, U. Michigan, 2000<BR> Ph.D., Chemical Engineering, U. Michigan, 2000<BR> Currently a post-doctorate researcher at Argonne Nat'l Labs in Chicago, IL. <BR> Creator of <a href="http://pinky.wtower.com/mst3k/">WS#9</a> among others... <BR> For those that are curious, I'm mostly self-taught in computer programming; (un)fortunately, the current state of Chemical Engineering tends to value shrink-wrap over innovation... <BR> <A HREF="http://mneylon.masemware.com/">My Home Page</A> for more details<BR> [Saint]hood obtained on May 20, 2001 20:20 pm CST. <P> <HR> <H3>PerlMonks Other Users Locator</H3> <P> Interested in knowing where the current Other Users are all located? You can now [http://mneylon.masemware.com/pm/|see a map] (+/- 10 minutes), and more details on how that's generated are [id://95577|available here]. </P> <HR> <H3>Perl Puzzles<BR> <SMALL>Posted by the Perplexing Populous of PerlMonks for the Pondering and Pleasure of Prenctices and Professionals of Perl</SMALL></H3> <P> I'm going to try to keep a current list of perl-based puzzles that have been posted to Perlmonks here; these include but are not limited to Golf or other types of puzzles. If you find me missing one, drop me a msg or a email and I'll add it. </P> <H4>Golf</H4> <P>Perl Golf are challenges to produce valid perl code that does a given task in as few characters in the code as possible. </P> <UL> <LI>[id://3586|Pig Latin] by [vroom] <LI>[id://63671|Key Word in Context System] by [Falkkin] <LI>[id://67973|Strings-to-Array] by [japhy] <LI>[id://69570|Nearest Neighbors] by [MeowChow] <LI>[id://73480|Mixing up da Arrays] by [ChOas] <LI>[id://73900|Tree Searching] by [Masem] <LI>[id://74270|List Spliting] by [Masem] <LI>[id://75004|Triangle Golf] by [nashdj] <LI>[id://75261|Ordered Combinations] by [MeowChow] <LI>[id://76083|Embedded in Order] by [Masem] <LI>[id://77183|Fragment Reassembly] by [MeowChow] <LI>[id://77203|Interlaced Strings] by [yakko] <LI>[id://77237|Reversal] by [japhy] <LI>[id://77751|Per Mutations] by [MeowChow] <LI>[id://78334|List of Partitions] by [jynx] <LI>[id://78498|Multiply Polynomials] by [tilly] <LI>[id://78666|LFSR] (Linear Feedback Shift Register) by [tye] <LI>[id://79130|Arbitary Alphabetical Sorting] by [Masem] <LI>[id://79364|Repeated Phrases] by [Masem] <LI>[id://79436|RPN Calculator] by [Sprad] <LI>[id://79811|Shortest Graph Distance] by [Masem] <LI>[id://80272|Minimizing the Bacon Number] by [Masem] <LI>[id://81130|JAPH] by [tadman] <LI>[id://81695|Sieve of Eratosthenes] by [tilly] <LI>[id://81969|Reversing RPN Notation] by [Masem] <LI>[id://82434|Missing Entries in Series] by [sharle] <LI>[id://82440|Factorials] by [srawls] <LI>[id://82512|Grocery Bagging] by [tadman] <LI>[id://82878|PGA Golf, Round 1] by [jmcnamara] (and [id://84767|Results]) <LI>[id://83013|Selection from Sets] by [knobunc] <LI>[id://83017|Subroutine Chaining Idiom] by [Ovid] <LI>[id://83867|Phone Numbers to Words] by [mischief] <LI>[id://83923|Closest Value in List] by [larryk] <LI>[id://84150|Binomal Coefficients/Pascal's Triangle] by [tachyon] <LI>[id://85399|Best 8-Character Obfuscation] by [mr.nick] <LI>[id://86047|Matching State Abbreviations] by [John M. Dlugosz] <LI>[id://86805|LED Sign] by [tadman] <LI>[id://87681|Making Change] by [tadman] <LI>[id://89075|Kaprekar's Process] by [srawls] </UL> <H5>Other Golf Links</H5> <UL> <LI>[id://77230|Golf Do-s and Don't-s] by [japhy] <LI>[id://81870|On Golf] by [Dominus] <LI>[id://82470|Tips on Writing Golf Challenges] by [chipmunk] </UL> <H4>Lanugage Puzzlers</H4> <UL> <LI>[id://72489|The "Proposal Problem"] by [nysus] <LI>[id://72605|Little Stumper] by [nysus] <LI>[id://72671|Just for Newbies] by [nysus] <LI>[id://79981|"Junkyard" Puzzle - Avergae of Numbers] by [Masem] </UL> <H4>Non-Perl Specific Puzzlers</H4> <UL> <LI>[id://39366|Spooky Math Problem] by [tilly] <LI>[id://54682|5x5 Puzzle] by [tilly] <LI>[id://84175|Triangular Numbers] by [jepri] </UL> <HR> <H3>Current 'Projects'<BR><SMALL>If you want to call these as such...</SMALL></H3> <ul> <li><b>Reworking of WS#9's CGI</b> - most of the current code is hobbled together over 3 years time, and from a feature standpoint, most everything I want is frozen, so I'm working on rewriting everything better thanks to DBI and TT2. <LI><B>[Algorithm::Genetic]</B> - A generalized framework for running Genetic Algorithms in perl. <LI><B>[Game::Life]</B> - Runs Conway's Game of Life in perl <li><b>List 'regex' engine</b> - I'd like to be able to develop a way to be able to match arbitary lists of data against some patterns; the matching would be done at the element level as opposed to individual characters, but I want to be able to include the ability to use arbitary functions for matching as well, such as item for item based on a true string regex, a condition, or other similar features....I want to do this because of ... <li><B>Rules-based Perl</B> - As discussed in [id://71319|this node], a rules-based perl language would be rather interesting to work with, maybe more from a curiousity sake then anything else. In order to even start this, it's absolutely necessary to develop the list regexs as mentioned above. </ul> <h4>Preliminary 'language' for List::Regex</h4> <P> <B>I'd appriciate any comments on this, either to my msg box here or [mailto:mneylon-pm@masemware.com|email address] and I'll try to post updates here.</B> <P> I believe I've got the approach to doing this one; I'm going to take [Parse::RecDescent], with a fixed grammar, then use that grammar to develop a grammar specifically for the regex itself to pump back into Parse::RecDescent again (meta!). I was going to try to develop my own finite state machine to do this, but I believe I can make use of existing code better than starting from scratch. <P> Here's the ideas I've had in mind: <UL> <li><CODE>.</CODE> - Match any element once <li><CODE>/xxxxx</CODE> - Specific class elements, including <UL> <LI><CODE>/word</CODE> <LI><CODE>/number</CODE> <LI><CODE>/integer</CODE> </UL> <LI><CODE>/regex/</CODE> - Match element if regex matches element <LI><CODE>?variable</CODE> - Assign one element to $variable <LI><CODE>?variable:<any of the above></CODE> - Assign $variable with conditions set above <LI><CODE>?variable:{ perl code }</CODE> - Assign $variable, and test the embedded perl code with it. <LI><CODE>?</CODE> - (after element) matches 0 or more times <LI><CODE>+</CODE> - (after element) matches 0 or 1 time <LI><CODE>*</CODE> - (after element) matches 1 or more times <LI><CODE>[n,m]</CODE> - (after element) matches at least n but no more than m times (using {} would be nice if I can set it up to differentiate from the perl code above) <LI><CODE><element>|<element></CODE> - Or operator <LI><CODE>(element*)<CODE> - Grouping operator, values stored to @1, @2, etc possibly? (makes more sense with <code>?variable:(element*)</CODE>) </UL> All matches would be for the entire array, eg implicit ^ and $ on the regex. <P> Some examples: <CODE> @list = qw( The quick brown fox jumped over the lazy dog ); listparse( ".[9]", @list ); #true listparse( ".[8]", @list ); #false listparse( "The ?adjectives:(.*) fox jumped over the lazy ?what", @list ); # $adjectives would be set as a ref to [ quick, brown ] # $what would be set to "fox" listparse( "The ?speed:{ $speed eq 'quick' } .*", @list ); # $speed would be set to 'quick' listparse( "The ?speed:{ $speed ne 'quick' } .*", @list ); # false listparse( "/word*", @list ); #true listparse( "/word /number .*, @list) ; #false </CODE> Hopefully that will give some examples of where I'm going with this... <P>     2006-08-09 01:45:56 12764 360162 0 981 Chicago, IL USA -5 80