|
|
| Line 1: |
Line 1: |
| − | [[Category:Combinators]]
| |
| − | [[Category:Libraries]]
| |
| − | ==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.
| |
| − |
| |
| − | ==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.
| |