I'm totally guessing, but perhaps there is no way to memoise when using preprocessor magic and so the algorithm for constructing the parser is O(n^2). (Of cours

I'm totally guessing, but perhaps there is no way to memoise when using preprocessor magic and so the algorithm for constructing the parser is O(n^2). (Of course my parser combinators don't memoise either.)