<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (mncaudill)</title>
    <link>https://pinboard.in/u:mncaudill/public/</link>
    <description>recent bookmarks from mncaudill</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://swtch.com/~rsc/regexp/regexp2.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://swtch.com/~rsc/regexp/regexp2.html">
    <title>Regular Expression Matching: the Virtual Machine Approach</title>
    <dc:date>2009-12-14T15:35:19+00:00</dc:date>
    <link>http://swtch.com/~rsc/regexp/regexp2.html</link>
    <dc:creator>mncaudill</dc:creator><description><![CDATA["This article presents two strategies as two different ways to implement a virtual machine that executes a regular expression that has been compiled into text-matching bytecodes, just like .NET and Mono are different ways to implement a virtual machine that executes a program that has been compiled into CLI bytecodes."
]]></description>
<dc:subject>programming reference algorithms compsci vm parsing</dc:subject>
<dc:identifier>https://pinboard.in/u:mncaudill/b:2b77490f3715/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:compsci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:vm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mncaudill/t:parsing"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>