 toolpublic.zip
 ToolPublic
- GUI.Tools
 License.txt- SampleScripts
- Sample.Report
- Tools
- XML.Forms
- GiftCardPurchase.form
- LicenseEntry.form
- PayByCreditCard.form
- Send.Alerts.To.form
- ServerDriveLogon.form
- ServerInfo.form
- StdAfx.h
- ToolDll
- ToolDllTester
- ToolExDllCore
- ToolExtender
- ToolTester
- Utilities
- samples.zip
- Samples
- RunTool.exe
- RunToolDll.exe
- ToolExtender.dll
- ToolPub.DLL
- ToolPub.lib
- xmlformtest.exe
- toolforge.zip
- ToolForge.exe
|
/*****************************************************************************/
/* SOURCE FILE */
/*****************************************************************************/
/*
$Archive: $
$Revision: $
$Date: $
$Author: $
Description: Implementation of the Expression Analyzer class
TOOL And XML FORMS License
==========================
Except where otherwise noted, all of the documentation
and software included in the TOOL package is
copyrighted by Michael Swartzendruber.
Copyright (C) 2005 Michael John Swartzendruber.
All rights reserved.
Access to this code, whether intentional or accidental,
does NOT IMPLY any transfer of rights.
This software is provided "as-is," without any express
or implied warranty. In no event shall the author be held
liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for
any purpose, including commercial applications, and to
alter and redistribute it, provided that the following
conditions are met:
1. All redistributions of source code files must retain
all copyright notices that are currently in place,
and this list of conditions without modification.
2. The origin of this software must not be misrepresented;
you must not claim that you wrote the original software.
3. If you use this software in another product, an acknowledgment
in the product documentation would be appreciated but is
not required.
4. Modified versions in source or binary form must be plainly
marked as such, and must not be misrepresented as being
the original software.
*/
static char OBJECT_ID[] = "$Revision: $ : $Date: $";
/*****************************************************************************/
#include <math.h>
#include <ctype.h>
#include "VMCalcExpressionAnalyzer.h"
// Error code var
//
int giResultCode;
void VMCalcExpressionAnalyzer::PruneTree( PNODE pxRoot )
{
if ( NULL == pxRoot )
return;
if ( pxRoot->m_pxLeft != NULL )
PruneTree( pxRoot->m_pxLeft );
if ( pxRoot->m_pxRight != NULL )
PruneTree( pxRoot->m_pxRight );
if ( pxRoot->m_ucOperation == '`' )
delete pxRoot->m_oValueString;
delete pxRoot;
}
VMCalcExpressionAnalyzer::VMCalcExpressionAnalyzer( void )
{
m_xExpressionTree = NULL;
m_oEquation = "";
m_iPosition = 0;
m_poVariables = NULL;
}
VMCalcExpressionAnalyzer::VMCalcExpressionAnalyzer( CMapVariable* pVarsMap )
{
m_xExpressionTree = NULL;
m_oEquation = "";
m_iPosition = 0;
m_poVariables = pVarsMap;
}
VMCalcExpressionAnalyzer::~VMCalcExpressionAnalyzer( void )
{
PruneTree( m_xExpressionTree );
}
int VMCalcExpressionAnalyzer::UpdateValue( void )
{
if ( m_oEquation.empty() )
return( 0 );
PruneTree( m_xExpressionTree );
m_xExpressionTree = NULL;
m_iPosition = 0;
m_xExpressionTree = FactorSumDiff();
if ( m_oEquation[ m_iPosition ] != '\0' )
{
PruneTree( m_xExpressionTree );
m_xExpressionTree = NULL;
}
if ( NULL == m_xExpressionTree )
return( m_iPosition );
else
return( -1 );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::FactorSumDiff( void )
{
SkipSpaces();
PNODE pxNewNode;
PNODE pxLHS = FactorMultDiv();
PNODE pxRHS;
if ( NULL == pxLHS )
return( NULL );
SkipSpaces();
while ( ( m_oEquation[ m_iPosition ] == '-' )
|| ( m_oEquation[ m_iPosition ] == '+' ) )
{
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_ucOperation = m_oEquation[ m_iPosition ];
m_iPosition++;
pxRHS = FactorMultDiv();
pxNewNode->m_pxRight = pxRHS;
if ( NULL == pxRHS )
{
PruneTree( pxNewNode );
return( NULL );
}
pxLHS = pxNewNode;
}
return( pxLHS );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::FactorMultDiv( void )
{
SkipSpaces();
PNODE pxNewNode;
PNODE pxLHS = Compute();
PNODE pxRHS;
if ( NULL == pxLHS )
return( NULL );
SkipSpaces();
while ( ( m_oEquation[ m_iPosition ] == '*' )
|| ( m_oEquation[ m_iPosition ] == '/' ) )
{
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_ucOperation = m_oEquation[ m_iPosition ];
m_iPosition++;
pxRHS = Compute();
pxNewNode->m_pxRight = pxRHS;
if ( NULL == pxRHS )
{
PruneTree( pxNewNode );
return( NULL );
}
pxLHS = pxNewNode;
}
return( pxLHS );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::Compute( void )
{
SkipSpaces();
PNODE pxNewNode = NULL;
PNODE pxLHS = PerformLogicalOperation();
PNODE pxRHS;
if ( NULL == pxLHS )
return( NULL );
SkipSpaces();
while ( m_oEquation[ m_iPosition ] == '^' )
{
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_ucOperation = m_oEquation[ m_iPosition ];
m_iPosition++;
pxRHS = PerformLogicalOperation();
pxNewNode->m_pxRight = pxRHS;
if ( NULL == pxRHS )
{
PruneTree( pxNewNode );
return( NULL );
}
pxLHS = pxNewNode;
}
return( pxLHS );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::FactorExpression( void )
{
SkipSpaces();
PNODE pxNewNode = NULL;
PNODE pxRHS = NULL;
PNODE pxLHS = NULL;
while ( m_oEquation[ m_iPosition ] == ' '
&& m_oEquation[ m_iPosition ] != '\0' )
m_iPosition++;
SkipSpaces();
if ( m_oEquation[ m_iPosition ] == '-' )
{
pxNewNode = new NODE;
pxLHS = new NODE;
pxLHS->m_pxRight = NULL;
pxLHS->m_pxLeft = NULL;
pxLHS->m_ucOperation = '@';
pxLHS->m_dValue = -1;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_ucOperation = '*';
m_iPosition++;
pxNewNode->m_pxRight = FactorSumDiff();
if ( NULL == pxNewNode->m_pxRight )
return( NULL );
return( pxNewNode );
}
if ( m_oEquation[ m_iPosition ] == '(' )
{
m_iPosition++;
pxNewNode = FactorSumDiff();
if ( NULL == pxNewNode )
return( NULL );
if ( m_oEquation[ m_iPosition ] != ')' )
{
PruneTree( pxNewNode );
return( NULL );
}
m_iPosition++;
return( pxNewNode );
}
else
if ( m_oEquation[ m_iPosition ] == '|' )
{
m_iPosition++;
pxRHS = FactorSumDiff();
if ( NULL == pxRHS )
return( NULL );
if ( m_oEquation[ m_iPosition ] != '|' )
{
PruneTree( pxNewNode );
return( NULL );
}
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxRHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = '|';
m_iPosition++;
return( pxNewNode );
}
else
return( FactorString() );
return( pxNewNode );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::FactorString( void )
{
SkipSpaces();
VMCalcValueBase* poValue;
int iPosition;
PNODE pxNewNode = NULL;
PNODE pxLHS = NULL;
PNODE pxReturn = NULL;
bool bNegative = false;
iPosition = m_iPosition;
SkipSpaces();
if ( m_oEquation[ m_iPosition ]== '\0' )
pxReturn = NULL;
if ( m_oEquation[ m_iPosition ]== '-' )
{
bNegative = true;
iPosition++;
m_iPosition++;
}
if ( isdigit( m_oEquation[ m_iPosition ] ) )
{
while ( isdigit( m_oEquation[ m_iPosition ] ) )
m_iPosition++;
if ( m_oEquation[ m_iPosition ] == '.' )
m_iPosition++;
while ( isdigit( m_oEquation[ m_iPosition ] ) )
m_iPosition++;
pxNewNode = new NODE;
pxNewNode->m_pxLeft = NULL;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = '@';
pxNewNode->m_dValue = atof( m_oEquation.substr( iPosition, m_iPosition - iPosition ).c_str() );
if ( bNegative )
{
pxNewNode->m_dValue *= -1;
}
pxReturn = pxNewNode;
}
if ( isalpha( m_oEquation[ m_iPosition ] )
|| m_oEquation[ m_iPosition ] == '_'
|| m_oEquation[ m_iPosition ] == '$' )
{
while ( isalnum( m_oEquation[ m_iPosition ] )
|| m_oEquation[ m_iPosition ] == '_'
|| m_oEquation[ m_iPosition ] == '$' )
m_iPosition++;
std::string oToken = m_oEquation.substr( iPosition,
m_iPosition - iPosition );
std::string oVarName = oToken;
std::string::iterator oStringIter = oToken.begin();
while ( oStringIter != oToken.end() )
{
*(oStringIter) = toupper( *(oStringIter) );
oStringIter++;
}
if ( oToken == "SIN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 150;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="COS" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 151;
SkipSpaces();
return( pxNewNode );
}
if ( oToken == "EXP" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 152;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="SQRT" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 153;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="LN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 154;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="TAN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 155;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="CTG" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 156;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ASIN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 157;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ACOS" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 158;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ATAN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 159;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="SINH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 160;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="COSH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 161;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="TANH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 162;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ASINH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 163;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ACOSH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 164;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ATANH" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 165;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="LOG10" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 166;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="LOG2" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 167;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ABS" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 168;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ROUNDDOWN" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 169;
SkipSpaces();
return( pxNewNode );
}
if ( oToken =="ROUNDUP" )
{
pxLHS = FactorExpression();
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = 170;
SkipSpaces();
return( pxNewNode );
}
std::string onid = oVarName;
IterCMapVariable oIter = m_poVariables->find( onid );
if ( m_poVariables->end() != oIter )
{
poValue = (*oIter).second;
pxNewNode = new NODE;
pxNewNode->m_pxLeft = NULL;
pxNewNode->m_pxRight = NULL;
pxNewNode->m_ucOperation = '`';
pxNewNode->m_oValueString = new std::string( oVarName );
pxReturn = pxNewNode;
}
else
pxReturn = NULL;
}
SkipSpaces();
return( pxReturn );
}
int VMCalcExpressionAnalyzer::ChangeExpression( const char* pchNewExpression )
{
int iSize = strlen( pchNewExpression );
char* pchCopy = new char[ iSize + 1 ];
strcpy( pchCopy, pchNewExpression );
for ( int iLoop = 0; iLoop < iSize; iLoop++ )
{
if ( pchCopy[ iLoop ] == ' ' || pchCopy[ iLoop ] == '\t' )
{
memmove( pchCopy + iLoop, pchCopy + iLoop + 1, iSize - iLoop );
iLoop--;
}
}
m_oEquation = pchCopy;
delete [] pchCopy;
m_oEquation += '\0';
m_oEquation += '\0';
SkipSpaces();
return( UpdateValue() );
}
int VMCalcExpressionAnalyzer::Value( double& rdOutput )
{
giResultCode = 0;
if ( NULL == m_xExpressionTree )
return( -1 );
rdOutput = EvaluateExpression( m_xExpressionTree );
return( giResultCode );
}
double VMCalcExpressionAnalyzer::EvaluateExpression( PNODE a )
{
VMCalcValueBase* poValue;
double v;
if ( NULL == a->m_ucOperation )
{
giResultCode = 10;
return( 0 );
}
switch( a->m_ucOperation )
{
case '+':
{
return( EvaluateExpression( a->m_pxLeft )
+ EvaluateExpression( a->m_pxRight ) );
}
case '-':
{
return( EvaluateExpression( a->m_pxLeft )
- EvaluateExpression( a->m_pxRight ) );
}
case '*':
{
return( EvaluateExpression( a->m_pxLeft )
* EvaluateExpression( a->m_pxRight ) );
}
case '/':
{
v = EvaluateExpression( a->m_pxRight );
if ( 0 == v )
{
giResultCode = DIVISION_BY_0;
return( -EvaluateExpression( a->m_pxLeft ) / 0.001 );
}
else
{
return( EvaluateExpression( a->m_pxLeft ) / v );
}
}
case 150:
{
return( sin( EvaluateExpression( a->m_pxLeft ) ) );
}
case 151:
{
return( cos( EvaluateExpression( a->m_pxLeft ) ) );
}
case 152:
{
return( exp( EvaluateExpression( a->m_pxLeft ) ) );
}
case 153:
{
v = EvaluateExpression( a->m_pxLeft ) ;
if ( v < 0 )
{
giResultCode = INVALID_DOMAIN;
return( 0 );
}
else
{
return( sqrt( v ) );
}
}
case 154:
{
v = EvaluateExpression( a->m_pxLeft );
if ( v <= 0 )
{
giResultCode = INVALID_DOMAIN;
return 0;
}
else
{
return( log( v ) );
}
}
case 155:
{
return( tan( EvaluateExpression( a->m_pxLeft ) ) );
}
case 156:
{
return( 1 / tan( EvaluateExpression( a->m_pxLeft ) ) );
}
case 157:
{
return( asin( EvaluateExpression( a->m_pxLeft ) ) );
}
case 158:
{
return( acos( EvaluateExpression( a->m_pxLeft ) ) );
}
case 159:
{
return( atan( EvaluateExpression( a->m_pxLeft ) ) );
}
case 160:
{
return( sinh( EvaluateExpression( a->m_pxLeft ) ) );
}
case 161:
{
return( cosh( EvaluateExpression( a->m_pxLeft ) ) );
}
case 162:
{
return( tanh( EvaluateExpression( a->m_pxLeft ) ) );
}
case 163:
{
double dblValue = EvaluateExpression( a->m_pxLeft );
return( log( dblValue + sqrt( dblValue * dblValue + 1 ) ) );
}
case 164:
{
double dblValue = EvaluateExpression( a->m_pxLeft );
return( log( dblValue + sqrt( dblValue * dblValue - 1 ) ) );
}
case 165:
{
double dblValue = EvaluateExpression( a->m_pxLeft );
return( 0.5 * log( ( 1 + dblValue ) / ( 1 - dblValue ) ) );
}
case 166:
return( log10( EvaluateExpression( a->m_pxLeft ) ) );
case 167:
{
double dblValue = EvaluateExpression( a->m_pxLeft );
return( log( dblValue ) / log( 2.0 ) );
}
case 168:
{
return( fabs( EvaluateExpression( a->m_pxLeft ) ) );
}
case 169:
{
return( floor( EvaluateExpression( a->m_pxLeft ) ) );
}
case 170:
{
return( floor( EvaluateExpression( a->m_pxLeft ) + 0.5 ) );
}
case '|':
{
return( fabs( EvaluateExpression( a->m_pxLeft ) ) );
}
case '^':
{
return( pow( EvaluateExpression( a->m_pxLeft ), EvaluateExpression( a->m_pxRight ) ) );
}
case '@':
{
return( a->m_dValue );
}
// logical operations evaluation
//
case '<':
{
return( EvaluateExpression( a->m_pxLeft ) < EvaluateExpression( a->m_pxRight ) );
}
case '>':
{
return( EvaluateExpression( a->m_pxLeft ) > EvaluateExpression( a->m_pxRight ) );
}
case '!':
{
return( !EvaluateExpression( a->m_pxRight ) );
}
default:
{
if ( NULL == m_poVariables )
{
giResultCode = UNDEFINED_VARIABLE;
return( 0 );
}
std::string oVarName = *a->m_oValueString;
IterCMapVariable oIter = m_poVariables->find( oVarName );
if ( m_poVariables->end() == oIter )
{
giResultCode = UNDEFINED_VARIABLE;
return( 0 );
}
else
{
poValue = (*oIter).second;
return( poValue->GetValue() );
}
}
}
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::GetExpressionRoot( void )
{
return( m_xExpressionTree );
}
VMCalcExpressionAnalyzer::VMCalcExpressionAnalyzer( VMCalcExpressionAnalyzer& roOther )
{
*this = roOther;
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::CloneTree( void )
{
return( CloneTree( m_xExpressionTree ) );
}
void VMCalcExpressionAnalyzer::AtachVariables( CMapVariable * poVarsMap )
{
m_poVariables = poVarsMap;
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::CloneTree( PNODE arb )
{
if ( NULL == arb )
return( NULL );
PNODE clonArb = new NODE;
*clonArb = *arb;
clonArb->m_pxLeft = CloneTree( arb->m_pxLeft );
clonArb->m_pxRight = CloneTree( arb->m_pxRight );
return( clonArb );
}
VMCalcExpressionAnalyzer& VMCalcExpressionAnalyzer::operator= ( VMCalcExpressionAnalyzer& roOther )
{
m_oEquation = roOther.m_oEquation;
m_poVariables = roOther.m_poVariables;
m_iPosition = 0;
m_xExpressionTree = roOther.CloneTree();
return( *this );
}
void VMCalcExpressionAnalyzer::SkipSpaces( void )
{
while ( m_oEquation[ m_iPosition ] == ' '
&& m_oEquation[ m_iPosition ] != '\0' )
m_iPosition++;
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::PerformLogicalOperation( void )
{
SkipSpaces();
PNODE pxNewNode;
PNODE pxLHS = PerformSignedOperation();
PNODE pxRHS;
if ( NULL == pxLHS )
return( NULL );
SkipSpaces();
// || another same priority operations
//
while ( ( m_oEquation[ m_iPosition ] == '<' )
|| ( m_oEquation[ m_iPosition ] == '>' ) )
{
pxNewNode = new NODE;
pxNewNode->m_pxLeft = pxLHS;
pxNewNode->m_ucOperation = m_oEquation[ m_iPosition ];
m_iPosition++;
pxRHS = PerformSignedOperation();
pxNewNode->m_pxRight = pxRHS;
if ( NULL == pxRHS )
{
PruneTree( pxNewNode );
return( NULL );
}
pxLHS = pxNewNode;
}
return( pxLHS );
}
VMCalcExpressionAnalyzer::PNODE VMCalcExpressionAnalyzer::PerformSignedOperation( void )
{
SkipSpaces();
PNODE pxNewNode = NULL;
PNODE pxRHS;
// || another same priority operations
//
if ( ( m_oEquation[ m_iPosition ] == '!' ) )
{
pxNewNode = new NODE;
pxNewNode->m_pxLeft = NULL;
pxNewNode->m_ucOperation = m_oEquation[ m_iPosition ];
m_iPosition++;
pxRHS = PerformSignedOperation();
pxNewNode->m_pxRight = pxRHS;
if ( NULL == pxRHS )
{
PruneTree( pxNewNode );
return( NULL );
}
}
else
pxNewNode = FactorExpression();
return( pxNewNode );
}
/*****************************************************************************/
/* Check-in history */
/*
*$Log: $
*/
/*****************************************************************************/
|
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please
let us know and we'll add colourisation support for it.
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.
Submit an article or tip