My research interests lie at the intersection of formal languages and automata theory and computational complexity theory. In recent years, I have focused on parsing expression grammars (PEGs), the corresponding computational model Pushdown Pointer Automata, and extensions of these formalisms and the associated language classes. I also actively develop a parsing library based on PEGs (see Open Source).