Parsing@SLE 2016 is the fourth annual workshop on parsing programming languages. 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. We expect to attract participants that have been or are developing theory, techniques and tools in the broad area of parsing.
Sun 30 Oct Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|08:30 - 08:45|
|08:45 - 09:10|
|Disambiguation for SDF3 with Deep Priority Conflicts|
Timothée HaudebourgENS Rennes, Luis Eduardo de Souza AmorimDelft University of Technology, Netherlands, Eelco VisserDelft University of Technology, NetherlandsFile Attached
|09:10 - 09:35|
|Multiple input GLL parsing|
Elizabeth ScottRoyal Holloway University of London, Adrian JohnstoneRoyal Holloway University of LondonFile Attached
|09:35 - 10:00|
|Demonstration: Modularly Parsing Naturally Embedded DSLs in Wyvern|
Jonathan AldrichCarnegie Mellon University
|10:30 - 10:55|
|10:55 - 11:20|
|There’s more than one way to skin a cat|
Nate NystromUniversity of LuganoFile Attached
|11:20 - 11:45|
|Knowledge-Based Support for Domain Specific Language Generation|
Frank CoyleSMUFile Attached
|11:45 - 12:10|
|Parsing in K-Framework|
Radu MereutaFaculty of Computer Science, UAIC, Iasi, RomaniaFile Attached
|13:30 - 13:55|
|Context-Sensitive Parsing Through Stateful Parsing|
|13:55 - 14:20|
|Goodbye Chomsky, Hello Tesnière: Replacing Constituency with Dependency in Software Languages|
|14:20 - 14:45|
|Deriving Grammar Transformations for Developing and Maintaining Multiple Parser Versions|
|14:45 - 15:10|
|Composition of independent language extensions to C|
|15:40 - 16:05|
|Generalised Parsing and Combinator Parsing: a Happy Marriage?|
L. Thomas van BinsbergenRoyal Holloway University of LondonFile Attached
|16:05 - 16:30|
|Good enough for you? Explaining ourselves through standard challenges|
Adrian JohnstoneRoyal Holloway University of London, Elizabeth ScottRoyal Holloway University of LondonFile Attached
|16:30 - 17:20|
|Discussion and closing|
Call for Papers
The main focus of Parsing@SLE is formal language syntax specification and analysis, with applications in programming language implementation and emerging applications in bioinformatics and big data.
The workshop is deliberately informal, with the primary goal of stimulating exchange of ideas and highlighting emerging advances and applications. We particularly try to bring together authors, developers and users of current tool sets for compiler generation, parser generation and meta-programming.
We solicit three kinds of submission:
- 15 minute ‘position presentations’ intended to summarise achievements and challenges, perhaps summarising the work of an entire research group;
- technical presentation sessions covering specific advances in 15 minutes followed immediately by a 15 minute discussion session, and
- tool demonstrations, which should show running software rather than screen shots and tool specifications, with an opportunity for interactive sessions during the breaks.
In the context of real programming languages there are many outstanding theoretical and practical problems. In particular, programming-language evolution and diversity in the face of application areas such as IDE construction, reverse engineering, software metrics and domain specific (embedded) languages generate many parsing challenges. For example, can we find good modular formalisms for parser generation? How do we 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 can we exploit increasing the parallelism offered by multi-core processors and GPUs ? How can we provide verified parsers for languages such as C++ and Scala without years of effort?
Many broader areas of computing also depend heavily on parsers, for example computational linguistics, network traffic classification, network security, and bioinformatics. These areas often have their own unusual requirements, such as: speed, particularly in network algorithmics; memory efficiency, for example in embedded devices; and rapid/dynamic parser construction as grammars are adapted. We encourage submissions on parsing challenges and solutions in the broadest application areas.
Proposals should be in the form of 1 page A4 abstracts in ACM 2-column 10pt or 11pt format and should be submitted via EasyChair: https://www.easychair.org/conferences/?conf=parsing_at_sle2016
There will be no formal published proceedings, but accepted abstracts will be circulated in advance to all participants along with any additional material presenters wish to provide.
Submission deadline for abstracts: September 9th 2016
Notification: September 16th 2016