Printable View
Hey all,
I've got an assignment due soon, and my teacher gave us an ok to use outside sources. It's on stack-based arrays... Here's the actual assignment, as it is written.
I can use some pointers/tips/whatever you can offer.
The assignment will be attached.
If you can help, cool. If you don't want to help... offer me a tip?
That's really great, we're going to help you, but only after you help yourself. Just show us what you manage to do and where you get stucked. and we'll solve it together. Otherwise read this:Quote:
Originally Posted by suckerpunch678
http://cboard.cprogramming.com/annou...ouncementid=39
I'm not asking for anyone to do the assignment...Quote:
Originally Posted by Micko
how about some pseudocode to get me started?
*Assignment attached
Thanks
Quote:
how about some pseudocode to get me started?
Erm how about some pseudocode from you and then we can start helping? This is how these forums operate.
Nobody will do your homework for you unless, of course they want their own reputation to go down. As I found out to my horror! lol
However, helping someone once they have their own code is Ok.
Moreover, it prevents ppl like you from blindly copying other ppl's code and trying to fob it off as your own- and then getting into very hot water when the examiners realise it ain't yours.
Code:{a(<b+[c]>)} Why is this legal
{a[b+(c+d])} And not this?
hmmm, I can see it, can you?
Well, for start array based stack is somethink like this:
Algorithm coud be something like this.Code:char stack[N]; //where N is compile time constant
int i = 0;
//push on the stack
stack[i++];
//pop from the stack
stack[--i];
Get string from user. Go from the begining of the string and if character is {,[,( or < then push to stack, if character is any other character ignore. While traversing string from the begining to the end check for characters },], ) or >. For example If you find } then pop character from the stack and chack if it is a coresponding character (in this case we check if pop will return left brace}) If not then expression is not correct, otherwise continue with sam procedure until stack is empty.
Example {A{B<C>(E)F}(G)}
push { => stack: {
ignore A
push B => stack: { {
ignore B
push < => stack: { { <
ignore C
found > => pop from he stack, compare pop value with current value, it's ok so continue => stack: {{
push (
... etc
That's it I'm waiting to see what you're going to do!!!
Okok.. I put together a program that should work when it is compiled, but I can't get past the syntax errors.
Can you help me out with them?
It's attached, and should be well documented. Thanks.
Hmmmm. So, you can just hire a programmer to write your programs?Quote:
I've got an assignment due soon, and my teacher gave us an ok to use outside sources.
It's my work; I'm just asking for help. If you can and are willing, please do so... otherwise..Quote:
Originally Posted by 7stud
i think i'm going to start writing really good, solid, advanced, complex, and unnecessary code for people to turn in as homework .......and then commenting it very poorly - and by poorly i mean putting BS comments in - might even try to sneak in a "//someone else did this entire project"
Ok you probably want to read up on 'vectors' since they tie in with the idea of stacks (pushing and popping). If you go to FAQ and look under ' Preludes' corner this should get you started.
Otherwise, you can always google for vectors.
In terms of the solution- 'Micko' has more or less given it to you on a plate. Read his thread again and try to come up with a flow chart. Once you've done that, read up on vectors. Ok, all new stuff takes some time to get to grips with but it's worthwhile in the end!
Dem be useful little things -vectors.
Good luck
I got the program to compile and work. Thanks to all who offered assistance... and to you others..
The final product is attached.
Not bad you're making progress...
Just one thing, what if user enter something like this:
What will happen then??Code:[sd (fdsf) ]
And why??
Think about it a little!