Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^4: How can i parse google-like search strings?

by pernod (Chaplain)
on Jul 01, 2005 at 10:16 UTC ( [id://471636]=note: print w/replies, xml ) Need Help??


in reply to Re^3: How can i parse google-like search strings?
in thread How can i parse google-like search strings?

Ah! I (think I) get it. As long as I want to construct SQL, and my search strings look a lot like SQL in the first place. Why not let an SQL-something parse my search strings as they'll end up as my WHERE clauses anyway? SQL::Statement::Structure looks promising.

Never under-estimate the Monastery's ability to open your eyes (and gently point you to TFM). Pardon me for being dense, and thank you again.

pernod
--
Mischief. Mayhem. Soap.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (4)
As of 2024-04-16 12:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found