<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/draganigajic/grammar"><title>BibSonomy bookmarks for /user/draganigajic/grammar</title><link>https://www.bibsonomy.org/user/draganigajic/grammar</link><description>BibSonomy RSS Feed for /user/draganigajic/grammar</description><items><rdf:Seq><rdf:li rdf:resource="http://aurochs.fr/"/><rdf:li rdf:resource="http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem"/><rdf:li rdf:resource="http://repetae.net/computer/frisby/"/><rdf:li rdf:resource="http://blogs.msdn.com/ralflammel/default.aspx"/><rdf:li rdf:resource="http://www.program-transformation.org/Transform/GrammarBasedDefinitionOfMetaprogrammingSystems"/><rdf:li rdf:resource="http://www.brics.dk/metafront/"/><rdf:li rdf:resource="http://www.themillionsblog.com/2009/02/diagramming-obama-sentence.html"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Affix_grammar"/><rdf:li rdf:resource="http://www.agfl.cs.ru.nl/"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Adaptive_grammar"/><rdf:li rdf:resource="http://ironmeta.sourceforge.net/"/><rdf:li rdf:resource="http://teaching.idallen.com/cst8152/98w/recursive_decent_parsing.html"/><rdf:li rdf:resource="http://www.mollypages.org/page/grammar/index.mp"/><rdf:li rdf:resource="http://tata.gforge.inria.fr/"/><rdf:li rdf:resource="http://www.gratra.org/"/><rdf:li rdf:resource="http://www.eclipse.org/imp/"/><rdf:li rdf:resource="http://www.devincook.com/goldparser/"/></rdf:Seq></items></channel><item rdf:about="http://aurochs.fr/"><title>The Aurochs parser generator</title><description></description><link>http://aurochs.fr/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:16+02:00</dc:date><dc:subject>C PEG demo generator grammar java ocaml parser parsing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:16+02:00&#034; href=&#034;http://aurochs.fr/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://aurochs.fr/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/C"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PEG"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/demo"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generator"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ocaml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parsing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem"><title>HUT / Attribute Grammar System</title><description></description><link>http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:01+02:00</dc:date><dc:subject>grammar haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:01+02:00&#034; href=&#034;http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://repetae.net/computer/frisby/"><title>Text.Parsers.Frisby</title><description></description><link>http://repetae.net/computer/frisby/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:00+02:00</dc:date><dc:subject>PEG grammar haskell packrat parser parsing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:00+02:00&#034; href=&#034;http://repetae.net/computer/frisby/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://repetae.net/computer/frisby/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PEG"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/packrat"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parsing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blogs.msdn.com/ralflammel/default.aspx"><title>Grammarware, Haskellware, XMLware</title><description></description><link>http://blogs.msdn.com/ralflammel/default.aspx</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:33+02:00</dc:date><dc:subject>blog grammar haskell linq people rLammel xml </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:33+02:00&#034; href=&#034;http://blogs.msdn.com/ralflammel/default.aspx&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://blogs.msdn.com/ralflammel/default.aspx&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linq"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/rLammel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/xml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.program-transformation.org/Transform/GrammarBasedDefinitionOfMetaprogrammingSystems"><title>Program Transformation Wiki / Grammar Based Definition Of ...</title><description>Grammar Based Definition Of Metaprogramming Systems Program-Transformation.Org: The Program Transformation Wiki Robert Cameron? and Robert Ito?. Grammar-Based Definition of Metaprogramming Systems. ACM Transactions on Programming Languages and Systems Vol. 6, No. 1, January 1984, Pages 20-54. (ACM Digital Library)  Summary  This paper describes the GRAMPS method for meta-programming. GRAMPS stands for GRAmmar-based MetaProgramming Scheme. The method basically describes how abstract syntax tree? manipulation can be done in a general-purpose programming language. Given an API for analyzing and constructing syntax trees, transformations can be expressed.</description><link>http://www.program-transformation.org/Transform/GrammarBasedDefinitionOfMetaprogrammingSystems</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:21+02:00</dc:date><dc:subject>grammar metaprogramming wiki </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Grammar Based Definition Of Metaprogramming Systems Program-Transformation.Org: The Program Transformation Wiki Robert Cameron? and Robert Ito?. Grammar-Based Definition of Metaprogramming Systems. ACM Transactions on Programming Languages and Systems Vol. 6, No. 1, January 1984, Pages 20-54. (ACM Digital Library)  Summary  This paper describes the GRAMPS method for meta-programming. GRAMPS stands for GRAmmar-based MetaProgramming Scheme. The method basically describes how abstract syntax tree? manipulation can be done in a general-purpose programming language. Given an API for analyzing and constructing syntax trees, transformations can be expressed.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/metaprogramming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wiki"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.brics.dk/metafront/"><title>metafront</title><description>EXTENSIBLE PARSING &amp; TRANSFORMATION We present the metafront tool for specifying flexible, safe, and efficient syntactic transformations between languages defined by context-free grammars. The transformations are guaranteed to terminate and to map grammatically legal input to grammatically legal output. We rely on a novel parser algorithm, specificity parsing, that is designed to support gradual extensions of a grammar by allowing productions to remain in a natural style and by statically reporting ambiguities and errors in terms of individual productions as they are being added. Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator for domain-specific languages. We show substantial examples of both kinds.</description><link>http://www.brics.dk/metafront/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:21+02:00</dc:date><dc:subject>algorithm brics compiler generator grammar java parser syntax transformation </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;EXTENSIBLE PARSING &amp;amp; TRANSFORMATION We present the metafront tool for specifying flexible, safe, and efficient syntactic transformations between languages defined by context-free grammars. The transformations are guaranteed to terminate and to map grammatically legal input to grammatically legal output. We rely on a novel parser algorithm, specificity parsing, that is designed to support gradual extensions of a grammar by allowing productions to remain in a natural style and by statically reporting ambiguities and errors in terms of individual productions as they are being added. Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator for domain-specific languages. We show substantial examples of both kinds.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/brics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generator"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/syntax"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transformation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.themillionsblog.com/2009/02/diagramming-obama-sentence.html"><title>Diagramming the Obama Sentence - The Millions</title><description></description><link>http://www.themillionsblog.com/2009/02/diagramming-obama-sentence.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:05+02:00</dc:date><dc:subject>grammar language obama politics visualization </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:05+02:00&#034; href=&#034;http://www.themillionsblog.com/2009/02/diagramming-obama-sentence.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.themillionsblog.com/2009/02/diagramming-obama-sentence.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/language"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/obama"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/politics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Affix_grammar"><title>Affix grammar - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Affix_grammar</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:58+02:00</dc:date><dc:subject>cs grammar parser wikipedia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:58+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Affix_grammar&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Affix_grammar&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.agfl.cs.ru.nl/"><title>The AGFL Grammar Work Lab</title><description></description><link>http://www.agfl.cs.ru.nl/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:58+02:00</dc:date><dc:subject>english grammar latin nlp parser </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:58+02:00&#034; href=&#034;http://www.agfl.cs.ru.nl/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.agfl.cs.ru.nl/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/english"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/latin"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nlp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Adaptive_grammar"><title>Adaptive grammar - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Adaptive_grammar</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:57+02:00</dc:date><dc:subject>ai grammar wikipedia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:57+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Adaptive_grammar&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Adaptive_grammar&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ai"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/></rdf:Bag></taxo:topics></item><item rdf:about="http://ironmeta.sourceforge.net/"><title>IronMeta User Manual and Code Documentation: IronMeta User Manual</title><description></description><link>http://ironmeta.sourceforge.net/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:57+02:00</dc:date><dc:subject>PEG dotnet grammar languages ometa parser programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:57+02:00&#034; href=&#034;http://ironmeta.sourceforge.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://ironmeta.sourceforge.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PEG"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dotnet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/languages"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ometa"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://teaching.idallen.com/cst8152/98w/recursive_decent_parsing.html"><title>CST 8152 - Recursive Decent Parsing</title><description></description><link>http://teaching.idallen.com/cst8152/98w/recursive_decent_parsing.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:57+02:00</dc:date><dc:subject>compiler grammar parser parsing tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:57+02:00&#034; href=&#034;http://teaching.idallen.com/cst8152/98w/recursive_decent_parsing.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://teaching.idallen.com/cst8152/98w/recursive_decent_parsing.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parsing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mollypages.org/page/grammar/index.mp"><title>Grammars and Parsers</title><description></description><link>http://www.mollypages.org/page/grammar/index.mp</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:57+02:00</dc:date><dc:subject>compiler examples grammar parsing tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:57+02:00&#034; href=&#034;http://www.mollypages.org/page/grammar/index.mp&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.mollypages.org/page/grammar/index.mp&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/examples"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parsing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://tata.gforge.inria.fr/"><title>Tata, the book</title><description></description><link>http://tata.gforge.inria.fr/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:54+02:00</dc:date><dc:subject>algorithm automata book cs grammar graph logic research treeAutomata xml </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:54+02:00&#034; href=&#034;http://tata.gforge.inria.fr/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://tata.gforge.inria.fr/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/automata"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/treeAutomata"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/xml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.gratra.org/"><title>Graph Transformation and Graph Grammars</title><description></description><link>http://www.gratra.org/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:51+02:00</dc:date><dc:subject>grammar graph hypertext math research semantics theory transformation </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:51+02:00&#034; href=&#034;http://www.gratra.org/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.gratra.org/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hypertext"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/semantics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transformation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.eclipse.org/imp/"><title>IMP</title><description>supercedes asf+sdf meta enviro</description><link>http://www.eclipse.org/imp/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:50+02:00</dc:date><dc:subject>development dsl eclipse framework grammar ide imp </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;supercedes asf+sdf meta enviro&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/development"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dsl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/eclipse"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/framework"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ide"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/imp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.devincook.com/goldparser/"><title>GOLD Parsing System - A Free, Multi-Programming Language, Parser Generator</title><description></description><link>http://www.devincook.com/goldparser/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:11:41+02:00</dc:date><dc:subject>.net compiler grammar parser programming tools </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:11:41+02:00&#034; href=&#034;http://www.devincook.com/goldparser/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.devincook.com/goldparser/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/.net"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/grammar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parser"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics></item></rdf:RDF>