Grammar Repair with Examples and Tree Automata: Extended Version

Yunjeong Lee, Gokul Rajiv, Ilya Sergey

Context-free grammars (CFGs) are the de-facto formalism for declaratively describing concrete syntax for programming languages and generating parsers. One of the major challenges i…