<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: smitchell2</title><link>https://news.ycombinator.com/user?id=smitchell2</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 18 Nov 2026 04:40:08 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=smitchell2" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by smitchell2 in "Ask HN: How did you learn parsing?"]]></title><description><![CDATA[
<p>I would suggest Recursive Descent for general parsing, and Precedence Climbing for expressions.<p>Once you get the hang of Recursive Descent, parsing becomes mechanical.  And with Precedence Climbing for expressions, you just plug in the appropriate operator priorities.<p>Some of the literature below refers to "parsing" as "syntax analysis".<p>See this introductory set of articles:<p><a href="https://www.semware.com/html/compiler.html" rel="nofollow">https://www.semware.com/html/compiler.html</a><p>Then see this (small, 160 page) book from Wirth:<p><a href="http://www.ethoberon.ethz.ch/WirthPubl/CBEAll.pdf" rel="nofollow">http://www.ethoberon.ethz.ch/WirthPubl/CBEAll.pdf</a><p>See examples here - especially the C and Python examples: (lexical analysis examples included, since it must feed the parser)<p><a href="http://rosettacode.org/wiki/Compiler/lexical_analyzer" rel="nofollow">http://rosettacode.org/wiki/Compiler/lexical_analyzer</a><p><a href="http://rosettacode.org/wiki/Compiler/syntax_analyzer" rel="nofollow">http://rosettacode.org/wiki/Compiler/syntax_analyzer</a></p>
]]></description><pubDate>Wed, 17 Apr 2019 17:43:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=19684721</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=19684721</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=19684721</guid></item><item><title><![CDATA[New comment by smitchell2 in "Build Your Own Text Editor"]]></title><description><![CDATA[
<p>Thanks for the kind words.  
I was forced to change the name a few years back (1992) - it is now called TSE, or The Semware Editor.<p>Unlearn Wordstar key bindings?  Isn't that sacrilege? :-)</p>
]]></description><pubDate>Fri, 07 Apr 2017 11:19:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=14058774</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=14058774</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14058774</guid></item><item><title><![CDATA[New comment by smitchell2 in "Build Your Own Text Editor"]]></title><description><![CDATA[
<p>I wrote one back in 1984-85 that I called QEdit, and have been using and updating it ever since.</p>
]]></description><pubDate>Thu, 06 Apr 2017 14:28:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=14050783</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=14050783</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14050783</guid></item><item><title><![CDATA[Call for compiler hackers]]></title><description><![CDATA[
<p>I've created some compiler related tasks on RosettaCode. The goal is to create a simple compiler in small pieces: Scanner, Parser, Code Generator, and Virtual Machine Interpreter tasks have been created.<p><pre><code>    Scanner
        http://rosettacode.org/wiki/Compiler/lexical_analyzer
    Parser
        http://rosettacode.org/wiki/Compiler/syntax_analyzer
    Code Generator
        http://rosettacode.org/wiki/Compiler/code_generator
    Virtual Machine Interpreter
        http://rosettacode.org/wiki/Compiler/virtual_machine_interpreter
</code></pre>
In order to keep the actual solutions smallish, the language is necessarily very simple - a Tiny (mostly) subset of C, with only integer variables.<p><pre><code>    /*
     Simple prime number generator
     */
    count = 1;
    n = 1;
    limit = 100;
    while (n < limit) {
        k=3;
        p=1;
        n=n+2;
        while ((k*k<=n) && (p)) {
            p=n/k*k!=n;
            k=k+2;
        }
        if (p) {
            print(n, " is prime\n");
            count = count + 1;
        }
    }
    print("Total primes found: ", count, "\n");
</code></pre>
There are currently implementations of all the main tasks in Algol W, AWK, C, Phix, Python and Scheme.<p>I'm especially interested in seeing implementations in other languages, including Java, C++, C#, Haskell, OCaml, Clojure, Racket, Erlang, Pascal, Nim, PHP, Javascript, Julia, F# and any others you can think of.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=13757271">https://news.ycombinator.com/item?id=13757271</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 28 Feb 2017 19:58:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=13757271</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=13757271</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13757271</guid></item><item><title><![CDATA[New comment by smitchell2 in "Ask HN: Survey: Scripting languages for realtime applications"]]></title><description><![CDATA[
<p>Three that I've dabbled with are:<p><pre><code>    - Euphoria   (http://openeuphoria.org/)
    - Wren       (http://wren.io/)
    - ChaiScript (http://chaiscript.com/)
</code></pre>
Of those three, Euphoria is possibly the most widely used.  It has also been around the longest - since 1993.</p>
]]></description><pubDate>Thu, 23 Feb 2017 16:17:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=13715065</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=13715065</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13715065</guid></item><item><title><![CDATA[New comment by smitchell2 in "Turbo Pascal Compiler (2013)"]]></title><description><![CDATA[
<p>Back in 1984, I purchased Turbo Pascal 2, and had several decent contracts writing various sorts of software.<p>In 1985 I wrote a simple programmers text editor in it (I really had no idea what I was doing - I learned as I went along), and released it as shareware.<p>Folks started sending me checks, and by 1988 I had to hire staff to help me process and ship orders, do tech support, and so on.<p>We peaked at 15 employees in the mid-90's.  While I eventually converted everything to C, I still have very fond memories of Turbo Pascal.  Those were the days!</p>
]]></description><pubDate>Tue, 24 Jan 2017 21:20:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=13475590</link><dc:creator>smitchell2</dc:creator><comments>https://news.ycombinator.com/item?id=13475590</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13475590</guid></item></channel></rss>