<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Program to convert infix expression to postfix in C &#124; Shunting yard algorithm</title>
	<atom:link href="http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/feed/" rel="self" type="application/rss+xml" />
	<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/</link>
	<description>C, C++, JAVA, PERL programming for Dummies</description>
	<lastBuildDate>Wed, 12 Oct 2011 05:13:50 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Swankey</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-9208</link>
		<dc:creator>Swankey</dc:creator>
		<pubDate>Sun, 07 Nov 2010 12:25:03 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-9208</guid>
		<description>Thanx 4 doing this pgm so easy u have solved my big pblm</description>
		<content:encoded><![CDATA[<p>Thanx 4 doing this pgm so easy u have solved my big pblm</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ABID RIAZ</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-8901</link>
		<dc:creator>ABID RIAZ</dc:creator>
		<pubDate>Sun, 31 Oct 2010 13:46:40 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-8901</guid>
		<description>Thanks Satish its a beautiful program &amp; well organized one .....I found it beneficial!!!</description>
		<content:encoded><![CDATA[<p>Thanks Satish its a beautiful program &amp; well organized one &#8230;..I found it beneficial!!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: navna gupta</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-5171</link>
		<dc:creator>navna gupta</dc:creator>
		<pubDate>Thu, 08 Apr 2010 17:20:54 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-5171</guid>
		<description>this programme is good but i cn&#039;t understand it properly.</description>
		<content:encoded><![CDATA[<p>this programme is good but i cn&#8217;t understand it properly.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: navna gupta</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-5170</link>
		<dc:creator>navna gupta</dc:creator>
		<pubDate>Thu, 08 Apr 2010 17:18:44 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-5170</guid>
		<description>yr plz i give one problem plz solve this i need a programme to convert infix to postfix this expression -5*4/4+6-5*5/7</description>
		<content:encoded><![CDATA[<p>yr plz i give one problem plz solve this i need a programme to convert infix to postfix this expression -5*4/4+6-5*5/7</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Veena</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-4098</link>
		<dc:creator>Veena</dc:creator>
		<pubDate>Wed, 23 Dec 2009 06:53:25 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-4098</guid>
		<description>Thanks for uploading pal..it&#039;s very useful to my practicals..Many thanks.. ( @ _ @ )</description>
		<content:encoded><![CDATA[<p>Thanks for uploading pal..it&#8217;s very useful to my practicals..Many thanks.. ( @ _ @ )</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: karthi</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-3222</link>
		<dc:creator>karthi</dc:creator>
		<pubDate>Wed, 07 Oct 2009 15:02:35 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-3222</guid>
		<description>it is very logical.........
thank u for the program............</description>
		<content:encoded><![CDATA[<p>it is very logical&#8230;&#8230;&#8230;<br />
thank u for the program&#8230;&#8230;&#8230;&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Amiyo</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-3199</link>
		<dc:creator>Amiyo</dc:creator>
		<pubDate>Mon, 05 Oct 2009 14:25:47 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-3199</guid>
		<description>Thanks yaar.
Dis helped me a lot in my data structure lab.</description>
		<content:encoded><![CDATA[<p>Thanks yaar.<br />
Dis helped me a lot in my data structure lab.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alexander</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-3170</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Thu, 01 Oct 2009 06:27:49 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-3170</guid>
		<description>while (prec(infix[i]) 0 &amp;&amp; prec(infix[i]) &lt;= prec(stack[tos-1]))
:)</description>
		<content:encoded><![CDATA[<p>while (prec(infix[i]) 0 &amp;&amp; prec(infix[i]) &lt;= prec(stack[tos-1]))<br />
 <img src='http://geeksplanet.net/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alexander</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-3169</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Thu, 01 Oct 2009 06:23:42 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-3169</guid>
		<description>Bug!

There is a bug in RPN generator 

3+4*2/(1-5)^2   -&gt;  342*15-2^/+
if we put 3+ at the end...
4*2/(1-5)^2+3   -&gt;  42*15-2^3+/   must be 42*15-2^/3+

to correct this bug change precedence detection part...

if(prec(infix[i]) &lt;= prec(stack[tos-1])) {
    temp=pop();
    printf(&quot;\n the poped element is :%c&quot;,temp);
    output[j++]=temp;
    push(infix[i]);
    printf(&quot;\n The pushed element is :%c&quot;,infix[i]);
    show();
}


if(prec(infix[i]) &lt;= prec(stack[tos-1])) {
    while (prec(infix[i]) &lt;= prec(stack[tos-1])) {
        temp=pop();
        printf(&quot;\n the poped element is :%c&quot;,temp);
        output[j++]=temp;
    }
    push(infix[i]);
    printf(&quot;\n The pushed element is :%c&quot;,infix[i]);
    show();
}</description>
		<content:encoded><![CDATA[<p>Bug!</p>
<p>There is a bug in RPN generator </p>
<p>3+4*2/(1-5)^2   -&gt;  342*15-2^/+<br />
if we put 3+ at the end&#8230;<br />
4*2/(1-5)^2+3   -&gt;  42*15-2^3+/   must be 42*15-2^/3+</p>
<p>to correct this bug change precedence detection part&#8230;</p>
<p>if(prec(infix[i]) &lt;= prec(stack[tos-1])) {<br />
    temp=pop();<br />
    printf(&quot;\n the poped element is :%c&quot;,temp);<br />
    output[j++]=temp;<br />
    push(infix[i]);<br />
    printf(&quot;\n The pushed element is :%c&quot;,infix[i]);<br />
    show();<br />
}</p>
<p>if(prec(infix[i]) &lt;= prec(stack[tos-1])) {<br />
    while (prec(infix[i]) &lt;= prec(stack[tos-1])) {<br />
        temp=pop();<br />
        printf(&quot;\n the poped element is :%c&quot;,temp);<br />
        output[j++]=temp;<br />
    }<br />
    push(infix[i]);<br />
    printf(&quot;\n The pushed element is :%c&quot;,infix[i]);<br />
    show();<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dragonBone</title>
		<link>http://geeksplanet.net/2008/10/c-programming/program-to-convert-infix-expression-to-postfix-in-c-shunting-yard-algorithm/comment-page-1/#comment-3095</link>
		<dc:creator>dragonBone</dc:creator>
		<pubDate>Mon, 21 Sep 2009 10:17:21 +0000</pubDate>
		<guid isPermaLink="false">http://geeksplanet.net/?p=9#comment-3095</guid>
		<description>why i can&#039;t understand ??? who can tell me clearly..thank</description>
		<content:encoded><![CDATA[<p>why i can&#8217;t understand ??? who can tell me clearly..thank</p>
]]></content:encoded>
	</item>
</channel>
</rss>

