Tree processing in program analysis often feels like a chore due to intricate recursive algorithms that are difficult to follow. We propose TreeMatchLib, a library that introduces a concise, regex-inspired notation to simplify tree manipulation,. By utilizing a concise syntax (e.g., A > B C) with regex-like operators, including choice, repetition, and recursion, developers can describe complex structures with the same ease as string patterns of regular expression library. Our “capture and placeholder” (##name) mechanism simplifies node extraction and in-place rewriting, transforming tedious traversals into declarative operations. The library allows developers to specify structural intent declaratively, eliminates the need for manual post-match traversals, and integrates custom analysis features into existing architectures seamlessly.