Parsing@SLE 2017 is the fifth 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.
Call for Contributions
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 talk proposals:
- position presentations intended to summarize achievements and challenges, perhaps summarizing the work of an entire research group;
- technical presentations covering specific advances
- tool demonstrations showing 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.
Talk proposals should be in the form of 1 page US-letter abstracts in ACM 2-column 10pt or 11pt format. Submission site to be determined soon.
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.
Sun 22 Oct Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change
|08:45 - 09:00|
|09:00 - 09:30|
Abhinav JangdaUniversity of Massachusetts, Amherst
|09:30 - 10:00|
|10:30 - 11:00|
|11:00 - 11:30|
|11:30 - 12:00|
|14:00 - 14:30|
|14:30 - 15:00|
Vadim ZaytsevRaincode Labs, Belgium
|15:30 - 17:00|
Jurgen VinjuCentrum Wiskunde & Informatica / Technische Universiteit Eindhoven
Instructions for Authors
For fairness reasons, all submitted papers should conform to the formatting instructions. Submissions that violate these instructions may be rejected without review.
Please take a moment to read the instructions below before using the submission site.
- The talks at Parsing@SLE are open in the sense that anybody who registers may attend and join the discussion.
- The contents are not published in the ACM digital library, leaving your material open for future publication in an academic journal or conference (like the SLE conference)
Please submit short descriptions of your proposed talks in plain text.