research-article

Parser combinators for context-free path querying

Authors:

Ekaterina Verbitskaia,

Semyon GrigorevAuthors Info & Claims

Scala 2018: Proceedings of the 9th ACM SIGPLAN International Symposium on Scala

Pages 13 - 23

https://doi.org/10.1145/3241653.3241655

Published: 17 September 2018 Publication History

Abstract

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.

References

[1]

Pablo Barceló, Gaelle Fontaine, and Anthony Widjaja Lin. 2013. Expressive Path Queries on Graphs with Data. In International Conference on Logic for Programming Artificial Intelligence and Reasoning. Springer, 71-85.

[2]

Osbert Bastani, Saswat Anand, and Alex Aiken. 2015. Specification inference using context-free language reachability. In ACM SIGPLAN Notices, Vol. 50. ACM, 553-566.

Digital Library

[3]

Tevfik Bultan, Fang Yu, Muath Alkhalaf, and Abdulbaki Aydin. 2018. String Analysis for Software Verification and Security.

Digital Library

[4]

James Cheney, Sam Lindley, and Philip Wadler. 2013. A Practical Theory of Language-integrated Query. SIGPLAN Not. 48, 9 (Sept. 2013), 403-416.

Digital Library

[5]

Andrei Marian Dan, Manu Sridharan, Satish Chandra, Jean-Baptiste Jeannin, and Martin Vechev. 2017. Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts. In International Conference on Computer Aided Verification. Springer, 521-541.

[6]

