Toward Grammar Inference via Refinement Types (Extended Abstract)
Ad hoc parsers are pieces of code that use common string functions like split, trim, or slice to effectively perform parsing, without employing any formal parsing techniques or frameworks. The grammars of ad hoc parsers remain entirely implicit. Is it possible to infer such grammars, in the same way that we can infer types? We believe that it is and present Panini, an intermediate representation for ad hoc parsers based on refinement types.
In this extended abstract, we report our progress toward grammar inference via refinement types and highlight the challenges and work still ahead of us.
Sun 11 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
11:00 - 12:30
|Idris2-Table: evaluating dependently-typed tables with the Brown Benchmark for Table Types (Extended Abstract)|
|Syntax-Generic Operations, Reflectively Reified (Extended Abstract)|
Tzu-Chi Lin Institute of Information Science, Academia Sinica, Hsiang-Shang ‘Josh’ Ko Institute of Information Science, Academia SinicaPre-print
|Toward Grammar Inference via Refinement Types (Extended Abstract)|
TyDePre-print Media Attached
|Towards Dependently-Typed Control Effects (Extended Abstract)Virtual|
|tylr, a tiny tile-based structure editor|
David Moon University of Michigan, Andrew Blinn University of Michigan, Cyrus Omar University of MichiganDOI Pre-print