Show Bid Request
Ball
Bid Request Id: 30687
|
|
|
|
Posted by: |
Need Good help (13 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 0.00%
|
|
Posted: |
Oct 11, 2002
8:47:53 AM EDT
|
|
Bidding Closes: |
Oct 15, 2002
8:51:30 AM EDT
|
|
Viewed (by coders): |
121 times
|
|
Deadline: |
10/15/2002 9:51:30 AM
TIME EXPIRED
|
|
|
|
|
Description:
See inclosed instructions
Deliverables:
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
Platform:
Microsoft visual C++ 6.0
Must be 100% finished and received by buyer on:
Oct 15, 2002 9:51:30 AM EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Additional Files:
This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$10 (USD)
|
Oct 11, 2002
11:11:50 AM EDT
|
9.74
(Excellent)
|
|
|
At least your prof left some _fun_
for the students ...
I can complete your interpretter
within a day. The basic algorithm
is any ({[ goes onto the stack;
then if there isn't a matching
({[ to pop off the stack when a
(}] is read then that is an error.
Finally after processing the
entire text, unless the stack is
left empty, all those ({[ are
unmatched (an error).
A IDLER
Chief Software Architect
Idleswell Software Creations |
|
|
|
|
|
|
