Difference between revisions of "GraphParserCombinators"
Jump to navigation
Jump to search
(page GraphParserCombinators created) |
m |
||
| Line 2: | Line 2: | ||
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 language. |
||
| − | Please have a look at the introductory |
+ | 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. |
Please send any questions and suggestions to steffen.mazanek (at) unibw.de. |
||
Revision as of 13:31, 28 September 2007
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.
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.