From HaskellWiki
Revision as of 10:12, 20 April 2021 by Atravers (talk | contribs) (To be deleted if no new content appears...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.