This is a software demo illustrates the transition between middle-factor expression to give informal prefix (Polish notation) and suffixes (reverse Polish notation). The type of expression is also referred to the English name is Infix (infix), prefix (prefix) and postfix (suffix) based on the location of the operator compared with the operands in expressions.
Algorithm - Create and use plant expression (expression tree)
Algorithm - Transfer infix expressions into prefix and suffix Stack
Attached to the library program allows conversion Y2ExprConverter and calculate the value of an expression prefix and suffix. The program also allows exporting Html files transition expression as a table.
(Update 27 March 2011)
- Addition of sine, cosine
Re-editing and complete library Y2Expression
Download sourcecode + demo (VC # 2010)
(Update 22 March 2011)
* Complement unary operator "-" (negative) and sqrt () (take the square root)
-Show Result of expression
Language: VC # 2010
Download Demo + sourcecode (1.2)
Interface conversion from Infix to prefix and postfix
Automatically draw the expression tree from Infix string entered
Enter equations in " Infix Expression ", press Start or Enter.
The program will perform the conversion and output at the " Final Expression "
Can click the Step Forward program to make the transition gradual.
Update version 1.1 (01/27/2011)
- Added functionality draw the expression tree
- Library Y2Expression: add two methods to turn the expression into postfix and Infix expression tree
- Change some of the interface
- Fixed some minor bugs.
Language: VC # 2008
Download Demo + sourcecode (1.1)
Download Demo + sourcecode (1.0)