On Sat, 2007-03-24 at 13:29 -0700, Erick Tryzelaar wrote: > Python, as you probably know, has the feature for matching > subexpressions in a regular expression, like this:
> I don't see an easy way on how to do this. Tre can do it using Posix standard syntax. > reglex seems like it could work, reglex should do it, but I haven't figured out how: the code actually exists in the lpsrc/inria_* files, which is a hacked up copy of the Ocamllex lexer (which can do it). I don't have the expertise, I can't even understand how the Ocaml code works .. and that's under Q public licence so we can't actually use it. I know a couple of people that could do this, and might think of paying for it to be done when cash is available. It isn't clear why they should be asked to do it for free given the low number of users ;( The current tre binding in the library is a bit weak and hard to use, but it was done before we have dynamic arrays. -- John Skaller <skaller at users dot sf dot net> Felix, successor to C++: http://felix.sf.net ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Felix-language mailing list Felix-language@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/felix-language
