Type-based Termination Analysis for Parsing Expression Grammars

Abstract

Parsing expressions grammars (PEGs) are a recognition-based formalism for language specification, which has been the subject of several research works. A PEG that succeeds or rejects every input string is said to be complete. However, checking if an arbitrary PEG is complete is an undecidable problem. In this work we propose a sound type-based termination analysis for PEGs as a type inference algorithm.