Removing grammar/parsing support for complext patterns

#KT-2359 In progress

compiler/testData/psi/examples/BinaryTree.jet

@@ -99,14 +99,14 @@ class BinaryTree<T> : IMutableSet<T> {
 
   private fun remove(node : TreeNode) {
     when (node) {
-      is TreeNode  #(null, null) -> replace(node, null)
-      is TreeNode  #(null, right) -> replace(node, right)
-      is TreeNode  #(left, null) -> replace(node, left)
-      is TreeNode  #(left, right) -> {
-        val min = min(node.right)
-        node.value = min.value
-        remove(min)
-      }
+      //is TreeNode  #(null, null) -> replace(node, null)
+      //is TreeNode  #(null, right) -> replace(node, right)
+      //is TreeNode  #(left, null) -> replace(node, left)
+      //is TreeNode  #(left, right) -> {
+      //  val min = min(node.right)
+      //  node.value = min.value
+      //  remove(min)
+      //}
     }
 
     fun replace(node : TreeNode, replace : TreeNode) {