Reachability in pushdown automata has a variety of applications in program analysis. As analyses grow more complex, so do the automata they use. While mathematically elegant, the implementation of reachability for complex automata is an engineering-intensive process. We present a DSL designed to simplify the specification of complex pushdown automata and aid in the development of more sophisticated program analyses.