Microsoft KB Archive/86688

= Example to Evaluate Basic Numeric Expressions =

Article ID: 86688

Article Last Modified on 8/16/2005

-

APPLIES TO


 * Microsoft Visual Basic 1.0 Standard Edition
 * Microsoft Visual Basic 2.0 Standard Edition
 * Microsoft Visual Basic 3.0 Professional Edition
 * Microsoft Visual Basic for MS-DOS

-



This article was previously published under Q86688



SUMMARY
This article contains an example program that evaluates a numeric expression contained in a string, mimicking the operators, built-in functions, and order of evaluation used by Microsoft Basic language products. This article also explains the operator precedence rules in detail.



MORE INFORMATION
The example program listed below recognizes the following operators and subexpressions, listed by precedence from highest to lowest:
 * Constants, function calls, parentheses
 * Exponentiation ^
 * Unary minus -
 * Multiplication and division *, /
 * Integer division \
 * Integer modulus MOD
 * Addition and subtraction +, -
 * Relational operators =, <>, <, >, <=, >=
 * NOT
 * AND
 * OR
 * XOR
 * EQV
 * IMP

The precedence of unary minus &quot;-&quot; and operator &quot;NOT&quot; indicate the highest possible precedence of their operand. Unary minus and &quot;NOT&quot; may occur in an expression of any precedence. The following expressions illustrate the precedence rules for unary minus and &quot;NOT&quot;.

  Expression        Value --       -    -1  ^  2          -1   -(1  ^  2)         -1   (-1) ^  2           1     2  ^ -2          .25    NOT  0  = 1       -1 NOT (0 = 1)      -1 (NOT 0) = 1        0 NOT 0  AND 1      1 (NOT 0) AND 1      1 NOT (0 AND 1)    -1

The example program listed below accepts number constants written as decimal numbers with an optional fraction. For example, it accepts &quot;123&quot; and &quot;123.4&quot;. It is possible to modify the program to recognize hexadecimal, scientific notation, or other formats.

This example program also recognizes the following functions: ABS, ATN, COS, EXP, FIX, INT, LOG, RND, SNG, SIN, SQR, and TAN.

Steps to Create Example Program
 Run Visual Basic, or from the File menu, choose New Project (press ALT, F, N) if Visual Basic is already running. Form1 will be created by default. Add a text box (Text1) and a command button (Command1) to Form1. Set the Text property for Text1 to the null string (empty).  Enter the following code in the Command1 Click event procedure: Sub Command1_Click Dim n As Double

If e_eval(Text1.Text, n) Then MsgBox Format$(n) End If  End Sub

  Add the following code in the general Declarations section of Form1: ' To run this program in Visual Basic for MS-DOS, change the ' following Dim statements to DIM SHARED. ' Dim e_input As String    ' Expression input string. Dim e_tok As String      ' Current token kind. Dim e_spelling As String ' Current token spelling. Dim e_error As Integer   ' Tells if syntax error occurred.

' e_eval '  Evaluate a string containing an infix numeric expression. '  If successful, return true and place result in. '  This is the top-level function in the expression evaluator. Function e_eval (ByVal s As String, value As Double) As Integer ' Initialize. e_error = 0 e_input = s  Call e_nxt

' Evaluate. value = e_prs(1)

' Check for unrecognized input. If e_tok <> &quot;&quot; And Not e_error Then MsgBox &quot;syntax error, token = '&quot; + e_spelling + &quot;'&quot; e_error = -1 End If

e_eval = Not e_error End Function

' e_prs '  Parse an expression, allowing operators of a specified '  precedence or higher. The lowest precedence is 1. '  This function gets tokens with e_nxt and recursively '  applies operator precedence rules. Function e_prs (p As Integer) As Double Dim n As Double   ' Return value. Dim fun As String ' Function name.

