extreme slowness about ply HOT 5 CLOSED

I'm not able to deep-dive into this, but there's not a whole lot to the PLY lexer other than repeatedly calling re.match(). That said, the re module is known to have pathological performance for certain kinds of regex. It's possible that you've somehow fallen into that by accident. Fixing it will require some further investigation.

from ply.

OK Thanks for the fast response. I can try figure out if it's really a pathological regex as such, or if the way PLY combines the regexes makes it pathological.

from ply.

Aside from your performance issue, there is a logical problem in your code. If you want to implement lexical analyzer for templates in C++ then your implementation of operators like >[=>]? will be mistaken by operator >> (bit-wise right shift operator and ostream cout) . It was C++ compiler problem from 1999 to 2011 because of not clear decision of the C++ committee. C++ programmer had to add extra space between > > for template.

from ply.

Did I mention that I hate C++ with a burning passion? :)

What are the actual lexing rules in this case? Does the lexer need to be "template aware"? Because that's matlab levels of weirdness right there.

from ply.

Did I mention that I hate C++ with a burning passion? :)

What are the actual lexing rules in this case? Does the lexer need to be "template aware"? Because that's matlab levels of weirdness right there.

I wanted to indicate the problem that might help you. AFAIK, this problem can't be solved in lexical level.

from ply.