>> It was chosen to transform source code fragments (pointer expressions) >> by two SmPL rules so that the search pattern “sizeof(T)” would work >> in the third rule. > > Ah, right, it would be nice to get rid of those normalization rules, > especially the second one. Thanks for such positive feedback. > I don't see how, Where is your view too limited at the moment? > though, without either causing a combinatorial explosion Growing combinations can become more interesting, can't they? > or loosening up the matching too much. I hope that we can achieve another reasonably safe transformation approach together. Regards, Markus