' Parse expression that begins with a token (precedence 12). If e_tok = &quot;num&quot; Then ' number. n = Val(e_spelling) Call e_nxt ElseIf e_tok = &quot;-&quot; Then ' unary minus. Call e_nxt n = -e_prs(11)   ' Operand precedence 11. ElseIf e_tok = &quot;not&quot; Then ' logical NOT. Call e_nxt n = Not e_prs(6) ' Operand precedence 6. ElseIf e_tok = &quot;(&quot; Then     ' parentheses.      Call e_nxt      n = e_prs(1)      Call e_match(&quot;)&quot;) ElseIf e_tok = &quot;id&quot; Then ' Function call. fun = e_spelling Call e_nxt Call e_match(&quot;(&quot;)     n = e_prs(1)      Call e_match(&quot;)&quot;) n = e_function(fun, n)  Else If Not e_error Then MsgBox &quot;syntax error, token = '&quot; + e_spelling + &quot;'&quot; e_error = -1 End If  End If

' Parse binary operators. Do While Not e_error If 0 Then ' To allow ElseIf. ElseIf p <= 11 And e_tok = &quot;^&quot;  Then Call e_nxt: n = n ^   e_prs(12) ElseIf p <= 10 And e_tok = &quot;*&quot;  Then Call e_nxt: n = n *   e_prs(11) ElseIf p <= 10 And e_tok = &quot;/&quot;  Then Call e_nxt: n = n /   e_prs(11) ElseIf p <= 9 And e_tok = &quot;\&quot;   Then Call e_nxt: n = n \   e_prs(10) ElseIf p <= 8 And e_tok = &quot;mod&quot; Then Call e_nxt: n = n Mod e_prs(9) ElseIf p <= 7 And e_tok = &quot;+&quot;   Then Call e_nxt: n = n +    e_prs(8) ElseIf p <= 7 And e_tok = &quot;-&quot;   Then Call e_nxt: n = n -    e_prs(8) ElseIf p <= 6 And e_tok = &quot;=&quot;   Then Call e_nxt: n = n =    e_prs(7) ElseIf p <= 6 And e_tok = &quot;<&quot;   Then Call e_nxt: n = n <    e_prs(7) ElseIf p <= 6 And e_tok = &quot;>&quot;   Then Call e_nxt: n = n >    e_prs(7) ElseIf p <= 6 And e_tok = &quot;<>&quot;  Then Call e_nxt: n = n <>   e_prs(7) ElseIf p <= 6 And e_tok = &quot;<=&quot;  Then Call e_nxt: n = n <=   e_prs(7) ElseIf p <= 6 And e_tok = &quot;>=&quot;  Then Call e_nxt: n = n >=   e_prs(7) ElseIf p <= 5 And e_tok = &quot;and&quot; Then Call e_nxt: n = n And  e_prs(6) ElseIf p <= 4 And e_tok = &quot;or&quot;  Then Call e_nxt: n = n Or   e_prs(5) ElseIf p <= 3 And e_tok = &quot;xor&quot; Then Call e_nxt: n = n Xor  e_prs(4) ElseIf p <= 2 And e_tok = &quot;eqv&quot; Then Call e_nxt: n = n Eqv  e_prs(3) ElseIf p <= 1 And e_tok = &quot;imp&quot; Then Call e_nxt: n = n Imp  e_prs(2) Else Exit Do End If Loop

e_prs = n End Function

' e_function. '  Evaluate a function. This is a helper function to simplify '  e_prs. Function e_function (fun As String, arg As Double) As Double Dim n As Double

Select Case LCase$(fun) Case &quot;abs&quot;: n = Abs(arg) Case &quot;atn&quot;: n = Atn(arg) Case &quot;cos&quot;: n = Cos(arg) Case &quot;exp&quot;: n = Exp(arg) Case &quot;fix&quot;: n = Fix(arg) Case &quot;int&quot;: n = Int(arg) Case &quot;log&quot;: n = Log(arg) Case &quot;rnd&quot;: n = Rnd(arg) Case &quot;sgn&quot;: n = Sgn(arg) Case &quot;sin&quot;: n = Sin(arg) Case &quot;sqr&quot;: n = Sqr(arg) Case &quot;tan&quot;: n = Tan(arg) Case Else If Not e_error Then MsgBox &quot;undefined function '&quot; + fun + &quot;'&quot; e_error = -1 End If  End Select

e_function = n End Function

' e_nxt '  Get the next token into e_tok and e_spelling and remove the '  token from e_input. '  This function groups the input into &quot;words&quot; like numbers, '  operators and function names. Sub e_nxt Dim is_keyword As Integer Dim c As String ' Current input character.

e_tok = &quot;&quot; e_spelling = &quot;&quot;

' Skip whitespace. Do     c = Left$(e_input, 1) e_input = Mid$(e_input, 2) Loop While c = &quot; &quot; Or c = Chr$(9) Or c = Chr$(13) Or c = Chr$(10)

Select Case LCase$(c)

' Number constant. Modify this to support hexadecimal, etc.  Case &quot;0&quot; To &quot;9&quot;, &quot;.&quot; e_tok = &quot;num&quot; Do        e_spelling = e_spelling + c         c = Left$(e_input, 1) e_input = Mid$(e_input, 2) Loop While (c >= &quot;0&quot; And c <= &quot;9&quot;) Or c = &quot;.&quot; e_input = c + e_input

' Identifier or keyword. Case &quot;a&quot; To &quot;z&quot;, &quot;_&quot; e_tok = &quot;id&quot; Do        e_spelling = e_spelling + c         c = LCase$(Left$(e_input, 1)) e_input = Mid$(e_input, 2) is_id% = (c >= &quot;a&quot; And c <= &quot;z&quot;) is_id% = is_id% Or c = &quot;_&quot; Or (c >= &quot;0&quot; And c <= &quot;9&quot;) Loop While is_id% e_input = c + e_input

' Check for keyword. is_keyword = -1 Select Case LCase$(e_spelling) Case &quot;and&quot; Case &quot;eqv&quot; Case &quot;imp&quot; Case &quot;mod&quot; Case &quot;not&quot; Case &quot;or&quot; Case &quot;xor&quot; Case Else: is_keyword = 0 End Select If is_keyword Then e_tok = LCase$(e_spelling) End If

' Check for <=, >=, <>. Case &quot;<&quot;, &quot;>&quot; e_tok = c     c = Left$(e_input, 1) If c = &quot;=&quot; Or c = &quot;>&quot; Then e_tok = e_tok + c        e_input = Mid$(e_input, 2) End If

' Single character token. Case Else e_tok = c  End Select

If e_spelling = &quot;&quot; Then e_spelling = e_tok End If End Sub

' e_match '  Check the current token and skip past it. '  This function helps with syntax checking. Sub e_match (token As String) If Not e_error And e_tok <> token Then MsgBox &quot;expected &quot; + token + &quot;, got '&quot; + e_spelling + &quot;'&quot; e_error = -1 End If  Call e_nxt End Sub  Press F5 to run the program. Type an expression into Text1 such as &quot;1+2*3^4&quot;. Click Command1.</li></ol>

The program displays the result, 163 in this case.

Additional query words: 2.00 3.00

Keywords: KB86688

-

[mailto:TECHNET@MICROSOFT.COM Send feedback to Microsoft]

© Microsoft Corporation. All rights reserved.