in reply to Re^5: SQL Parsing with Parse::RecDescent
in thread SQL Parsing with Parse::RecDescent

Thanks for your advices
but I think it is difficult for you to understand the motivation behind.
Please stop digging into this.
Thanks to moritz, however I think I got it.
He said:

I just think that "blind" searching in source code for SQL statements will not work reliably, it will have both many false positives and false negatvies.

BUT THAT'S EXACTLY THE POINT: WHY SHOULD IT WORK RELIABLY?
I dont need to have exact matches for each data row:
for testing its even better if I got negative as well as positive matches.
That's exactly boundary testing, and I get it for free!
So today I reprogrammed my RD engine to take only expressions of this kind:
- column = 'value' (or whatever other operator)
- column1 = column2
In my context I dont even want to find out the correspondig table
because I will insert the value in all the tables having this column.
I already modified my parser and detected successfully a lot of values in a huge query.
I'll try to publish the program in my scratchpad
(but first I've to ask because I'm working in a bank).


PERLMONKS IS GREAT!

Ciao!
Davide.
  • Comment on Re^6: SQL Parsing with Parse::RecDescent