Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Help me figure out how to fix this error. I think I need an == operator overloader to get rid of this error: SLaLLC CastDO01>[

Help me figure out how to fix this error. I think I need an == operator overloader to get rid of this error:

image text in transcribedimage text in transcribed
SLaLLC CastDO01>[ ! !( 123450/ F de . getupI() ) ) ) no operator E= matches these operands c/C++(349) test-4-arithmetic-expression . cpp(8, 3): operand types are: const char [8] == OperandTEST_CASE ("class ArithmeticExpression") { ArithmeticExpression ae("1234567", "23456", '+'); CHECK ( "1234567" == ae . getop1() ) ; CHECK( "23456" == ae . getop2() ) ; CHECK ( '+' == ae . getoperator ( ) ) ; // The sign of the second operand should be merged with the operator ArithmeticExpression aeNegative("1234567", "-23456", '+"); github CHECK ("1234567" == aeNegative . getop1( ) ) ; CHECK ( "23456" == aeNegative . getop2( ) ) ; CHECK( ' -' == aeNegative . getoperator ( ) ) ; // The sign of the second operand should be merged with the operator ArithmeticExpression aeDoubleNeg ("1234567", "-23456", '-'); CHECK ("1234567" == aeDoubleNeg . getop1( ) ) ; CHECK ( "23456" == aeDoubleNeg . getop2( ) ) ; CHECK(' +' == aeDoubleNeg . getoperator ( ) ) ; // first operand being negative ArithmeticExpression aeFirstNegative("-1234567", "23456", '+'); CHECK("-1234567" == aeFirstNegative . getop1( ) ) ; CHECK ("23456" == aeFirstNegative . getop2( ) ) ; CHECK( '+' == aeFirstNegative . getOperator ( ) )

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Financial management theory and practice

Authors: Eugene F. Brigham and Michael C. Ehrhardt

12th Edition

978-0030243998, 30243998, 324422695, 978-0324422696

Students also viewed these Programming questions