<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/feed.rss.xml" type="text/xsl" media="screen"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Zach Schneider</title>
    <description/>
    <link>https://speakerdeck.com/schneidmaster</link>
    <atom:link rel="self" type="application/rss+xml" href="https://speakerdeck.com/schneidmaster.rss"/>
    <lastBuildDate>2018-11-02 11:37:51 -0400</lastBuildDate>
    <item>
      <title>Finding meaning: grammars, lexers, and parsers</title>
      <description>Have you ever wondered how your computer figures out the meaning of your code? Humans can quickly get lost, but the computer always keeps up, no matter how deeply you nest those conditionals. In this session, we'll learn how computers use lexers and parsers to determine the meaning of code (or any other structured syntax) in accordance to a particular grammar. We'll discuss some of the theory behind grammars, and the role of context in grammars (and human languages). And we'll walk through the eqn gem (https://github.com/schneidmaster/eqn) which applies these principles and uses a parser generator to safely evaluate mathematical equation strings in ruby.</description>
      <media:content url="https://files.speakerdeck.com/presentations/0922f47db60b4b009a3db289162858dd/preview_slide_0.jpg?11126573" type="image/jpeg" medium="image"/>
      <content:encoded>Have you ever wondered how your computer figures out the meaning of your code? Humans can quickly get lost, but the computer always keeps up, no matter how deeply you nest those conditionals. In this session, we'll learn how computers use lexers and parsers to determine the meaning of code (or any other structured syntax) in accordance to a particular grammar. We'll discuss some of the theory behind grammars, and the role of context in grammars (and human languages). And we'll walk through the eqn gem (https://github.com/schneidmaster/eqn) which applies these principles and uses a parser generator to safely evaluate mathematical equation strings in ruby.</content:encoded>
      <pubDate>Thu, 01 Nov 2018 00:00:00 -0400</pubDate>
      <link>https://speakerdeck.com/schneidmaster/finding-meaning-grammars-lexers-and-parsers</link>
      <guid>https://speakerdeck.com/schneidmaster/finding-meaning-grammars-lexers-and-parsers</guid>
    </item>
  </channel>
</rss>
