Opinions please: N++ RE implementation (beginner w/experience)
-
I like N++, proven robust, it’s saved me over and over. I want to start to use RE and build on my slight GREP/SED experience.
Are you impressed by N++ RE implementation?
What’s a good approach to take? i.e. “Using PERL RE on N++ is awesome” “Find a POSIX text book” or something practical like “learn Python type RE” here.
I’m mainly trying to avoid a rabbit hole -
@Frustrated-Surfer said in Opinions please: N++ RE implementation (beginner w/experience):
Npp uses boost::regex engine with perl being the configured syntax to use.
Are you impressed by N++ RE implementation?
Are you asking how well npp implemented boost::regex or whether the
used RE engine is a good one. If the latter is the case then I say, yes,
but it has its glitches and shortcomings like other REs do have as well.What’s a good approach to take?
Read the document I linked to earlier to understand what boost::regex offers
and then start using it. In addition you might check this site which has some good explanations.I avoid using online regex testers as it could be that the solution you build which such a tool isn’t working with npp.
-
-
@Ekopalypse Much appreciated, you answered the question and leaned a ladder against the tree where I should climb to look for more.
-
@Alan-Kilborn Like I wrote to the other respondent, much appreciated. Another farming metaphor: You’ve opened the gate to a grove (trove) of information. (The pun, and puns in general now that I think about them, we gotta admit it doesn’t hurt to crack a grin and roll our eyes!)(Y’know, now that I think about it some more, a pun may well be about the only humor that can be easily conveyed in plain text without having to explain it with a #hashtag.) Thanks again.