Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: In search of an efficient query abstractor

by talexb (Canon)
on Dec 08, 2008 at 02:35 UTC ( #728837=note: print w/replies, xml ) Need Help??

in reply to In search of an efficient query abstractor

If one of the existing Perl modules already mentioned doesn't do it for you, I'd highly recommend a state machine; SQL is (from what I know) well enough defined that it should be quite a fun little exercise. However, I wouldn't do it character by character -- that's insane -- I'd go word by word (or rather, token by token).

And while I love C for its speed, I'd probably write it in Perl for speed of development -- at least until I started having performance problems anyways.

Alex / talexb / Toronto

"Groklaw is the open-source mentality applied to legal research" ~ Linus Torvalds

  • Comment on Re: In search of an efficient query abstractor

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (6)
As of 2021-06-18 17:26 GMT
Find Nodes?
    Voting Booth?
    What does the "s" stand for in "perls"? (Whence perls)

    Results (89 votes). Check out past polls.