Write a Blog >>
Fri 28 Sep 2018 13:55 - 14:17 at Frisco - Session 2: Scala Extensions & Parsing Chair(s): Philipp Haller

Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs. LINQ and ORM can be used for the integration, but they have issues with flexibility: query decomposition and reusing of subqueries are a challenge. Adaptation of parser combinators technique for paths querying may solve these problems. Conventional parser combinators process linear input, and only the Trails library is known to apply this technique for path querying. Trails suffers the common parser combinators issue: it does not support left-recursive grammars and also experiences problems in cycles handling. We demonstrate that it is possible to create general parser combinators for CFPQ which support arbitrary context-free grammars and arbitrary input graphs. We implement a library of such parser combinators and show that it is applicable for realistic tasks.

Fri 28 Sep
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

scala-2018-papers
13:10 - 14:40: Scala 2018 - Session 2: Scala Extensions & Parsing at Frisco
Chair(s): Philipp HallerKTH, Sweden
scala-2018-papers13:10 - 13:32
Talk
Jamie WillisUniversity of Bristol, UK, Nicolas WuUniversity of Bristol, UK
DOI
scala-2018-papers13:32 - 13:55
Talk
Denys ShabalinEPFL, Switzerland, Martin OderskyEPFL, Switzerland
DOI
scala-2018-papers13:55 - 14:17
Talk
Ekaterina VerbitskaiaSaint Petersburg State University, Russia, Ilya KirillovSaint Petersburg State University, Russia, Ilya NozkinSaint Petersburg State University, Russia, Semyon GrigorevSaint Petersburg State University, Russia
DOI
scala-2018-papers14:17 - 14:40
Talk
Nicolas StuckiEPFL, Switzerland, Paolo G. GiarrussoEPFL, Switzerland, Martin OderskyEPFL, Switzerland
DOI