%0 Book Section %1 citeulike:12883484 %A Mazanek, Steffen %A Minas, Mark %B Implementation and Application of Functional Languages %D 2008 %E Chitil, Olaf %E Horváth, Zoltán %E Zsók, Viktória %I Springer Berlin Heidelberg %K 68r10-computer-science-graph-theory 68n18-functional-programming-and-lambda-calculus %P 1--18 %R 10.1007/978-3-540-85373-2\_1 %T Graph Parser Combinators %U http://dx.doi.org/10.1007/978-3-540-85373-2\_1 %V 5083 %X 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 languages that crush most general-purpose graph parsers. In this paper we present graph parser combinators, a new approach to graph parsing inspired by the well-known string parser combinators. The basic idea is to define primitive graph parsers for elementary graph components and a set of combinators for the construction of more advanced graph parsers. Using graph parser combinators special-purpose graph parsers can be composed conveniently. Thereby, language-specific performance optimizations can be incorporated in a flexible manner.

@incollection{citeulike:12883484, abstract = {{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 languages that crush most general-purpose graph parsers. In this paper we present graph parser combinators, a new approach to graph parsing inspired by the well-known string parser combinators. The basic idea is to define primitive graph parsers for elementary graph components and a set of combinators for the construction of more advanced graph parsers. Using graph parser combinators special-purpose graph parsers can be composed conveniently. Thereby, language-specific performance optimizations can be incorporated in a flexible manner.}}, added-at = {2017-06-29T07:13:07.000+0200}, author = {Mazanek, Steffen and Minas, Mark}, biburl = {https://www.bibsonomy.org/bibtex/25e63394c0d4a506b840539f3e6eefee3/gdmcbain}, booktitle = {Implementation and Application of Functional Languages}, citeulike-article-id = {12883484}, citeulike-attachment-1 = {mazanek_07_graph.pdf; /pdf/user/gdmcbain/article/12883484/939260/mazanek_07_graph.pdf; 12179cdd551141b335f59ae4a7131dfafbaa43e7}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-85373-2\_1}, citeulike-linkout-1 = {http://link.springer.com/chapter/10.1007/978-3-540-85373-2\_1}, doi = {10.1007/978-3-540-85373-2\_1}, editor = {Chitil, Olaf and Horv\'{a}th, Zolt\'{a}n and Zs\'{o}k, Vikt\'{o}ria}, file = {mazanek_07_graph.pdf}, interhash = {0f97c82afdc1338da0569cde55010be5}, intrahash = {5e63394c0d4a506b840539f3e6eefee3}, keywords = {68r10-computer-science-graph-theory 68n18-functional-programming-and-lambda-calculus}, pages = {1--18}, posted-at = {2013-12-29 23:15:46}, priority = {2}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2019-03-25T06:13:01.000+0100}, title = {{Graph Parser Combinators}}, url = {http://dx.doi.org/10.1007/978-3-540-85373-2\_1}, volume = 5083, year = 2008 }