<?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/bnf"><title>BibSonomy bookmarks for /user/draganigajic/bnf</title><link>https://www.bibsonomy.org/user/draganigajic/bnf</link><description>BibSonomy RSS Feed for /user/draganigajic/bnf</description><items><rdf:Seq><rdf:li rdf:resource="http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/"/><rdf:li rdf:resource="http://code.google.com/p/cruiser/wiki/Parse"/><rdf:li rdf:resource="http://www.willamette.edu/~fruehr/254/grammar/haskell.html"/></rdf:Seq></items></channel><item rdf:about="http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/"><title>The BNF Converter</title><description></description><link>http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:41+02:00</dc:date><dc:subject>bnf compiler </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:41+02:00&#034; href=&#034;http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bnf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/></rdf:Bag></taxo:topics></item><item rdf:about="http://code.google.com/p/cruiser/wiki/Parse"><title>Parse - cruiser - Google Code</title><description></description><link>http://code.google.com/p/cruiser/wiki/Parse</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:17+02:00</dc:date><dc:subject>*read bnf compiler generator javascript library metaprogramming parser parsing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:17+02:00&#034; href=&#034;http://code.google.com/p/cruiser/wiki/Parse&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://code.google.com/p/cruiser/wiki/Parse&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bnf"/><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/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/metaprogramming"/><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.willamette.edu/~fruehr/254/grammar/haskell.html"><title>A Simplified Grammar for Haskell</title><description></description><link>http://www.willamette.edu/~fruehr/254/grammar/haskell.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:44+02:00</dc:date><dc:subject>*unseen bnf haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:44+02:00&#034; href=&#034;http://www.willamette.edu/~fruehr/254/grammar/haskell.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.willamette.edu/~fruehr/254/grammar/haskell.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*unseen"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bnf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item></rdf:RDF>