Write a Blog >>
SPLASH 2017
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

Displayed time zone: Tijuana, Baja California change

08:30 - 10:00
Session 1Parsing@SLE at Oxford
Chair(s): Eric Van Wyk University of Minnesota, USA
08:45
15m
Day opening
Welcome
Parsing@SLE
Eric Van Wyk University of Minnesota, USA, Jurgen Vinju Centrum Wiskunde & Informatica / Technische Universiteit Eindhoven
09:00
30m
Talk
Block Level Parallelism in Parsing Block Structured Languages
Parsing@SLE
Abhinav Jangda University of Massachusetts, Amherst
09:30
30m
Talk
Parsing techniques for graph analysis
Parsing@SLE