ply lex seems not greedy (when using class)

[Astyan-42]

I have write an exemple of the issue : https://github.com/Astyan-42/plynotgreedy
I don't know a lot about ply but if I remember well lex should be greedy so the KEYWORD should be reconized like a KEYWORD and not a word.

Here the statements of the parser seem to count in the token size.

[johnyf]

This is because you define both the CHAR and KEYWORD token rules using methods, instead of plain regular expressions. Their precedence is the order in which they appear in the source code, unlike the tokens that are defined by plains strings, whose order is obtained after sorting them in decreasing regular expression length. This is described here in the documentation.