Parsing techniques for graph analysis
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 (GMT-07:00) Tijuana, Baja California change
|08:45 - 09:00|
|09:00 - 09:30|
Abhinav JangdaUniversity of Massachusetts, Amherst
|09:30 - 10:00|