Ravi Dangeti wrote:
thanks Ezra. I was able to implement the single string matches.
i am trying to do the boolean full text searches(and or and
not)...like string1+string2 etc. I will get this kind of combined
string with boolean operators as input.Is there a way to define a
single regular exps for such at one go, rather than seperating the
strings and executing seperate matches and then combining the results.
This is really a question not about Links but about the power of regular
expressions, which I'm sure that you, as an experienced computer science
researcher, can work out.
I will tell you, however, that the only kinds of regular expression
matches that Links will convert into database queries are those that
consist solely of literal characters and the arbitrary-length wildcard
pattern:
.*
So for example, these regular expressions can be used in database queries:
foo
bar\.baz
.*cicero
monkey.*
how.*noble.*in.*reason
But the following ones will prevent a comprehension from being compiled
to a database query:
foo|bar
[a-z]+
links (rules)*
I hope that's clear--let me know if not.
Ezra
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
_______________________________________________
links-users mailing list
[email protected]
http://lists.inf.ed.ac.uk/mailman/listinfo/links-users