Semyon Grigorev and Anastasiya Ragozina. 2017. Context-free Path Querying with Structural Representation of Result. In Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia (CEE-SECR '17). ACM, New York, NY, USA, Article 10, 7 pages.

Digital Library

[7]

Jelle Hellings. 2014. Conjunctive context-free path queries. (2014).

[8]

Jelle Hellings. 2015. Path Results for Context-free Grammar Queries on Graphs. CoRR abs/1502.02242 (2015). http://arxiv.org/abs/1502.02242

[9]

Wei Huang, Yao Dong, Ana Milanova, and Julian Dolby. 2015. Scalable and precise taint analysis for android. In Proceedings of the 2015 International Symposium on Software Testing and Analysis. ACM, 106-117.

Digital Library

[10]

Anastasia Izmaylova, Ali Afroozeh, and Tijs van der Storm. 2016. Practical, General Parser Combinators. In Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM '16). ACM, New York, NY, USA, 1-12.

Digital Library

[11]

Mark Johnson. 1995. Memoization in Top-down Parsing. Comput. Linguist. 21, 3 (Sept. 1995), 405-417. http://dl.acm.org/citation.cfm?id=216261.216269

Digital Library

[12]

Daniel Kröni and Raphael Schweizer. 2013. Parsing Graphs: Applying Parser Combinators to Graph Traversals. In Proceedings of the 4th Workshop on Scala (SCALA '13). ACM, New York, NY, USA, Article 7, 4 pages.

Digital Library

[13]

Kazumasa Kumamoto, Toshiyuki Amagasa, and Hiroyuki Kitagawa. 2015. A System for Querying RDF Data Using LINQ. In Network-Based Information Systems (NBiS), 2015 18th International Conference on. IEEE, 452-457.

Digital Library

[14]

Thomas J. Marlowe, William G. Landi, Barbara G. Ryder, Jong-Deok Choi, Michael G. Burke, and Paul Carini. 1993. Pointer-induced Aliasing: A Clarification. SIGPLAN Not. 28, 9 (Sept. 1993), 67-70.

Digital Library

[15]

Erik Meijer, Brian Beckman, and Gavin Bierman. 2006. LINQ: Reconciling Object, Relations and XML in the.NET Framework. In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (SIGMOD '06). ACM, New York, NY, USA, 706-706.

Digital Library

[16]

A. Mendelzon and P. Wood. 1995. Finding Regular Simple Paths in Graph Databases. SIAM J. Computing 24, 6 (1995), 1235-1258.

Digital Library

[17]

Alexander Okhotin. 2003. On the Closure Properties of Linear Conjunctive Languages. Theor. Comput. Sci. 299, 1 (April 2003), 663-685.

Digital Library

[18]

Polyvios Pratikakis, Jeffrey S Foster, and Michael Hicks. 2006. Existential label flow inference via CFL reachability. In SAS, Vol. 6. Springer, 88-106.

Digital Library

[19]

Eric Prud, Andy Seaborne, et al. 2006. SPARQL query language for RDF. (2006).

[20]

Joan Gerard Rekers. 1992. Parser generation for interactive environments. Ph.D. Dissertation. Universiteit van Amsterdam.

[21]

Thomas Reps. 1997. Program Analysis via Graph Reachability. In Proceedings of the 1997 International Symposium on Logic Programming (ILPS '97). MIT Press, Cambridge, MA, USA, 5-19. http://dl.acm.org/citation.cfm?id=271338.271343

Digital Library

[22]

Thomas Reps, Susan Horwitz, and Mooly Sagiv. 1995. Precise Interprocedural Dataflow Analysis via Graph Reachability. In Proceedings of the 22Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '95). ACM, New York, NY, USA, 49-61.

Digital Library

[23]

Juan L Reutter, Miguel Romero, and Moshe Y Vardi. 2015. Regular queries on graph databases. Theory of Computing Systems (2015), 1-53.

Digital Library

[24]

Marko A Rodriguez. 2015. The gremlin graph traversal machine and language (invited talk). In Proceedings of the 15th Symposium on Database Programming Languages. ACM, 1-10.

Digital Library

[25]

Elizabeth Scott and Adrian Johnstone. 2010. GLL parsing. Electronic Notes in Theoretical Computer Science 253, 7 (2010), 177-189.

Digital Library

[26]

Elizabeth Scott and Adrian Johnstone. 2013. GLL parse-tree generation. Science of Computer Programming 78, 10 (2013), 1828-1844.

Digital Library

[27]

Elizabeth Scott, Adrian Johnstone, and Rob Economopoulos. 2007. BRNGLR: a cubic Tomita-style GLR parsing algorithm. Acta informatica 44, 6 (2007), 427-461.

Digital Library

[28]

Petteri Sevon and Lauri Eronen. 2008. Subgraph queries by context-free grammars. Journal of Integrative Bioinformatics 5, 2 (2008), 100.

[29]

Kai Wang, Aftab Hussain, Zhiqiang Zuo, Guoqing Xu, and Ardalan Amiri Sani. 2017. Graspan: A Single-machine Disk-based Graph System for Interprocedural Static Analyses of Large-scale Systems Code. In Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '17). ACM, New York, NY, USA, 389-404.

Digital Library

[30]

Dacong Yan, Guoqing Xu, and Atanas Rountev. 2011. Demand-driven Context-sensitive Alias Analysis for Java. In Proceedings of the 2011 International Symposium on Software Testing and Analysis (ISSTA '11). ACM, New York, NY, USA, 155-165.

Digital Library

[31]

Mihalis Yannakakis. 1990. Graph-theoretic methods in database theory. In Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. ACM, 230-242.

Digital Library

[32]

Qirun Zhang and Zhendong Su. 2017. Context-sensitive Data-dependence Analysis via Linear Conjunctive Language Reachability. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017). ACM, New York, NY, USA, 344-358.

Digital Library

[33]

Xiaowang Zhang, Zhiyong Feng, Xin Wang, Guozheng Rao, and Wenrui Wu. 2016. Context-free path queries on RDF graphs. In International Semantic Web Conference. Springer, 632-648.

[34]

Xin Zheng and Radu Rugina. 2008. Demand-driven Alias Analysis for C. In Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '08). ACM, New York, NY, USA, 197-208.

Digital Library

Cited By

Azimov REpelbaum IGrigorev SKalavri VYakovets N(2021)Context-free path querying with all-path semantics by matrix multiplicationProceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3461837.3464513(1-7)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3461837.3464513
Terekhov AKhoroshev AAzimov RGrigorev S(2020)Context-Free Path Querying with Single-Path Semantics by Matrix MultiplicationProceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3398682.3399163(1-12)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3398682.3399163
Susanina YMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Context-Free Path Querying via Matrix EquationsProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3384400(2821-2823)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3384400
Show More Cited By

Index Terms

Parser combinators for context-free path querying

Recommendations

Practical, general parser combinators
PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

Parser combinators are a popular approach to parsing where context-free grammars are represented as executable code. However, conventional parser combinators do not support left recursion, and can have worst-case exponential runtime. These limitations ...
Context-free path querying with structural representation of result
CEE-SECR '17: Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia

Graph data model and graph databases are popular in such areas as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars. The query in this approach ...
Graph Parser Combinators
Implementation and Application of Functional Languages

A graph language can be described by a graph grammar in a manner similar to a string grammar known from the theory of formal languages. Unfortunately, graph parsing is known to be computationally expensive in general. There are quite simple graph ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Scala 2018: Proceedings of the 9th ACM SIGPLAN International Symposium on Scala

September 2018

82 pages

ISBN:9781450358361

DOI:10.1145/3241653

General Chair:
Sebastian Erdweg,
Program Chair:
Bruno C. d. S. Oliveira

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 September 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICFP '18

Sponsor:

SIGPLAN

ICFP '18: 23nd ACM SIGPLAN International Conference on Functional Programming

September 28, 2018

MO, St. Louis, USA

Acceptance Rates

Overall Acceptance Rate 5 of 6 submissions, 83%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
157
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Azimov REpelbaum IGrigorev SKalavri VYakovets N(2021)Context-free path querying with all-path semantics by matrix multiplicationProceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3461837.3464513(1-7)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3461837.3464513
Terekhov AKhoroshev AAzimov RGrigorev S(2020)Context-Free Path Querying with Single-Path Semantics by Matrix MultiplicationProceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3398682.3399163(1-12)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3398682.3399163
Susanina YMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Context-Free Path Querying via Matrix EquationsProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3384400(2821-2823)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3384400
Mishin NSokolov ISpirin EKutuev VNemchinov EGorbatyuk SGrigorev S(2019)Evaluation of the Context-Free Path Querying Algorithm Based on Matrix MultiplicationProceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3327964.3328503(1-5)Online publication date: 30-Jun-2019
https://dl.acm.org/doi/10.1145/3327964.3328503

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten