Personal tools

GraphParserCombinators

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
m
m
 
(One intermediate revision by one user not shown)
Line 1: Line 1:
  +
[[Category:Combinators]]
  +
[[Category:Libraries]]
 
==What are Graph Parser Combinators?==
 
==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 language.
+
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 (http://www.steffen-mazanek.de/dateien/talks/Graph_Parser_Combinators_IFL07.ppt).
 
Please have a look at the introductory talk that has been presented at IFL'07 (http://www.steffen-mazanek.de/dateien/talks/Graph_Parser_Combinators_IFL07.ppt).

Latest revision as of 13:51, 28 September 2007

[edit] 1 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 (http://www.steffen-mazanek.de/dateien/talks/Graph_Parser_Combinators_IFL07.ppt).

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

[edit] 2 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.