Printable View
write a code in c# that
Given a text, we need to look up the longest valid infix expression in the text and return its evaluation.
The following expressions are a valid infix expressions:
* a
* a+b
* (a/b)
* (a + b) + (c) * a /c
Input example:
* “abcd 6 (4+3)*9yuy 6*((4+2)-(8-2))”
Output:
* 6 * ( ( 4 + 2 ) – ( 8 – 2 ) )
* result : 0.
....................................................
use stack and queu
How far have you gotten with this homework assignment? Please post your code.
Helpful links:
http://scriptasylum.com/tutorials/in...tfix/index.htm
http://scriptasylum.com/tutorials/in...tion/index.htm
On a sidenote, your subject line doesn't really inspire much desire to help you.
i don't have a time to write this code
i shuold study for the exam
if u can help me...please do it
thanx my dear
i don't have a time to write this code
i shuold study for the exam
if u can help me...please do it
thanx
Sorry, we don't have time to help.Quote:
Originally Posted by jak.lofy
And, in a more general sense, writing the code for you wouldn't help you learn.
Occasionally, I think it IS highly instructive to teach by example, but it is surely not instructive, in this particular case. The links I provided above should help you understand the algorithm.