Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Re: Who's a thief?

by pjf (Curate)
on Jul 05, 2002 at 10:39 UTC ( #179600=note: print w/ replies, xml ) Need Help??


in reply to Re: Who's a thief?
in thread Artificial Intelligence Programming in Perl

My goodness. It's a common enough occurance for someone to point to a Perl regexp and say something like "EEEeeeewww!!!". I don't want to imagine what people will say once they see the regexps used to implement backtracking in AI.

Paul Fenwick
Perl Training Australia


Comment on Re: Re: Who's a thief?
Re: Who's a thief?
by Abigail-II (Bishop) on Jul 05, 2002 at 11:23 UTC
    Actually, the only natural backtracking mechanism found in Perl is in regular expressions. Backtracking is what I use to determine primeness of numbers using regular expressions, it's what's used in the Cookbook when regular expressions are used to solve Diophantine equations, and its used in my reduction of 3-CNF-SAT to regular expressions http://perl.plover.com/NPC/NPC-3SAT.html.

    Abigail

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://179600]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (10)
As of 2014-08-23 12:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (173 votes), past polls