-
Notifications
You must be signed in to change notification settings - Fork 0
/
pcalcexp.pas
1472 lines (1431 loc) · 46.3 KB
/
pcalcexp.pas
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
{
PCalcExp.pas version 1.1 - a pascal/delphi unit that convert a string
to postfix and that calculates the postfix
expression
Copyright (C) 2004 Gert van den Berg
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
}
{
Notes on compiling this program:
--------------------------------
General:
--------
Free Pascal or Delphi 9 should generate the most effcient code
Free Pascal:
------------
none
Turbo/Borland Pascal:
---------------------
Free Pascal compilation is recommended since it generates faster 32bit
code
BP only: Set target to REAL MODE or "Protected mode"
Delphi:
-------
Only Delphi 9 supports inlining. The source code should be modified in
order for this to work
}
{$B-}
{$N+}
{$IFDEF FPC}
{$INLINE ON}
{$Define MATH} // use math unit for faster calculations
{$MODE DELPHI}
{$DEFINE DELPHI}
{$R-}
{$GOTO ON}
{$ENDIF}
{$IFDEF DPMI}
{$DEFINE MSDOS}
{$ENDIF}
{$IFDEF DELPHI}
{$Define Math} // use math unit for faster calculations
{$H-}{no "Huge"(ANSI) Strings in delphi and Kylix (Turbo Pascal doesn't
support "Huge" Strings)}
{$ENDIF}
unit Pcalcexp;
{
This unit contains procedures to convert a mathematical expression
in a string to postfix notation and to calculate the value of the
postfix expression.
This unit provides the following:
TYPES:
------
postft : Type used for storing postfix
Other types: See source code
DELPHI & FREE PASCAL ONLY:
EPCalcexpError : Execption class that is raised when errors are
encountered see calcResult for details.
GLOBAL VARIABLES:
-----------------
CalcError : Integer (TP/BP) / Smallint (FPC/Delphi)
Holds the value to be returned by CalcResult (See below)
pcalcexception : boolean
Delphi / Free Pascal:
Controls whether exceptions are raised on errors. Default = true
Turbo / Boland Pascal:
For compatibility only. Ignored.
PROCEDURES AND FUNCTIONS:
-------------------------
Procedure String2postf(str : string; var postf : postft);
Converts the string in str to postfix and store result in postf
NOTE: 1. In Delphi str is of type ShortString
2. Run CalcResult to see if conversion was successful (see below)
before calculating postf.
Procedure PreCalcPostfix(var postf : postft);
Calculates (almost) everything that can be calculated in postf without
the variable values and store result back into postf
NOTE: This is used to speed up the calculation of postf with multiple
values for the variables. Therefore there it is unneccesary to
use it if postf is to be calculated for only one variable value
or if postf contains no variables. Ideal for graphing.
Function Calcpostfix(var postf : postft;x,y,z : extended) : extended;
Calculates the value of postf if first variable = x, second variable = y,
ect. Returns result.
Function CalcResult : integer;
Returns: last error code.
NOTE: Use this to see if a operation ran successfully.
Function Power(x,y : extended):Extended;
Returns: Result of x^y
Function pcalcErrorMsg(code : integer) : string;
Returns: Description of error no. in code
}
Interface
{$IFDEF MATH}
Uses Sysutils;
{$ENDIF}
{$ifdef math}
var
calcerror : smallint;
pcalcexception : boolean;
{$else}
var
calcerror : integer;
pcalcexception : boolean;
{$endif}
Type
{$IFDEF MATH} {Under FP & Delphi}
EPCalcExpError = Class(Ematherror);
{$Else} {Only under TP}
Smallint = integer;
shortstring = string;
{$ENDIF}
RealStack = Object
Items : Array[1..30] of extended;
count : byte;
Procedure Push(value : extended);
Procedure Pop (var into : extended);
Function PopF : extended;
constructor Clear;
End;
StringStack = Object
Items : Array[1..50] of string[30];
count : byte;
Procedure Push(value : shortstring);
Procedure Pop (var into : shortstring);
Procedure Delete(index : byte);
Procedure Insert(index : byte;value : shortstring);
Function PopF : shortstring;
constructor Clear;
End;
EntryT = (func,valu,oper,cons,empty,v1,v2,v3);
PostFItemT = Record
itemtype : EntryT;
func : String[30];
valu : extended;
oper : char;
End;{of record}
PostFT = Object
count : byte;
items : array[1..40] of PostFitemT;
Procedure Add (item : postfitemT);
Procedure Delete(index : byte);
Procedure Get(index : byte;var into : postfitemt;del : boolean);
constructor Clear;
End;
Procedure String2postf(str : shortstring; var postf : postft);
Procedure PreCalcPostfix(var postf : postft);
Function Calcpostfix(const postf : postft;const x,y,z : extended) : extended;
Function CalcResult : smallint;
Function Power(x,y : extended):Extended;
Function pcalcErrorMsg(code : smallint) : shortstring;
implementation
{$ifdef Math} // under free pascal & Delphi
Uses math;
{$endif}
const
Funccount = 36;
Functions : Array[1..funccount] of String[10]
= ('ASIN','ARCSIN','ACOS','ARCCOS','ATAN','ARCTAN','SIN',
'COS','TAN','COT','SEC','COSEC','NEG','LN','LOG',
'EXP','TRUNC','ABS','ROUND','SQR','DEG','SQRT','SINH',
'COSH','TANH','ARCSINH','ARCTANH','ARCCOSH','ASINH',
'ATANH','ACOSH','SECH','COSECH','CSCH','COTH','CSC');{}
var pi : extended;
{=Object methods==========================================================}
Procedure Realstack.Push(value : extended);
Begin
Inc(count);
Items[count] := value;
End;
{-------------------------------------------------------------------------}
Procedure Realstack.Pop(var into : extended);
Begin
If count > 0 then
Begin
into := items[count];
{ items[count] := 0;}
FillChar(items[count],sizeof(items[count]),0);
Dec(count);
End else
Begin
Into := 0;
calcerror := 401;
End;
End;
{-------------------------------------------------------------------------}
Function Realstack.PopF : extended;
var tmp : extended;
Begin
pop(tmp);
popf := tmp;
End;
{-------------------------------------------------------------------------}
Constructor Realstack.Clear;
var i :byte;
Begin
count := 0;
for i := 1 to 30 do
items[i] := 0;
End;
{-End of realstack start of stringstack-----------------------------------}
Procedure Stringstack.Push(value : shortstring);
Begin
Inc(count);
Items[count] := value;
End;
{-------------------------------------------------------------------------}
Procedure Stringstack.Delete(index : byte);
Begin
If count <= 1 then clear else
Begin
Move(items[index+1],Items[index],Sizeof(Items[index])*(count-index));
{ For i := index to count-1 do
items[i] := items[i+1];}
{ items[count] := '';}
FillChar(items[count],sizeof(items[count]),0);
dec(count);
End;
End;
{-------------------------------------------------------------------------}
Procedure Stringstack.Insert(index : byte;value : shortstring);
var i : byte;
Begin
for i := count downto (index) do
items[i+1] := items[i];
items[index] := value;
inc(count);
End;
{-------------------------------------------------------------------------}
Procedure stringstack.Pop(var into : shortstring);
Begin
If count > 0 then
Begin
into := items[count];
{ items[count] := '';}
FillChar(items[count],sizeof(items[count]),0);
Dec(count);
End else
Begin
Into := '';
calcerror := 402;
End;
End;
{-------------------------------------------------------------------------}
Function Stringstack.PopF : shortstring;
var tmp : shortstring;
Begin
pop(tmp);
popf := tmp;
End;
{-------------------------------------------------------------------------}
Constructor Stringstack.Clear;
Begin
count := 0;
FillChar(items,sizeof(items),0);
{ for i := 1 to 50 do
items[i] := ''; {}
End;
{-end of stringstack satart of postft-------------------------------------}
Procedure PostFT.Add(item : postfitemT);
Begin
Inc(count);
Items[count] := item;
End;
{-------------------------------------------------------------------------}
Procedure PostFT.Delete(index : byte);
Begin
If count <= 1 then clear else
Begin
Move(items[index+1],Items[index],Sizeof(Items[index])*(count-index));
{ For i := index to count-1 do
items[i] := items[i+1];}
{items[count].itemtype := empty;
items[count].valu := 0;
items[count].func := '';
items[count].oper := #0;}
FillChar(items[count],sizeof(items[count]),0);
dec(count);
End;
End;
{-------------------------------------------------------------------------}
Procedure PostFT.Get(index : byte;var into : postfitemt;del : boolean);
Begin
into := items[index];
If del then delete(index);
End;
{-------------------------------------------------------------------------}
Constructor PostFt.Clear;
{var i :byte;
tmp : PostfitemT;}
Begin
count := 0;
{ with tmp do
Begin
valu := 0;
func := '';
oper := #0;
itemtype := empty;
End;
for i := 1 to 40 do
items[i] := tmp;}
FillChar(items,sizeof(items),0);
End;
{-End of postft-----------------------------------------------------------}
{=====End of methods======================================================}
Procedure CalcExpError(code : integer);
{$IFDEF FPC}inline;{$endif}
Begin
calcerror := code;
End;
{-------------------------------------------------------------------------}
Procedure RaiseExcept;
{$IFDEF Math}
var
errorstring : ansistring;
{$ENDIF}
Begin
{$IFDEF Math}
if (calcerror <> 0) and pcalcexception then
Begin
errorstring := 'PCalcExp: Parser Error '+InttoStr(calcerror);
errorstring := errorstring + ': '+Pcalcerrormsg(calcerror);
raise EPCalcExpError.create(PChar(errorstring));
End;
{$ENDIF}
End;
{-------------------------------------------------------------------------}
Function Divide(x,y:extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFDEF math}
try
divide := x/y;
except
Divide := 0;
calcexperror(101);
end;
{$Else}
If (y <> 0) and (calcerror = 0) then divide := x/y else
begin
Divide := 0;
calcexperror(101);
End;
{$endif}
End;
{-------------------------------------------------------------------------}
Function ln(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
ln := system.ln(x);
except
ln := 0;
calcexperror(102);
end;
{$else}
If x > 0 then ln := system.ln(x) else
Begin
calcexperror(102);
ln := 0;
End;
{$endif}
End;
{-------------------------------------------------------------------------}
Function sqrt(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
sqrt := system.sqrt(x)
except
sqrt := 0;
calcexperror(103);
end;
{$else}
If x >= 0 then sqrt := system.sqrt(x) else
Begin
calcexperror(103);
sqrt := 0;
End;
{$endif}
End;
{-------------------------------------------------------------------------}
function arcsin(ratio : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$IFdef Math}
try
arcsin := math.arcsin(ratio);
except
calcexperror(107);
arcsin := 0;
End;
{$Else}
If (ratio < -1) or (ratio > 1) then
Begin
arcsin := 0;
calcexperror(104);
End
else
arcsin := arctan(Divide(ratio,sqrt((1 - sqr(ratio)))));
{$endif}
end;
{-------------------------------------------------------------------------}
function arccos(ratio : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$IFdef Math}
try
arccos := math.arccos(ratio);
except
calcexperror(107);
arccos := 0;
End;
{$Else}
If (ratio < -1) or (ratio > 1) then
Begin
arccos := 0;
calcexperror(105);
End
else
arccos := -arcsin(ratio) + pi/2;
{$endif}
end;
{-------------------------------------------------------------------------}
function tan(angle : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$Ifdef math}
try
tan := math.tan(angle)
except
calcexperror(107);
tan := 0;
End;
{$else}
tan := divide(sin(angle), cos(angle));
{$endif}
end;
{-------------------------------------------------------------------------}
function cot(angle : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$Ifdef math}
try
cot := math.cotan(angle)
except
calcexperror(107);
cot := 0;
end;
{$else}
cot := divide(cos(angle), sin(angle));
{$endif}
end;
{-------------------------------------------------------------------------}
function cosec(angle : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$IFdef Math}
try
cosec := 1/system.sin(angle);
except
cosec := 0;
calcexperror(107);
end;
{$else}
cosec := divide(1, sin(angle));
{$endif}
end;
{-------------------------------------------------------------------------}
function sec(angle : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$IFdef Math}
try
sec := 1/system.cos(angle);
except
sec := 0;
calcexperror(107);
end;
{$else}
sec := divide(1, cos(angle));
{$endif}
end;
{-------------------------------------------------------------------------}
function log(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
begin
{$IFdef Math}
try
log := math.log10(x);
except
calcexperror(107);
log := 0;
end;
{$else}
log := Divide(ln(x), exp(1));
{$endif}
end;
{-------------------------------------------------------------------------}
Function sinh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
sinh := Math.sinh(x);
except
calcexperror(107);
sinh := 0;
end;
{$else}
sinh := (exp(x)-exp(-x)/2)
{$endif}
End;
{-------------------------------------------------------------------------}
Function cosh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
cosh := math.cosh(x);
except
calcexperror(107);
cosh := 0;
end;
{$else}
cosh := (exp(x)+exp(-x))/2
{$endif}
End;
{-------------------------------------------------------------------------}
Function tanh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
tanh := math.tanh(x);
except
calcexperror(107);
tanh := 0;
end;
{$else}
tanh := Divide(sinh(x),cosh(x));
{$endif}
End;
{-------------------------------------------------------------------------}
Function sech(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
sech := 1/Math.cosh(x);
except
calcexperror(107);
sech := 0;
end;
{$else}
sech := Divide(1,cosh(x));
{$endif}
End;
{-------------------------------------------------------------------------}
Function cosech(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
cosech := 1/math.sinh(x);
except
calcexperror(107);
cosech := 0;
end;
{$else}
cosech := Divide(2,(exp(x)+exp(-x)))
{$endif}
End;
{-------------------------------------------------------------------------}
Function coth(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
coth := 1/math.tanh(x);
except
calcexperror(107);
coth := 0;
end;
{$else}
coth := Divide(cosh(x),sinh(x));
{$endif}
End;
{-------------------------------------------------------------------------}
Function arcsinh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
arcsinh := math.arsinh(x);
except
calcexperror(107);
arcsinh := 0;
end;
{$else}
arcsinh := ln(x+sqrt(x*x+1))
{$endif}
End;
{-------------------------------------------------------------------------}
Function arccosh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
arccosh := math.arcosh(x);
except
calcexperror(107);
arccosh := 0;
end;
{$else}
arccosh := ln(x+sqrt(x*x-1))
{$endif}
End;
{-------------------------------------------------------------------------}
Function arctanh(x : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFNDEF FPC} {Free pascal has a bug in its artan function}
{$IFdef Math}
try
arctanh := math.artanh(x);
except
calcexperror(107);
arctanh := 0;
end;
{$else}
arctanh := ln(divide((1+x),(1-x)))/2;
{$endif MATH}
{$ELSE}
if (x < 1) and (x > -1) then
arctanh := ln(divide((1+x),(1-x)))/2
else
Begin
arctanh := 0;
calcexperror(107);
End;
{$endif FPC}
End;
{-------------------------------------------------------------------------}
Function fmod(x,y : extended) : extended;
{$IFDEF FPC}inline;{$endif}
Begin
{$IFdef Math}
try
fmod := x - int(x / y)*y;
except
calcexperror(107);
fmod := 0;
end;
{$else}
fmod := x - int(x / y)*y;
{$endif}
End;
{-------------------------------------------------------------------------}
Function Power(x,y : extended):Extended;
{$IFDEF FPC}inline;{$endif}
{$IFndef Math}
Function Teken(mag : double) : shortint;
var int : longint;
Begin
int := trunc(mag);
If odd(int) then teken := -1 else teken := 1
End;
{$ENDIF}
Begin
{$IFdef Math}
try
if (x < 0) and (y=int(y)) then power := math.intpower(x,trunc(y))
else
power := math.power(x,y);
except
power := 0;
calcexperror(106);
end;
{$else}
If (calcerror = 0) then
Begin
IF (x < 0) and (y=int(y)) then power := teken(y)*exp(y*ln(abs(x))) else
IF y = 0 then power := 1 else
IF x = 0 then power := 0 else
IF x > 0 then power := exp(y*ln(x)) else calcexpError(106);
End else power := 0;
{$endif}
RaiseExcept;
End;
{-------------------------------------------------------------------------}
Function CalcResult : smallint;
Begin
calcresult := calcerror;
calcerror := 0;
End;
{==Procedures and functions===============================================}
{$IFNDEF Math}
function UpperCase(S: shortstring): shortstring;
var
I: Integer;
begin
for I := 1 to Length(S) do
if (S[I] >= 'a') and (S[I] <= 'z') then
Dec(S[I], 32);
UpperCase := S;
end;
{$ENDIF}
{-------------------------------------------------------------------------}
Function IsFunction (str : shortstring) : boolean;
var i : byte;
Begin
IsFunction := false;
str := Uppercase(str);
For i := 1 to funccount do
If functions[i] = str then IsFunction := true;
End;
{-------------------------------------------------------------------------}
Function IsNumber (str : shortstring) : boolean;
var i : byte;
Begin
IsNumber := true;
If not(str[1] in ['0'..'9']) then
IsNumber := false;
for i := 2 to length(str) do
if not (str[i] in['0'..'9','E','.'{,'-','+'}]) then
Isnumber := false;
End;
{-------------------------------------------------------------------------}
Procedure String2postf(str : shortstring; var postf : postft);
{ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - }
Procedure Strip(var toupper : shortstring);
var
i,j : byte;
t : string;
b : shortint; {used to check brackets}
begin
t := '';
For i := 1 to length(toupper) do
Begin
if (toupper[i] = '[') then toupper[i] := '(';
if (toupper[i] = ']') then toupper[i] := ')';
End;
{ If toupper[1] = '-' then toupper := '0'+toupper;{}
For i := 1 to length(toupper) do
Begin
If toupper[i] in ['A'..'Z','0'..'9','(',')','^'{,'!'},'+','-','*','/','.',',','%'] then
t := t + toupper[i];
End;
toupper := t;
t := '';
For i := 1 to length(toupper) do
if (toupper[i] <> ',') then
t := t + toupper[i] else
t := t + '.';
toupper := t;
b := 0;
For i := 1 to length(toupper) do
Begin
If toupper[i] = '(' then inc(b) else
If toupper[i] = ')' then dec(b);
End; {If brackets are correct b will be 0}
While b > 0 do {Add missing brackets to end}
Begin
toupper := toupper + ')';
dec(b);
if b < 0 then calcexperror(201);
End;
i := 1;
While i < Length(toupper) do
Begin
Inc(i);
If ((toupper[i] in ['A'..'Z']) and (Toupper[i-1] in ['0'..'9'])) or
((toupper[i] in ['X','Y','Z']) and (toupper[i-1] in ['Y','X','Z'])) then
Begin
Toupper := toupper + ' ';{Increase length with one char}
For j := (length(toupper)) downto i+1 do
toupper[j] := toupper[j-1];
toupper[i] := '*';
End;{If}
End;
end;
{ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - }
Procedure RemoveUnarymin(var inp : stringstack);
var finished : boolean;
i : integer;
ts : shortstring;
strt, nd : word;
c1,c2 : smallint;
Begin
Repeat
finished := true;
i := 1;
c1 := 0; c2 := 0; {Initialize genral purpose counters}
While (i <= (inp.count)) and (calcerror = 0) do
Begin
finished := true;
strt := 0; nd := 0;
if i > 1 then
ts := inp.items[i-1] else ts := 'b (';
if (inp.items[i] = '1 -') then
Begin
If (ts = 'b (') then
Begin
strt := i+1;
ts := inp.items[i+1];
if ((ts = 'b (') or (ts[1] = 'f')) then
begin
if (ts[1] <> 'f') then c2 := i+2 else c2 := i+3;
c1 := 1;
While (c1 > 0) and (c2 <= inp.count) do
Begin
If (inp.items[c2] = 'b (') then inc(c1) else
if (inp.items[c2] = 'b )') then dec(c1);
Inc(c2);
End;
if c1 <> 0 then calcexperror(208) else finished := false;
nd := c2;
c1 := 0;
c2 := 0;
end {'b ('} else
if (ts[1] in ['v','c','x','y','z']) then
Begin
strt := i+1;
c2 := i+1;
c1 := 0;{bracket level counter}
While ((c1 > 0) or (inp.items[i,1] <> '1')) and
(c2 <= inp.count) and
not ((c1 = 0) and (inp.items[i] = 'b )')) do
Begin
ts := inp.items[c2];
if (ts = 'b (') then inc(c1) else
if (ts = 'b )') then dec(c1);
inc(c2);
End;{While}
nd := c2+1;
if c1 = 0 then finished := false else calcexperror(208);
end else calcexperror(208);
i := 1;
End;
End; {end if - encoutered}
inc(i);
if (not(finished)) and (strt > 0) and (nd > strt) then
Begin
inp.insert(nd,'b )');
inp.insert(strt,'b (');
inp.insert(strt,'f NEG');
inp.delete(strt -1);
End;
End;
until (finished) or (calcerror <> 0);
End;
{ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - }
var i,j : byte;
ts : string[30];
apart : stringstack;
ttype : char;
tr : Extended;{Temp Real}
ec : integer; {ec = error code}
item : PostFItemT;
opstack : StringStack;
bracket : boolean;
Begin
str := Uppercase(str);
postf.clear;
opstack.clear;
apart.clear;
calcerror := 0;
If length(str) < 1 then calcexperror(207);
If (calcerror = 0) then Strip(str);
i := 0;
While (i < length(str)) and (calcerror = 0) do
Begin
Inc(i);
ts := '';
While (not(str[i] in ['+','-','*','^','%','/','(',')','[',']']))
and (i <= length(str)) do
Begin
ts := ts + str[i];
inc(i);
End;
If (length(ts) > 0) then
apart.push(ts);
if i <= length(str) then
apart.push(str[i]);
End;{Components of str now in the stringstack, "apart"}
i := 1;
ttype := #0;
While (i <= apart.count) and (calcerror = 0) do{check if every statement is valid and identify}
Begin {it}
If (length(apart.items[i]) > 1) then
Begin
If IsFunction(apart.items[i])
then ttype := 'f' {function}
else{If not a function}
If ((apart.items[i] = 'PI')) THEN
ttype := 'c' {constant} else {and not a constant}
Begin{check if value}
If IsNumber(apart.items[i]) then
ttype := 'v'{value}
else
ttype := #0;{Error if not a number}
End;
End
else
Begin {If length = 1}
If (length(apart.items[i]) = 0) then apart.delete(i)
else
case apart.items[i,1] of
'+','-' : ttype := '1'; {Lowest level of operator}
'*','/','%': ttype := '2'; {second level operator}
'^' : ttype := '3'; {Highest level operator}
'X' : ttype := 'x'; {First variable}
'Y' : ttype := 'y'; {Second variable}
'Z' : ttype := 'z'; {Third variable}
'E' : ttype := 'c'; {e(=2.7...)}
'(',')' : ttype := 'b'; {Bracket}
'0'..'9' : ttype := 'v'; {value}
else ttype := #0
End;
End;
If ttype = #0 then
Begin
calcexperror(202);
Postf.clear;
Exit;
End;
Apart.items[i] := ttype + ' ' + apart.items[i];{Add type identifier and space to front of string}
Inc(i);
End;{Of identification While loop}
{All parts of expression is now identified and in apart with identifier
character at start of strings}
i := 1;
While i+1 < apart.count do
Begin
If ((apart.items[i] = 'b )') and (apart.items[i+1] = 'b (')) or
((apart.items[i,1] in ['x','y','v']) and (apart.items[i+1] = 'b (')) then
Apart.insert(i+1,'2 *');
inc(i);
End;
{(...)(....) converted to (...)*(....)}
RemoveUnarymin(apart);
{Start of conversion}
If (calcerror = 0) then
For i := 1 to apart.count do
Begin
ts := '';
item.itemtype := empty;
item.valu := 0;
item.oper := #0;
item.func := '';
For j := 1 to (length(apart.items[i])-2) do
ts := ts + apart.items[i,j+2];{set ts to item WITHOUT identifier}
Case apart.items[i,1] of
'v' : Begin{value}