Parsing@SLE is a workshop on parsing programming languages, now in its third edition. The intended participants are the authors of parser generation tools and parsers for programming languages and other software languages. For the purpose of this workshop ``parsing'' is a computation that takes a sequence of characters as input and produces a syntax tree or graph as output. This possibly includes tokenization using regular expressions, deriving trees using context- free grammars, and mapping to abstract syntax trees. The goal is to bring together today’s experts in the field of parsing, in order to explore open questions and possibly forge new collaborations. The topics may include algorithms, implementation and generation techniques, syntax and semantics of meta formalisms (BNF), etc.

Topics

While parsing and parser generation, both in theory and in practice, are mature topics, there are still many challenging problems with respect to the construction, maintenance, optimization, and application of parsers in real-world scenarios.

Especially in the context of real programming languages there are ample theoretical as well as practical obstacles to be overcome. Contemporary parsing challenges are caused by programming-language evolution and diversity in the face of new application areas such as IDE construction, reverse engineering, software metrics, domain specific (embedded) languages, etc. What are modular formalisms for parser generation? How to obtain (fast and correct) parsers for both legacy and new languages that require more computational power than context-free grammars and regular expressions can provide? How to use increasing parallelism offered by multi-cores and GPUs in parsers? How to enable the verified construction or prototyping of parsers for languages such as COBOL, C++ and Scala without years of effort?

In addition to the traditional programming-language applications of parsing technology, several other areas of computing also depend heavily on parsers. Examples include computational linguistics, network traffic classification, network security, and bioinformatics. Those areas often have their own unusual requirements, such as: speed (e.g. in network algorithmics), memory efficiency (e.g. embedded devices for networks, but also computational linguistics), or rapid/dynamic parser construction (e.g. in network traffic classification and in bioinformatics) as grammars are adapted. We encourage talk proposals on parsing challenges and solutions in such non-traditional areas as well.

Accepted Talks

Title
Disambiguating Grammars with Tree Automata
Parsing@SLE
Fastparse: programmable parsers for the 21st century
Parsing@SLE
Improving Syntactic Completion
Parsing@SLE
File Attached
Modular Syntax
Parsing@SLE
Name Resolution Strategies in Variability Realization Languages for Software Product Lines
Parsing@SLE
Operator Precedence for Parser Combinators
Parsing@SLE
Towards Abstract-Syntax-Preserving Grammar Migrations
Parsing@SLE
File Attached

Call for Talk Proposals

We solicit talk proposals in the form of short abstracts (max. 2 pages in ACM 2-column format). A good talk proposal describes an interesting position, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Parsing@SLE is not a publication venue. Publication of accepted abstracts and slides on the website is voluntary. Talk proposal abstracts should be submitted via EasyChair.

Submission deadline for talk proposals: August 7th August 31st

Notification on or before: September 7th

You're viewing the program in a time zone which is different from your device's time zone change time zone

Sun 25 Oct

Displayed time zone: Eastern Time (US & Canada) change

08:30 - 10:00
First SessionParsing@SLE at Reflections
Chair(s): Loek Cleophas
09:00
15m
Day opening
Opening
Parsing@SLE
Loek Cleophas , Ali Afroozeh Centrum Wiskunde & Informatica
09:15
45m
Talk
Invited talk: Parsing Unpreprocessed C Code - The TypeChef Experience
Parsing@SLE
I: Christian Kästner Carnegie Mellon University
10:30 - 12:00
Second SessionParsing@SLE at Reflections
Chair(s): Eric Van Wyk University of Minnesota
10:30
30m
Talk
Modular Syntax
Parsing@SLE
Cyrus Omar Carnegie Mellon University
11:00
30m
Talk
Improving Syntactic Completion
Parsing@SLE
Luis Eduardo de Souza Amorim TU Delft, Guido Wachsmuth Delft University of Technology, Eelco Visser Delft University of Technology
File Attached
11:30
30m
Talk
Fastparse: programmable parsers for the 21st century
Parsing@SLE
13:30 - 15:00
Third SessionParsing@SLE at Reflections
Chair(s): Tijs van der Storm CWI
13:30
30m
Talk
Operator Precedence for Parser Combinators
Parsing@SLE
Anastasia Izmaylova Centrum Wiskunde & Informatica
14:00
30m
Talk
Disambiguating Grammars with Tree Automata
Parsing@SLE
Michael D. Adams University of Utah
14:30
30m
Talk
Name Resolution Strategies in Variability Realization Languages for Software Product Lines
Parsing@SLE
Sven Schuster Technische Universität Braunschweig, Christoph Seidl Technische Universität Braunschweig, Ina Schaefer
15:30 - 17:00
Fourth SessionParsing@SLE at Reflections
Chair(s): Ali Afroozeh Centrum Wiskunde & Informatica
15:30
30m
Talk
Towards Abstract-Syntax-Preserving Grammar Migrations
Parsing@SLE
Martijn Dwars Delft University of Technology, Jeffrey Goderie Delft University of Technology, Eduardo Amorim Delft University of Technology, Guido Wachsmuth Delft University of Technology, Eelco Visser Delft University of Technology
File Attached
16:00
15m
Day closing
Closing
Parsing@SLE
Loek Cleophas , Ali Afroozeh Centrum Wiskunde & Informatica