Write a Blog >>
SLE 2017
Sun 22 - Fri 27 October 2017 Vancouver, Canada
co-located with SPLASH 2017
Mon 23 Oct 2017 11:20 - 11:45 at Regency B - Parsing Chair(s): Ralf Lämmel

Parsing Expression Grammars are a powerful and popular foundation for describing syntax. Despite PEGs’ expressiveness, there are many syntax patterns of popular programming languages that cannot be recognized with PEGs. Typical examples include typedef-defined names in C/C++ and here documents appearing in many scripting languages. We use a single unified state representation, called a symbol table, to capture various context-sensitive patterns. Over the symbol table, we design a small set of restricted semantic predicates and actions. The extended PEGs are called SPEGs, and are designed to be safe in contexts of backtracking and the packrat parsing’s linear time guarantee. This paper will show that SPEGs surprisingly improve the expressive power in such ways that they recognize practical context-sensitive grammars, including back referencing, indentation-based code layout and contextual keywords.

Mon 23 Oct
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

10:30 - 12:00: SLE - Parsing at Regency B
Chair(s): Ralf LämmelUniversity of Koblenz-Landau, Germany
sle-2017-papers10:30 - 10:55
Haoyuan Zhang, Huang Li, Bruno C. d. S. OliveiraUniversity of Hong Kong, China
sle-2017-papers10:55 - 11:20
Patrick DubroyY Combinator Research, USA, Alessandro WarthY Combinator Research, USA
sle-2017-papers11:20 - 11:45
Kimio KuramitsuYokohama National University, Japan
sle-2017-papers11:45 - 12:00
Nicolas LaurentUniversité Catholique de Louvain, Belgium