Follows rough guidelines from PR22416. So far, I use very simple measure for expressions's simplicity. If it doesn't have > 1 children it is a simple one. Probably it also makes sense to check how deep is the tree if there is just one immediate child. This would catch situations like return (!(*foo));
Depends on D16278 which adds ParenExpr matcher.