Write a Blog >>
Sun 22 - Fri 27 October 2017 Vancouver, Canada
Sun 22 Oct 2017 09:30 - 10:00 at Oxford - Session 1 Chair(s): Eric Van Wyk

Nowadays input data for parsing algorithms are not limited to be linear strings, and context-free grammars are used not only for programming languages specication. One classical example is context-free path querying for graph data bases where an input is a graph and path constraints are specied by a grammar. Graph parsing may nd an application in dierent areas: in software engineering for dynamically generated strings analysis, in graph data bases for paths querying, etc. Our group is working on several questions posed in this area which still do not have satisfying solutions. We present our efforts which are mostly aimed at improving performance, lifting up limitations on an input and nding new elds of application for graph parsing.

Sun 22 Oct

08:30 - 10:00: Parsing@SLE 2017 - Session 1 at Oxford
Chair(s): Eric Van WykUniversity of Minnesota, USA
parsing-2017150865470000008:45 - 09:00
Day opening
Eric Van WykUniversity of Minnesota, USA, Jurgen VinjuCentrum Wiskunde & Informatica / Technische Universiteit Eindhoven
parsing-2017150865560000009:00 - 09:30
Abhinav JangdaUniversity of Massachusetts, Amherst
parsing-2017150865740000009:30 - 10:00