Blogs (9) >>
Sun 30 October - Fri 4 November 2016 Amsterdam, Netherlands
Sun 30 Oct 2016 08:45 - 09:10 at Matterhorn 1 - First Session

SDF is a syntax definition formalism used to describe context-free grammars of programming languages. The key principle underlying the design of SDF is declarative syntax definition, so that the user does not need to understand the underlying parsing algorithm, unlike other formalisms such as Yacc. This disambiguation method is able to handle common cases of operator precedence, but the current semantics of priorities fails to disambiguate some other less usual operator precedence that can be found in OCaml or Haskell languages. We propose a new semantics for SDF priorities that generalize the current approach. We describe a possible implementation of a GLR parse-table generator compliant to our semantics, and tested in the Spoofax Language Workbench.

Disambiguation for SDF3 with Deep Priority Conflicts (beamer.pdf)180KiB

Sun 30 Oct
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

08:30 - 10:00: First SessionParsing@SLE at Matterhorn 1
08:30 - 08:45
Day opening
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, Netherlands
File Attached
09:10 - 09:35
Multiple input GLL parsing
Elizabeth ScottRoyal Holloway University of London, Adrian JohnstoneRoyal Holloway University of London
File Attached
09:35 - 10:00
Demonstration: Modularly Parsing Naturally Embedded DSLs in Wyvern
Jonathan AldrichCarnegie Mellon University