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
|
#!perl
# BEGIN{$::RD_HINT = 1;}
use strict;
use warnings;
use Test::More tests => 23+15+9;
BEGIN {
use_ok('Math::Symbolic');
}
if ($ENV{TEST_YAPP_PARSER}) {
require Math::Symbolic::Parser::Yapp;
$Math::Symbolic::Parser = Math::Symbolic::Parser::Yapp->new();
}
use Math::Symbolic::ExportConstants qw/:all/;
my $tree;
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('2');
HERE
ok( ( !$@ and ref($tree) eq 'Math::Symbolic::Constant' ), 'Parsing constants' );
my $str;
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('2*2');
HERE
$str = $tree->to_string();
$str =~ s/\(|\)|\s+//g;
ok( ( !$@ and $str eq '2*2' ), 'Parsing multiplication' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('(2+2)*2');
HERE
$str = $tree->to_string();
$str =~ s/\s+//g;
ok( ( !$@ and $str eq '(2+2)*2' ), 'Parsing parens and addition, precedence' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('2-2+2-2');
HERE
# as of version 0.160, this is no longer true.
# The parser doesn't reorder the same way it used to.
# It was a bad test anyway.
#$str = $tree->to_string();
#$str =~ s/\s+//g;
#ok(
# ( !$@ and $str eq '((2+2)-2)-2' ),
# 'Parsing difference, chaining, reordering'
#);
ok( !$@, 'no fatal error.');
is($tree->value(), 2+2-2-2, 'Parsing difference, chaining.' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('-2');
HERE
$str = $tree->to_string();
$str =~ s/\s+//g;
ok( ( !$@ and $str eq '-2' ), 'Parsing unary' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('5^log(2,4)');
HERE
$str = $tree->to_string('prefix');
$str =~ s/\s+//g;
ok( ( !$@ and $str eq 'exponentiate(5,log(2,4))' ), 'Parsing exp and log' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('1+2*(-5)^log(2,4)');
HERE
$str = $tree->to_string('prefix');
$str =~ s/\s+//g;
ok( ( !$@ and $str eq 'add(1,multiply(2,exponentiate(-5,log(2,4))))' or $str eq 'add(1,multiply(2,exponentiate(negate(5),log(2,4))))' ),
'Parsing complicated term' );
undef $@;
eval <<'HERE';
$tree = Math::Symbolic->parse_from_string('cos(sin(1+2*-5^log(2,4)))');
HERE
$str = $tree->to_string('prefix');
$str =~ s/\s+//g;
ok(
(
!$@
and $str eq
'cos(sin(add(1,multiply(2,exponentiate(-5,log(2,4))))))'
or $str eq
'cos(sin(add(1,multiply(2,exponentiate(negate(5),log(2,4))))))'
),
'Parsing complicated term involving sine and cosine'
);
my $res;
eval {
$res = Math::Symbolic->parse_from_string('blah[blubb');
};
ok((not defined($res)), 'Parse fails on invalid string.');
eval {
$res = Math::Symbolic->parse_from_string('exp(a*b)');
};
ok( !$@, 'parsing exp() does not throw an error');
isa_ok($res, 'Math::Symbolic::Operator', 'parsing exp() returns an operator');
my $string = $res->to_string('prefix');
ok( ($string =~ /^exponentiate\(2\.7\d*,\s*multiply\(a,\s*b\)\)$/),
'Parse of exp() turns it into e^()'
);
eval {
$res = Math::Symbolic->parse_from_string('sqrt(a*b)');
};
ok( !$@, 'parsing sqrt() does not throw an error');
isa_ok($res, 'Math::Symbolic::Operator', 'parsing sqrt() returns an operator');
$string = $res->to_string('prefix');
ok( ($string =~ /^exponentiate\(multiply\(a,\s*b\), 0.5\)$/),
'Parse of sqrt() turns it into ()^0.5'
);
# test the ' notation
sub test_parse {
my ($str, $type, $cmpregex) = @_;
my $res;
eval <<HERE;
\$res = Math::Symbolic->parse_from_string(q{$str});
HERE
ok( !$@, "parsing '$str' does not throw an error");
warn "Error was: $@" if $@;
isa_ok($res, "Math::Symbolic::$type", "parsing '$str' returns an operator");
my $string = $res->to_string('prefix');
ok( ($string =~ $cmpregex),
"Parse of '$str' turns it into $cmpregex"
);
}
my @testsets = (
[
"f'(x)", "Operator",
qr/^partial_derivative\(f,\s*x\)$/,
],
[
"f'", "Operator",
qr/^partial_derivative\(f,\s*x\)$/,
],
[
"f'(a)", "Operator",
qr/^partial_derivative\(f,\s*a\)$/,
],
[
"f'(a, x)", "Operator",
qr/^partial_derivative\(f,\s*a\)$/,
],
[
"f''(x)", "Operator",
qr/^partial_derivative\(partial_derivative\(f,\s*x\),\s*x\)$/,
],
[
"f''", "Operator",
qr/^partial_derivative\(partial_derivative\(f,\s*x\),\s*x\)$/,
],
[
"f''(a)", "Operator",
qr/^partial_derivative\(partial_derivative\(f,\s*a\),\s*a\)$/,
],
[
"f''(a, x)", "Operator",
qr/^partial_derivative\(partial_derivative\(f,\s*a\),\s*a\)$/,
],
);
foreach my $testset (@testsets) {
test_parse(@$testset);
}
# test failure of parse_from_string
eval {
$res = Math::Symbolic::parse_from_string();
};
ok ($@, 'parse_from_string complains about being called without args');
eval {
$res = Math::Symbolic->parse_from_string();
};
ok ($@, 'parse_from_string complains about being called as method without args');
$Math::Symbolic::Parser = undef;
eval {
$res = Math::Symbolic::parse_from_string('2');
};
ok(!$@ && ref($res) =~ /^Math::Symbolic/, 'parse_from_string creates a new parser if necessary');
my $yapp = Math::Symbolic::Parser->new(implementation => 'Yapp');
isa_ok($yapp, 'Math::Symbolic::Parser::Yapp');
my $rd = Math::Symbolic::Parser->new(implementation => 'RecDescent', recompile => 1);
ok(defined($rd) && $rd->isa('Parse::RecDescent')||$rd->isa('Math::Symbolic::Parser::Precompiled'), 'chose implementation RecDescent');
eval {$rd = Math::Symbolic::Parser->new(implementation=>'foo');};
ok ($@, 'Cannot create parser of unknown implementation');
|
