From HaskellWiki
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

What are Graph Parser Combinators?

Graph Parser Combinators are a new and attractive approach to graph parsing. They are inspired by the popular concept of parser combinators for string languages like implemented in the libraries Polyparse or Parsec.

Please have a look at the introductory talk that has been presented at IFL'07 (

Please send any questions and suggestions to steffen.mazanek (at)

Where can I get them?

Be patient for the moment. A cabalized version of the library will be made available soon. If someone would like to host the darcs source of the library this would also be appreciated.