<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>IT&#38;C Solutions &#187; Scriere infixata</title>
	<atom:link href="http://www.itcsolutions.eu/tag/scriere-infixata/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.itcsolutions.eu</link>
	<description>Solutions and tutorials for IT&#38;C development</description>
	<lastBuildDate>Sun, 16 Oct 2011 21:22:35 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>How to: Transform a Mathematical Expression from Infix Writing to Postfix Writing in C++</title>
		<link>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/#comments</comments>
		<pubDate>Sun, 28 Feb 2010 10:05:56 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Aplicatie]]></category>
		<category><![CDATA[Conversie]]></category>
		<category><![CDATA[Scriere infixata]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=1301</guid>
		<description><![CDATA[Postfix writing (Reverse Polish Form) was made by Polish mathematician Jan Łukasiewicz. Particularities of this form of writing mathematical expressions are presented in [...]. An algorithm for transforming a writing mathematical expressions from infix to postfix writing was developed by Edsger Dijkstra (Dijkstra Shunting Algorithm). Algorithm requires: Use a stack type structure [...] in which [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Conversia unei expresii matematice din scrierea infixata in scrierea postfixata in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Sat, 14 Nov 2009 09:35:22 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Aplicatie]]></category>
		<category><![CDATA[Conversie]]></category>
		<category><![CDATA[Scriere infixata]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=822</guid>
		<description><![CDATA[Scrierea postfixata (forma poloneza inversa) a fost realizata de matematicianul de origine poloneza Jan Lukasiewicz. Particularitati ale acestei forme de scriere a expresiilor matematice sunt prezentate la [...]. Un algoritm de transformare a unei expresii matematice din scrierea infixata in scrierea postfixata a fost elaborat de Edsger Dijkstra (Dijkstra Shunting Algorithm). Algoritmul presupune: Utilizarea unei [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>10</slash:comments>
		</item>
	</channel>
</rss>

