Event-based parsing is a largely unexplored problem. Despite several hugely popular event-based parsers like SAX, there is very little research on the ways grammar engineers can be given explicit control over handling input tokens, and the consequences of exposing this control. Tool support is also underwhelming, with no language workbenches and very few libraries to help a parser developer to get started quickly and efficiently. To explore this paradigm, we have designed a language for event-based parsing and developed a prototype that translates specifications written in that language, to parsers in C#. We also report on the comparative performance of one of the parsers we generated, and a previously used PEG parser extracted from a real compiler.
Mon 21 Oct Times are displayed in time zone: Beirut change
14:00 - 15:30: Domain specific applicationsREBLS at Room 3B Chair(s): Hidehiko MasuharaTokyo Institute of Technology | |||
14:00 - 14:30 Talk | GRASS: Generic Reactive Application-Specific Scheduling REBLS Marcel BlöcherTU Darmstadt, Matthias EichholzTU Darmstadt, Pascal WeisenburgerTechnische Universität Darmstadt, Patrick EugsterUniversita della Svizzera Italiana, Switzerland, Mira MeziniTechnische Universität Darmstadt, Guido SalvaneschiTechnische Universität Darmstadt | ||
14:30 - 15:00 Talk | Event-Based Parsing REBLS Vadim ZaytsevRaincode Labs, Belgium | ||
15:00 - 15:30 Talk | Multitier Reactive Programming in High Performance Computing REBLS Daniel SokolowskiTechnische Universität Darmstadt, Philipp MartensTechnische Universität Darmstadt, Guido SalvaneschiTechnische Universität Darmstadt File Attached |