<?xml version="1.0" encoding="utf-8"?>

<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		<title>DaniWeb IT Discussion Community - Legacy and Other Languages</title>
		<link>http://www.daniweb.com/forums</link>
		<description><![CDATA[Our Legacy Languages forum is the place for Q&A-style discussions related to programming languages that are either depreciated or not popular enough to warrant their own forum. Please only post here if you're positive that we don't already have a more appropriate forum.]]></description>
		<language>en-US</language>
		<lastBuildDate>Thu, 08 Jan 2009 20:58:41 GMT</lastBuildDate>
		<generator>vBulletin</generator>
		<ttl>60</ttl>
		<image>
			<url>http://www.daniweb.com/forums/myimages/misc/rss.jpg</url>
			<title>DaniWeb IT Discussion Community - Legacy and Other Languages</title>
			<link>http://www.daniweb.com/forums</link>
		</image>
		<item>
			<title>9th BME International 24-hour Programming Contest!</title>
			<link>http://www.daniweb.com/forums/thread166930.html</link>
			<pubDate>Thu, 08 Jan 2009 04:50:24 GMT</pubDate>
			<description><![CDATA[Do you like programming? Can you take challenges? Would you match yourself with others?

Here is your chance! Grab it!

The Electrical Engineering Students' Hungarian Association and the Károly Simonyi College for Advanced Studies are proud to present the

_9th BME International 24-hour...]]></description>
			<content:encoded><![CDATA[<div>Do you like programming? Can you take challenges? Would you match yourself with others?<br />
<br />
Here is your chance! Grab it!<br />
<br />
The Electrical Engineering Students' Hungarian Association and the Károly Simonyi College for Advanced Studies are proud to present the<br />
<br />
<u>9th BME International 24-hour Programming Contest!</u><br />
<br />
If you have missed the previous eight occasions, it is now time to join the adventure!<br />
<br />
This contest is a real test of creativity, knowledge, endurance and team-work, an EXTREME CHALLENGE! Sponsors and the offered prizes worth 5000 euros contribute to the high standards of the contest. The team which gaines the utmost points can take home the award and the cup.<br />
<br />
Those teams which will have finished registration until <b>21st February 2009</b>, must do their best during the online preliminary quailifier on <b>28th February 2009</b>. The best performing thirty teams can participate onsite at the Finals in Budapest Hungary, between <b>1st and 3rd of May 2009</b>. During the 24-hour advanturous round, the contestants will have to solve one, but extremely complicated and interesting task. They will need all of their knowledge in the field of algorithms theory, artificial intelligence and program design, and also well-used team work competence is desired.<br />
<br />
The contestants will be allowed to use their own computers. Technical background and catering will be provided. There are <u>no restrictions on the hardware, software and support they use, but communication with the outside world is strictly forbidden</u>.<br />
<br />
For further information and for tasks from the previous years please visit the official homepage of the Challenge where future occurrents will also be available for everyone.<br />
<br />
If you are not afraid of eXtreme challenges, you do not have anything else to do just to establish a team of 3 members and register at <a rel="nofollow" class="t" href="http://www.challenge24.org" target="_blank">http://www.challenge24.org</a>! <u>Participation is completely free of charge.</u><br />
<br />
Have fun and good luck!<br />
The Organizers<br />
<br />
Deadline for registration: <b>21st February 2009</b><br />
Website: <a rel="nofollow" class="t" href="http://www.challenge24.org" target="_blank">http://www.challenge24.org</a><br />
For further information please check our website, or contact us by email</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>challenge24</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread166930.html</guid>
		</item>
		<item>
			<title>BPEL Help</title>
			<link>http://www.daniweb.com/forums/thread166839.html</link>
			<pubDate>Wed, 07 Jan 2009 18:31:34 GMT</pubDate>
			<description>Hey everyone,

I am trying to use BPEL Designer and Eclipse, and I am having the worst time trying to get all the plug-ins to work correctly.  I installed all the prerequisites and installed the Designer, but when I try to go through and download the updated BPEL Designer files from the CVS...</description>
			<content:encoded><![CDATA[<div>Hey everyone,<br />
<br />
I am trying to use BPEL Designer and Eclipse, and I am having the worst time trying to get all the plug-ins to work correctly.  I installed all the prerequisites and installed the Designer, but when I try to go through and download the updated BPEL Designer files from the CVS repository, the files come back with over 5,000 errors!  I have no idea what file or plugin I might be missing, although I did find it strange that when I downloaded WTP, some of the files when I tried to extract them were password protected.  Any ideas on how to set up BPEL Designer or another good (free) BPEL tool would be most appreciated.<br />
<br />
Background info:  I am trying to set up a small SOA environment to run BPEL programs, so if anyone has ideas about how to set one of those up easily I'm game for listening.  <br />
<br />
Thanks in advance!<br />
<br />
-Brandon</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>usc87bb</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread166839.html</guid>
		</item>
		<item>
			<title>Matrix question in Matlab</title>
			<link>http://www.daniweb.com/forums/thread164651.html</link>
			<pubDate>Mon, 29 Dec 2008 00:21:39 GMT</pubDate>
			<description>Greetings,

I have a 48x88 matrix and I need to sum the 1st element to the 23rd, the 2nd element to the 24th, etc until the 66th to the 88th (always using a 22 interval).
Then I have to divide 100 by the sum of each column. The result will be multiplied by each element of that same column.

What is...</description>
			<content:encoded><![CDATA[<div>Greetings,<br />
<br />
I have a 48x88 matrix and I need to sum the 1st element to the 23rd, the 2nd element to the 24th, etc until the 66th to the 88th (always using a 22 interval).<br />
Then I have to divide 100 by the sum of each column. The result will be multiplied by each element of that same column.<br />
<br />
What is the most effective way to do this? Nested for functions?<br />
This is not an undergraduate college question.<br />
<br />
Thank you for your replies. I appreciate them.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>tweat</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread164651.html</guid>
		</item>
		<item>
			<title>Linear Programming - LINGO</title>
			<link>http://www.daniweb.com/forums/thread164464.html</link>
			<pubDate>Sat, 27 Dec 2008 20:47:37 GMT</pubDate>
			<description><![CDATA[I want to write some functions into LINGO software, however my knowledge about LINGO is not that "qualified". Can someone help me about this if I show the equations to you?

S.]]></description>
			<content:encoded><![CDATA[<div>I want to write some functions into LINGO software, however my knowledge about LINGO is not that &quot;qualified&quot;. Can someone help me about this if I show the equations to you?<br />
<br />
S.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>ScaryMan</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread164464.html</guid>
		</item>
		<item>
			<title>Lisp  Polynomial manipulation</title>
			<link>http://www.daniweb.com/forums/thread163784.html</link>
			<pubDate>Tue, 23 Dec 2008 17:13:32 GMT</pubDate>
			<description>Hello,

I need your help for the following application 
The app has to do with polynomial manipulation and my question is how can i manipulate both letters and numbers. 
in other words how can i collect together terms , e.g., (x + 1) + x → 2x + 1 rather than x + 1 + x 

Thanks in advance for any...</description>
			<content:encoded><![CDATA[<div>Hello,<br />
<br />
I need your help for the following application <br />
The app has to do with polynomial manipulation and my question is how can i manipulate both letters and numbers. <br />
in other words how can i collect together terms , e.g., (x + 1) + x → 2x + 1 rather than x + 1 + x <br />
<br />
Thanks in advance for any help !<br />
<pre style="margin:20px; line-height:13px">;; Constructors<br />
<br />
(defun make-constant (num)<br />
&nbsp; num)<br />
<br />
(defun make-variable (sym)<br />
&nbsp; sym)<br />
<br />
;;(defun p+ (poly1 poly2)<br />
&nbsp;;; (list '+ poly1 poly2))<br />
<br />
(defmacro p+ (poly1 poly2)<br />
`(list '+ ',poly1 ',poly2))<br />
<br />
(defmacro p* (poly1 poly2)<br />
`(list '* ',poly1 ',poly2))<br />
<br />
<br />
;;(defun p* (poly1 poly2)<br />
;;&nbsp; (list '* poly1 poly2))<br />
<br />
(defun make-power (poly num)<br />
&nbsp; (list '** poly num))<br />
<br />
;;<br />
;; Recognizers for polynomials<br />
;;<br />
<br />
(defun constant-p (poly)<br />
&nbsp; (numberp poly))<br />
<br />
(defun variable-p (poly)<br />
&nbsp; (symbolp poly))<br />
<br />
(defun sum-p (poly)<br />
&nbsp; (and (listp poly) (eq (first poly) '+)))<br />
<br />
(defun product-p (poly)<br />
&nbsp; (and (listp poly) (eq (first poly) '*)))<br />
<br />
(defun power-p (poly)<br />
&nbsp; (and (listp poly) (eq (first poly) '**)))<br />
<br />
;;<br />
;; Selectors for polynomials<br />
;;<br />
<br />
(defun constant-numeric (const)<br />
&nbsp; const)<br />
<br />
(defun variable-symbol (var)<br />
&nbsp; var)<br />
<br />
(defun sum-arg1 (sum)<br />
&nbsp; (second sum))<br />
<br />
(defun sum-arg2 (sum)<br />
&nbsp; (third sum))<br />
<br />
(defun product-arg1 (prod)<br />
&nbsp; (second prod))<br />
<br />
(defun product-arg2 (prod)<br />
&nbsp; (third prod))<br />
<br />
(defun power-base (pow)<br />
&nbsp; (second pow))<br />
<br />
(defun power-exponent (pow)<br />
&nbsp; (third pow))<br />
<br />
<br />
<br />
;;<br />
;; Simplification function<br />
;;<br />
<br />
(defun simplify (poly)<br />
&nbsp; &quot;Simplify polynomial POLY.&quot;<br />
&nbsp; (cond<br />
&nbsp;  ((constant-p poly) poly)<br />
&nbsp;  ((variable-p poly) poly)<br />
&nbsp;  ((sum-p poly)<br />
&nbsp; &nbsp; (let ((arg1 (simplify (sum-arg1 poly)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (arg2 (simplify (sum-arg2 poly))))<br />
&nbsp; &nbsp; &nbsp; (make-simplified-sum arg1 arg2)))<br />
&nbsp;  ((product-p poly)<br />
&nbsp; &nbsp; (let ((arg1 (simplify (product-arg1 poly)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (arg2 (simplify (product-arg2 poly))))<br />
&nbsp; &nbsp; &nbsp; (make-simplified-product arg1 arg2)))<br />
&nbsp;  ((power-p poly)<br />
&nbsp; &nbsp; (let ((base (simplify (power-base poly)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (exponent (simplify (power-exponent poly))))<br />
&nbsp; &nbsp; &nbsp; (make-simplified-power base exponent)))<br />
&nbsp;  ((derivative-p poly) poly)))<br />
<br />
(defun make-simplified-sum (arg1 arg2)<br />
&nbsp; &quot;Given simplified polynomials ARG1 and ARG2, construct a simplified sum of ARG1 and ARG2.&quot;<br />
&nbsp; (cond<br />
&nbsp;  ((and (constant-p arg1) (zerop arg1)) arg2)<br />
&nbsp;  ((and (constant-p arg2) (zerop arg2)) arg1)<br />
&nbsp;  (t&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (p+ arg1 arg2))))<br />
<br />
(defun make-simplified-product (arg1 arg2)<br />
&nbsp; &quot;Given simplified polynomials ARG1 and ARG2, construct a simplified product of ARG1 and ARG2.&quot;<br />
&nbsp; (cond<br />
&nbsp;  ((and (constant-p arg1) (zerop arg1)) (make-constant 0))<br />
&nbsp;  ((and (constant-p arg2) (zerop arg2)) (make-constant 0))<br />
&nbsp;  ((and (constant-p arg1) (= arg1 1))&nbsp;  arg2)<br />
&nbsp;  ((and (constant-p arg2) (= arg2 1))&nbsp;  arg1)<br />
&nbsp;  (t&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (p* arg1 arg2))))<br />
<br />
(defun make-simplified-power (base exponent)<br />
&nbsp; &quot;Given simplified polynomials BASE and EXPONENT, construct a simplified power with base BASE and exponent EXPONENT.&quot;<br />
&nbsp; (cond<br />
&nbsp;  ((and (constant-p exponent) (= exponent 1))&nbsp;  base)<br />
&nbsp;  ((and (constant-p exponent) (zerop exponent)) (make-constant 1))<br />
&nbsp;  (t&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (make-power base exponent))))<br />
<br />
<br />
<br />
</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>nakias</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread163784.html</guid>
		</item>
		<item>
			<title>Lisp search tree</title>
			<link>http://www.daniweb.com/forums/thread163181.html</link>
			<pubDate>Sat, 20 Dec 2008 05:15:55 GMT</pubDate>
			<description><![CDATA[Am a newbie at LISP and trying to search through a tree using the BFS and DFS and got this far and am not sure if what i did sets the goal node to "n" because its supposed to start from a to the goal node and return the path....cant seem to get it to return the path at all.
1)generating the tree
...]]></description>
			<content:encoded><![CDATA[<div>Am a newbie at LISP and trying to search through a tree using the BFS and DFS and got this far and am not sure if what i did sets the goal node to &quot;n&quot; because its supposed to start from a to the goal node and return the path....cant seem to get it to return the path at all.<br />
1)generating the tree<br />
 (setf tree '((a) (b c) (d e f g) (i h j k l m n)))<br />
2)the DFS function<br />
(defun depth-first (start goal-n successors)<br />
               &quot;search new states until goal is reached.&quot;<br />
               (tree-search (list start goal-n successors #* append)))<br />
3)the BFS function<br />
 (defun breath-first (start goal-n successors)<br />
               &quot;search new states until goal is reached.&quot;<br />
               (tree-search (list start goal-n successors #* prepend)))</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>the_dawn</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread163181.html</guid>
		</item>
		<item>
			<title>Wave Algorithm</title>
			<link>http://www.daniweb.com/forums/thread163135.html</link>
			<pubDate>Fri, 19 Dec 2008 22:57:56 GMT</pubDate>
			<description>Hi All

Do you know what is this algorithm is? Can i find some code examples written in this algorithm?

Thanks</description>
			<content:encoded><![CDATA[<div>Hi All<br />
<br />
Do you know what is this algorithm is? Can i find some code examples written in this algorithm?<br />
<br />
Thanks</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>jamshid</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread163135.html</guid>
		</item>
		<item>
			<title>pseudo code: help with semantics</title>
			<link>http://www.daniweb.com/forums/thread163062.html</link>
			<pubDate>Fri, 19 Dec 2008 14:16:44 GMT</pubDate>
			<description><![CDATA[I am teaching myself pseudo code and I'd like ask for help to clear up my mind so I can understand the syntax and semantics a bit better. Would appreciate any help. (8 people must decide on one F*!)

I am trying understand *var int F1=0;* in the sample below
var = variable
int = ? (is this...]]></description>
			<content:encoded><![CDATA[<div>I am teaching myself pseudo code and I'd like ask for help to clear up my mind so I can understand the syntax and semantics a bit better. Would appreciate any help. (8 people must decide on one F*!)<br />
<br />
I am trying understand <b>var int F1=0;</b> in the sample below<br />
var = variable<br />
int = ? (is this integer?)<br />
0 = ? <br />
To replace var int F1=0; with semantics what would be a good example?<br />
<br />
<br />
var char randomFlavor = random(&quot;F1&quot;,&quot;F2&quot;,&quot;F3&quot;);<br />
var int F1=0;<br />
var int F2=0;<br />
var int F3=0;<br />
<br />
Count:<br />
for each people in 8 people<br />
var char pesonRandomFlavor = random(&quot;F1&quot;,&quot;F2&quot;,&quot;F3&quot;);<br />
if( randomFlavor ==pesonRandomFlovor )<br />
if (randomFlavor == &quot;F1&quot;)<br />
F1= F1+1;<br />
else if (randomFlavor == &quot;F2&quot;)<br />
F2= F2+1;<br />
else if (randomFlavor == &quot;F3&quot;)<br />
F3= F3+1;<br />
endif</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>Terry McKenna</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread163062.html</guid>
		</item>
		<item>
			<title>can someone help meeeee about scheme language</title>
			<link>http://www.daniweb.com/forums/thread162545.html</link>
			<pubDate>Tue, 16 Dec 2008 12:33:57 GMT</pubDate>
			<description><![CDATA[i want to write a code which work like below

(transform (+ - + - / + - + -  + + + / + + + - - - / + + + - - - - +)

>> +-+-  +-+-+++  +++---  +++----+

That is, code transform which combines the ones till the slash to make a word and puts a space between the words]]></description>
			<content:encoded><![CDATA[<div>i want to write a code which work like below<br />
<br />
(transform (+ - + - / + - + -  + + + / + + + - - - / + + + - - - - +)<br />
<br />
&gt;&gt; +-+-  +-+-+++  +++---  +++----+<br />
<br />
That is, code transform which combines the ones till the slash to make a word and puts a space between the words</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>pervane</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread162545.html</guid>
		</item>
		<item>
			<title><![CDATA[question---->matlab code]]></title>
			<link>http://www.daniweb.com/forums/thread162231.html</link>
			<pubDate>Sun, 14 Dec 2008 16:27:07 GMT</pubDate>
			<description><![CDATA[hello :)

i'm trying to creat a code to evalute this equation as a function of u

eq=(u)(u+1)(u+2).........(u+s-1)    ,where s is a given value
an after so calculates the integral of this function from 0 to 1

this is the code i wrote but i got an error
 <div class="codeblock"> <div class="spaced">...]]></description>
			<content:encoded><![CDATA[<div>hello :)<br />
<br />
i'm trying to creat a code to evalute this equation as a function of u<br />
<br />
eq=(u)(u+1)(u+2).........(u+s-1)    ,where s is a given value<br />
an after so calculates the integral of this function from 0 to 1<br />
<br />
this is the code i wrote but i got an error<br />
<pre style="margin:20px; line-height:13px">%in prod2.m file<br />
function m=prod2(u)<br />
s=5;<br />
m=prod(u:u+s-1);</pre>
<pre style="margin:20px; line-height:13px">%in test.m file<br />
Q=quad(@prod2,0,1)</pre>
<br />
and this is the error i got<br />
<br />
<div style="margin:20px; margin-top:5px; "> <div class="smallfont" style="margin-bottom:2px">Quote:</div> <table cellpadding="5" cellspacing="0" border="0" width="100%"> <tr> <td class="alt2"> <hr />  ??? Index exceeds matrix dimensions.<br />
<br />
Error in ==&gt; C:\MATLAB6p5\toolbox\matlab\funfun\quad.m<br />
On line 68  ==&gt; if ~isfinite(y(7))<br />
<br />
Error in ==&gt; C:\MATLAB6p5\work\test.m<br />
On line 2  ==&gt; Q=quad(@prod2,0,1)  <hr /> </td> </tr> </table> </div>
<br />
although when i tried to call the prod2 function in the command window it worked :S<br />
<br />
so please help me :(</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>nemoo</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread162231.html</guid>
		</item>
		<item>
			<title>Opening Multple Browsers from a Batch file</title>
			<link>http://www.daniweb.com/forums/thread161903.html</link>
			<pubDate>Fri, 12 Dec 2008 09:10:39 GMT</pubDate>
			<description><![CDATA[Hello All,

I am trying to write a batch file that will allow me to open several browsers at the same time.

For example, I want to open www.google in one browser and www.yahoo.ca in another browser and so on.....

What is happening is that I one browser with google 
Start "c:\program...]]></description>
			<content:encoded><![CDATA[<div>Hello All,<br />
<br />
I am trying to write a batch file that will allow me to open several browsers at the same time.<br />
<br />
For example, I want to open <a rel="nofollow" class="t" href="http://www.google" target="_blank">www.google</a> in one browser and <a rel="nofollow" class="t" href="http://www.yahoo.ca" target="_blank">www.yahoo.ca</a> in another browser and so on.....<br />
<br />
What is happening is that I one browser with google <br />
Start &quot;c:\program files\internet explorer\iexplorer.exe&quot; <a rel="nofollow" class="t" href="http://www.google.com" target="_blank">www.google.com</a><br />
then in the same browser it opens<br />
Start &quot;c:\program files\internet explorer\iexplorer.exe&quot; <a rel="nofollow" class="t" href="http://www.yahoo.ca" target="_blank">www.yahoo.ca</a><br />
<br />
Any tips woul be appreciated.<br />
<br />
Cheers,<br />
Aaron</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>Merkava</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread161903.html</guid>
		</item>
		<item>
			<title>batch programming capabilities</title>
			<link>http://www.daniweb.com/forums/thread161671.html</link>
			<pubDate>Wed, 10 Dec 2008 20:52:30 GMT</pubDate>
			<description>Hey folks,
I have a question for you. I have 4 computers that use a particular program that requires a login. But i only have 2 accounts. I have a command that works via batch file that launches the program and logs  in but i dont know how to specify what account will be used. I will explain in...</description>
			<content:encoded><![CDATA[<div>Hey folks,<br />
I have a question for you. I have 4 computers that use a particular program that requires a login. But i only have 2 accounts. I have a command that works via batch file that launches the program and logs  in but i dont know how to specify what account will be used. I will explain in pseudo code.<br />
<br />
lets say the accounts are:<br />
account1<br />
account2<br />
<br />
and the passwords are the same.<br />
<br />
This would be on the computer<br />
<pre style="margin:20px; line-height:13px">count = 1;<br />
while(computer has not found false line)<br />
{<blockquote>if (first Line of serverFile == false)<br />
{<br />
then set the first line to 'true' and set the account to &quot;account+count&quot;<br />
}<br />
else<br />
{<br />
increment count<br />
}</blockquote>}</pre>
<br />
then on a server there would be a txt or ini file...whatever works with a list<br />
<pre style="margin:20px; line-height:13px">REM This file holds true false statements if accounts are in use if they are true they are in use.<br />
false //this line represents account one<br />
false //this line represents account two</pre>
<br />
So is this possible? If so can anyone guide me towards a website that could help me out with this?<br />
<br />
Thanks PO!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>PhiberOptik</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread161671.html</guid>
		</item>
		<item>
			<title>Getting the average of the sum.</title>
			<link>http://www.daniweb.com/forums/thread160523.html</link>
			<pubDate>Wed, 03 Dec 2008 09:44:03 GMT</pubDate>
			<description><![CDATA[hi, can anyone help me with my codes. I can't find the right solution for getting the average of the sum. For example, my first number is 1 and the second is 10. It will get the sum of either all the even nos there or the odd nos there. And then it will get the average of it. Pls help me. tnx.
...]]></description>
			<content:encoded><![CDATA[<div>hi, can anyone help me with my codes. I can't find the right solution for getting the average of the sum. For example, my first number is 1 and the second is 10. It will get the sum of either all the even nos there or the odd nos there. And then it will get the average of it. Pls help me. tnx.<br />
<pre style="margin:20px; line-height:13px"><br />
&nbsp;TAKEHOME.COB&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Wed Dec 03 17:08:51 2008&nbsp; &nbsp; Page&nbsp;  1<br />
&nbsp;line number source line&nbsp;  Microsoft COBOL&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  Version 2.20<br />
<br />
&nbsp;  1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; IDENTIFICATION DIVISION.<br />
&nbsp;  2&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PROGRAM-ID.&nbsp; Iteration-If.<br />
&nbsp;  3&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; AUTHOR.&nbsp; Michael Coughlan.<br />
&nbsp;  4&nbsp; &nbsp; <br />
&nbsp;  5&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ENVIRONMENT DIVISION.<br />
&nbsp;  6&nbsp; &nbsp; <br />
&nbsp;  7&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA DIVISION.<br />
&nbsp;  8&nbsp; &nbsp; <br />
&nbsp;  9&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; WORKING-STORAGE SECTION.<br />
&nbsp; 10&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Num1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  PIC 99&nbsp; VALUE ZEROS.<br />
&nbsp; 11&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Num2&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  PIC 99&nbsp; VALUE ZEROS.<br />
&nbsp; 12&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Result&nbsp; &nbsp; &nbsp; &nbsp;  PIC 999 VALUE ZEROS.<br />
&nbsp; 13&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Sum-Nos&nbsp; &nbsp; &nbsp; &nbsp; PIC 999 VALUE ZEROS.<br />
&nbsp; 14&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Prod-Nos&nbsp; &nbsp; &nbsp;  PIC 999 VALUE 1.<br />
&nbsp; 15&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Ave-Nos&nbsp; &nbsp; &nbsp; &nbsp; PIC 99.99 VALUE ZEROS.<br />
&nbsp; 16&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Counter&nbsp; &nbsp; &nbsp; &nbsp; PIC 99&nbsp; VALUE ZEROS.<br />
&nbsp; 17&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Operator&nbsp; &nbsp; &nbsp;  PIC X&nbsp; VALUE SPACE.<br />
&nbsp; 18&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; Answer&nbsp; &nbsp; &nbsp; &nbsp;  PIC X&nbsp; VALUE SPACE.<br />
&nbsp; 19&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; CHECKEVEN&nbsp; &nbsp;  PIC 99&nbsp;  VALUE ZEROS.<br />
&nbsp; 20&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 01&nbsp; CHECKODD&nbsp; &nbsp; &nbsp; PIC 99&nbsp;  VALUE ZEROS.<br />
&nbsp; 21&nbsp; &nbsp; <br />
&nbsp; 22&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PROCEDURE DIVISION.<br />
&nbsp; 23&nbsp; &nbsp; <br />
&nbsp; 24&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Main.<br />
&nbsp; 25&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;Enter First Integer: &quot;.<br />
&nbsp; 26&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ACCEPT Num1.<br />
&nbsp; 27&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;Enter Second Integer: &quot;.<br />
&nbsp; 28&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ACCEPT Num2.<br />
&nbsp; 29&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;Choose 0/E/A: &quot;.<br />
&nbsp; 30&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ACCEPT Answer.<br />
&nbsp; 31&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  IF Answer = &quot;O&quot;<br />
&nbsp; 32&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Odd<br />
&nbsp; 33&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ELSE<br />
&nbsp; 34&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  IF Answer = &quot;E&quot;<br />
&nbsp; 35&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Even<br />
&nbsp; 36&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ELSE<br />
&nbsp; 37&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  IF Answer = &quot;A&quot;<br />
&nbsp; 38&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Gabos<br />
&nbsp; 39&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ELSE<br />
&nbsp; 40&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DISPLAY &quot;Invalid Input!&quot;.<br />
&nbsp; 41&nbsp; &nbsp; <br />
&nbsp; 42&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Gabos.<br />
&nbsp; 43&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  PERFORM Get-Values<br />
&nbsp; 44&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; VARYING Num1 FROM Num1 BY 1<br />
&nbsp; 45&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; UNTIL Num1 &gt; Num2.<br />
&nbsp; 46&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Sum is: &quot;, Sum-Nos.<br />
&nbsp; 47&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Product is: &quot;, Prod-Nos.<br />
&nbsp; 48&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Ave-Nos = Sum-Nos / Num2.<br />
&nbsp; 49&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Average is: &quot;, Ave-Nos.<br />
&nbsp; 50&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  STOP RUN.<br />
&nbsp; 51&nbsp; &nbsp; <br />
&nbsp; 52&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Even.<br />
&nbsp; 53&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE CHECKEVEN = Num1 / Num1.<br />
&nbsp; 54&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  IF CHECKEVEN = 1<br />
&nbsp; 55&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Get-Values<br />
&nbsp; 56&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  VARYING Num1 FROM Num1 BY 2<br />
&nbsp; 57&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  UNTIL Num1 &gt; Num2<br />
&nbsp; 58&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ELSE<br />
&nbsp; 59&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; COMPUTE Num1 = Num1 + 1<br />
&nbsp; 60&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Get-Values<br />
&nbsp; 61&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  VARYING Num1 FROM Num1 BY 2<br />
&nbsp; 62&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  UNTIL Num1 &gt; Num2.<br />
&nbsp; 63&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Sum is: &quot;, Sum-Nos.<br />
&nbsp; 64&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Product is: &quot;, Prod-Nos.<br />
&nbsp; 65&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Counter = Num2 - Num1 + 0.5.<br />
&nbsp; 66&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Ave-Nos = Sum-Nos / Counter.<br />
&nbsp; 67&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Average is: &quot;, Ave-Nos.<br />
&nbsp; 68&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  STOP RUN.<br />
&nbsp; 69&nbsp; &nbsp; <br />
&nbsp; 70&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Odd.<br />
&nbsp; 71&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE CHECKODD = Num1 / Num1.<br />
&nbsp; 72&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  IF CHECKODD = 1<br />
&nbsp; 73&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Get-Values<br />
&nbsp; 74&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  VARYING Num1 FROM Num1 BY 2<br />
&nbsp; 75&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  UNTIL Num1 &gt; Num2<br />
&nbsp; 76&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  ELSE<br />
&nbsp; 77&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; COMPUTE Num1 = Num1 + 1<br />
&nbsp; 78&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PERFORM Get-Values<br />
&nbsp; 79&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  VARYING Num1 FROM Num1 BY 2<br />
&nbsp; 80&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  UNTIL Num1 &gt; Num2.<br />
&nbsp; 81&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Sum is: &quot;, Sum-Nos.<br />
&nbsp; 82&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Product is: &quot;, Prod-Nos.<br />
&nbsp; 83&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Counter = Num2 - Num1 + 0.5.<br />
&nbsp; 84&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Ave-Nos = Sum-Nos / Counter.<br />
&nbsp; 85&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  DISPLAY &quot;The Average is: &quot;, Ave-Nos.<br />
&nbsp; 86&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  STOP RUN.<br />
&nbsp; 87&nbsp; &nbsp; <br />
&nbsp; 88&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Get-Values.<br />
&nbsp; 89&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Sum-Nos = Sum-Nos + Num1.<br />
&nbsp; 90&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  COMPUTE Prod-Nos = Prod-Nos * Num1.<br />
&nbsp; 91&nbsp; &nbsp; <br />
<br />
</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>c++ prog</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread160523.html</guid>
		</item>
		<item>
			<title>NATURAL data types</title>
			<link>http://www.daniweb.com/forums/thread160440.html</link>
			<pubDate>Tue, 02 Dec 2008 18:21:20 GMT</pubDate>
			<description><![CDATA[I was hoping that someone here is familiar enough with NATURAL to answer a few questions regarding some of its data types.

My first question is how are pact variables (p*) stored versus numerical variables (n*)?  I've had trouble finding an in depth explanation of how they are stored in memory and...]]></description>
			<content:encoded><![CDATA[<div>I was hoping that someone here is familiar enough with NATURAL to answer a few questions regarding some of its data types.<br />
<br />
My first question is how are pact variables (p*) stored versus numerical variables (n*)?  I've had trouble finding an in depth explanation of how they are stored in memory and how they are operated on.<br />
<br />
My second question, related to the first one, is why are odd pact initialization values more efficient than even ones (p3 versus p4)?  I haven't been able to get anyone who could adequately explain why that is.<br />
<br />
Hopefully I made this clear enough, and I appreciate any insight anyone can offer.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>krellor</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread160440.html</guid>
		</item>
		<item>
			<title>Contemporary issues in the design of programming languages</title>
			<link>http://www.daniweb.com/forums/thread159744.html</link>
			<pubDate>Thu, 27 Nov 2008 17:51:04 GMT</pubDate>
			<description>As my homework I need to discuss contemporary issues in the design of programming languages, but I do not know what are these contemporary issues really. I neeed help to find these contemporary issues. Can anybody help me?</description>
			<content:encoded><![CDATA[<div>As my homework I need to discuss contemporary issues in the design of programming languages, but I do not know what are these contemporary issues really. I neeed help to find these contemporary issues. Can anybody help me?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum42.html">Legacy and Other Languages</category>
			<dc:creator>noktasizvirgul</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread159744.html</guid>
		</item>
	</channel>
</rss>
