<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>gibeson</author><text>Still reading through, it&apos;s definitely piqued my interest. However, in the interest of consistency [as it translates to readability] two issues right away:&lt;p&gt;1) Get rid of the infix modifier to the filter. The statement is made that in ANI everything flows left to right. The infix operator while providing familiar 1+6-&amp;#62;7 notation conflicts with the above flow statement. 1,6+-&amp;#62;7 while not immediately familiar is easy to understand after explained. However, added special case rules for infix operation muddies the water.&lt;p&gt;2) In the following code sample provided, the left to right rule is again not followed and thus leads to increased difficulty in [human] parsing:&lt;p&gt;multiPrint= [string\ s, int\ times] {&lt;p&gt;&lt;pre&gt;&lt;code&gt;        \\[std.gen] &amp;#60;- \times s -&amp;#62;std.out;
&lt;/code&gt;&lt;/pre&gt;
};&lt;p&gt;&quot;Hello, World!\n&quot;, 10 -&amp;#62;multiPrint;&lt;p&gt;Instead, to be consistent and follow the previous left to right flow rule, use the following syntax:&lt;p&gt;multiPrint= [string\ s, int\ times] {&lt;p&gt;&lt;pre&gt;&lt;code&gt;        \times -&amp;#62; \\[std.gen];

        s -&amp;#62;std.out;
&lt;/code&gt;&lt;/pre&gt;
};&lt;p&gt;&quot;Hello, World!\n&quot;, 10 -&amp;#62;multiPrint;&lt;p&gt;In general if there is an everything flows left to right rule, there should not be a &amp;#60;- operator.&lt;p&gt;imho</text><parent_chain></parent_chain></comment><story><title>Anic -- Faster than C, Safer than Java, Simpler than *sh</title><url>http://code.google.com/p/anic/wiki/Tutorial</url><text>ANI is a dataflow programming language, with strong typing, implicit parallelism, oop and the beggining of an implementation.&lt;p&gt;&quot;Q: How does ANI resolve the fundamental issue of deadlock in parallel programming? How does the Dining Philosophers example on the main page work?&lt;p&gt;A: In ANI, under the hood, pipes implicitly enforce total resource orderings for acquiring data. Somewhat surprisingly, deadlock theory guarantees that there will be no deadlock if this condition is met.&quot;</text></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>milkshakes</author><text>gotta love the url
&lt;i&gt;&lt;a href=&quot;http://code.google.com/p/anic/&quot; rel=&quot;nofollow&quot;&gt;http://code.google.com/p/anic/&lt;/a&gt; &lt;/i&gt;</text><parent_chain></parent_chain></comment><story><title>Anic -- Faster than C, Safer than Java, Simpler than *sh</title><url>http://code.google.com/p/anic/wiki/Tutorial</url><text>ANI is a dataflow programming language, with strong typing, implicit parallelism, oop and the beggining of an implementation.&lt;p&gt;&quot;Q: How does ANI resolve the fundamental issue of deadlock in parallel programming? How does the Dining Philosophers example on the main page work?&lt;p&gt;A: In ANI, under the hood, pipes implicitly enforce total resource orderings for acquiring data. Somewhat surprisingly, deadlock theory guarantees that there will be no deadlock if this condition is met.&quot;</text></story>