Proxomitron Text Matching
|
Aug. 23, 2004, 07:54 PM
Post: #1
|
|||
|
|||
I am Perl programmer. But i still can't understand Prox text matching rules. Please read a quote from Perl documentation:
Quote: The following standard quantifiers are recognized:How does Prox behave. Are quantified subpatterns 'greedy' or 'greediness'? |
|||
Aug. 24, 2004, 07:28 PM
Post: #2
|
|||
|
|||
alexx;
First, let me you to the Forum. We hope you'll like it here, and stick around to contribute to some of the more "intense" discussions on matching expressions. As a PERL man myself, I'm often at loggerheads with others here, and I can use both the moral and technical support! If I got the gist of your question correctly, in essence Proxo's matching language matches as often as possible - per filter. The Multiple function is for using more than one filter on a given target string, so don't confuse that ability with some degree of "greediness". I don't see where Scott built in a limiter such as the question mark to force a singular match, i.e., to skip repeated instances of character sets as they are found within a string. Then again, I could be wrong, as I've never found anything to goad me into trying this trick. Our premier "Filter Factory", sidki3003, will probably chime in RSN, and give us the true story. In the meantime, can you please give us an example of what you are trying to accomplish? Sometimes when we see things in print, we get a different idea than what we first imagined from just a description. Hope this helped. Oddysey I'm no longer in the rat race - the rats won't have me! |
|||
Aug. 25, 2004, 04:16 AM
Post: #3
|
|||
|
|||
Hi "Guyz",
"Alexx" Welcome to the Forum! . The Proxo help files are actually pretty good at explaining matching, meta-characters, and commands. Here are some online help files that I use as a reference. Best Wishes, "JaK" [smoke] |
|||
« Next Oldest | Next Newest »
|