Declarative Syntax Definition

We investigate formalisms for the declarative definition of the syntax of programming languages and parsing algorithms to support these formalisms. The results are embodied in the syntax definition formalism SDF3, which is integrated in the Spoofax language workbench.

Research themes

  • Declarative disambiguation rules
  • Error recovery
  • Generalized LR parsing
  • Scannerless parsing
  • Incremental parsing
  • Templates for the derivation of pretty-printers

Blog Posts | Slides | Talk Videos

Publications

2018

2017

2016

2012

2011

2010

2009

2008

2007

2006

2004

2003

2002

1997