Despite the long history of research in parsing, constructing parsers for real programming languages remains a difficult and painful task. In the last decades, different parser generators emerged to allow the construction of parsers from a BNF-like specification. However, still today, many parsers are handwritten, or are only partly generated, and include various hacks to deal with different peculiarities in programming languages. The main problem is that current declarative syntax definition techniques are based on pure context-free grammars, while many constructs found in programming languages require context information.
In this paper we propose a parsing framework that embraces context information in its core. Our framework is based on data-dependent grammars, which extend context-free grammars with arbitrary computation, variable binding and constraints. We present an implementation of our framework on top of the Generalized LL (GLL) parsing algorithm, and show how common idioms in syntax of programming languages such as (1) lexical disambiguation filters, (2) operator precedence, (3) indentation-sensitive rules, and (4) conditional preprocessor directives can be mapped to data-dependent grammars. We demonstrate the initial experience with our framework, by parsing more than 20000 Java, C#, Haskell, and OCaml source files.
Thu 29 Oct Times are displayed in time zone: Eastern Time (US & Canada) change
|15:30 - 15:54|
|Toward tool support for interactive synthesis|
|15:54 - 16:18|
|Type Systems for the Masses: Deriving Soundness Proofs and Efficient Checkers|
Sylvia GreweTU Darmstadt, Sebastian ErdwegTU Darmstadt, Germany, Pascal WittmannTU Darmstadt, Mira MeziniTU DarmstadtLink to publication
|16:18 - 16:42|
|One Parser to Rule Them All|
Onward! PapersLink to publication DOI Pre-print Media Attached
|16:42 - 17:06|
|Isolates, Channels and Event Streams for Composable Distributed Programming|
|17:06 - 17:30|
|A Bootstrapping Infrastructure to Build and Extend Pharo-like Languages|