Parser-LR v20191119 Perl 5 v5.30.0 x86_64-linux-thread-multi
- Status
- Fail
- From
- David Cantrell (DCANTRELL)
- Dist
-
Parser-LR v20191119
- Platform
- Perl 5 v5.30.0 x86_64-linux-thread-multi
- Date
- 2019-11-22 04:43:21
- ID
- 9c93b2e2-0ce2-11ea-847a-f66b052d0de1
This distribution has been tested as part of the CPAN Testers
project, supporting the Perl programming language. See
http://wiki.cpantesters.org/ for more information or email
questions to cpan-testers-discuss@perl.org
--
Dear Philip R Brenan,
This is a computer-generated report for Parser-LR-20191119
on perl 5.30.0, created by CPAN-Reporter-1.2018.
Thank you for uploading your work to CPAN. However, there was a problem
testing your distribution.
If you think this report is invalid, please consult the CPAN Testers Wiki
for suggestions on how to avoid getting FAIL reports for missing library
or binary dependencies, unsupported operating systems, and so on:
http://wiki.cpantesters.org/wiki/CPANAuthorNotes
Sections of this report:
* Tester comments
* Program output
* Prerequisites
* Environment and other context
------------------------------
TESTER COMMENTS
------------------------------
Additional comments from tester:
this report is from an automated smoke testing program
and was not reviewed by a human for accuracy
------------------------------
PROGRAM OUTPUT
------------------------------
Output from './Build test':
Parse : n
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Reduced in finals by rule 4, expandable: C, stack: C
Reduced in finals by rule 3, expandable: B, stack: B
Reduced in finals by rule 1, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 1 A
2 3 B
3 4 C
4 n
Cannot make path with make_path: because:
/home/phil/z/z/z
mkdir /home/phil: Permission denied at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 901.
at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 3576, <DATA> line 506.
Data::Table::Text::__ANON__("mkdir /home/phil: Permission denied at /home/david/cpantestin"...) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/Carp.pm line 291
Carp::croak("mkdir /home/phil: Permission denied") called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/File/Path.pm line 239
File::Path::_mkpath(HASH(0x5583cfdbaae8), ARRAY(0x5583cfdbed68)) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/File/Path.pm line 195
File::Path::_mkpath(HASH(0x5583cfdbaae8), ARRAY(0x5583cfdbe768)) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/File/Path.pm line 195
File::Path::_mkpath(HASH(0x5583cfdbaae8), ARRAY(0x5583cf78db80)) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/File/Path.pm line 195
File::Path::_mkpath(HASH(0x5583cfdbaae8), ARRAY(0x5583cfdbad40)) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/File/Path.pm line 173
File::Path::mkpath("/home/phil/z/z/z") called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 901
eval {...} called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 901
Data::Table::Text::makePath("/home/phil/z/z/z/zzz.txt") called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 911
Data::Table::Text::overWriteFile("/home/phil/z/z/z/zzz.txt", "Terminal: n, stack: (empty)\x{a} Accept first terminal: n to get"...) called at (eval 56) line 54
tpwg("n") called at (eval 56) line 58
eval 'use Test::More tests => 24;
if (1) {
my $g = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my sub tlmr(@)
{my $r = longestMatchingRule($g, @_);
if ($r)
{delete $r->{print} if $r;
my %r = $r->%*;
#say STDERR nws(dump(\\%r));
}
$r
}
is_deeply tlmr(qw(n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(n + n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(A + B)), {expandable=>"A", expansion=>["A", "+", "B"], rule=>0};
ok !tlmr(qw(n +));
my sub trswr($@)
{my ($rule, @stack) = @_;
my @tree = (q()) x @stack;
my $r = reduceStackWithRule($g->rules->[$rule], \\@stack, \\@tree);
#say STDERR nws(dump(\\@stack));
\\@stack
}
is_deeply trswr(0, qw(A + B)), [qw(A)];
is_deeply trswr(0, qw(n A + B)), [qw(n A)];
is_deeply trswr(4, qw(B * n)), [qw(B * C)];
is_deeply trswr(3, qw(B * n)), [qw(B * B)]; # There is no check that the rule actually applies
my sub tpm(@)
{my (@stack) = @_;
my $r = partialMatch($g, @stack);
$r
}
ok 3 == tpm qw(A + B);
ok 2 == tpm qw(A +);
ok 1 == tpm qw(A);
ok 0 == tpm qw(A -);
my sub tpwg(@)
{my (@stack) = @_;
my $r = parseWithGrammarAndLog($g, @stack) =~ s(\\s+\\Z) (\\n)gsr;;
owf($logFile, $r);
$r
}
ok tpwg(qw(n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Reduced in finals by rule 4, expandable: C, stack: C
Reduced in finals by rule 3, expandable: B, stack: B
Reduced in finals by rule 1, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 1 A
2 3 B
3 4 C
4 n
END
ok tpwg(qw(n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 3 B
4 4 C
5 n
6 +
7 3 B
8 4 C
9 n
END
ok tpwg(qw(n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 3 B
12 4 C
13 n
END
ok tpwg(qw(n * n + n * n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Reduced in finals by rule 4, expandable: C, stack: A + B * C
Reduced in finals by rule 2, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
ok tpwg(qw(n + n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Terminal: +, stack: A + B * n
Reduced by rule 4, expandable: C, stack: A + B * C
Reduced by rule 2, expandable: B, stack: A + B
Reduced by rule 0, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 0 A
3 1 A
4 3 B
5 4 C
6 n
7 +
8 2 B
9 3 B
10 4 C
11 n
12 *
13 4 C
14 n
15 +
16 3 B
17 4 C
18 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my $tree = parseWithGrammar($grammar, qw(n * n + n * n));
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A plus B
A B
B B times C
B C
C value
END
my $tree = parseWithGrammar($grammar, qw(value times value plus value times value));
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="0">
<A rule="1">
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="0"/>
</C>
</B>
<times pos="1"/>
<C rule="4">
<value pos="2"/>
</C>
</B>
</A>
<plus pos="3"/>
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="4"/>
</C>
</B>
<times pos="5"/>
<C rule="4">
<value pos="6"/>
</C>
</B>
</A>
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
END
my $tree = parseWithGrammar $grammar, qw/ n * ( n + ( n * [ n ] ) )/, subsitute=>0;
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 2 B
3 3 B
4 4 C
5 n
6 *
7 5 C
8 (
9 0 A
10 1 A
11 3 B
12 4 C
13 n
14 +
15 3 B
16 5 C
17 (
18 1 A
19 2 B
20 3 B
21 4 C
22 n
23 *
24 6 C
25 [
26 1 A
27 3 B
28 4 C
29 n
30 ]
31 )
32 )
END
}
if (1) { #TcompileGrammar #TprintGrammar #TparseWithGrammar #TprintParseTree #TprintParseTreeAsXml
my $grammar = compileGrammar(<<END);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
C { A }
C ( )
C [ ]
C { }
END
ok printGrammar($grammar) eq <<END;
Rule Symbol Expansion
1 0 A A + B
2 1 A B
3 2 B B * n
4 3 B B * ( A )
5 4 B B * [ A ]
6 5 B B * { A }
7 6 B B * ( )
8 7 B B * [ ]
9 8 B B * { }
10 9 B n
11 10 B ( A )
12 11 B [ A ]
13 12 B { A }
14 13 B ( )
15 14 B [ ]
16 15 B { }
END
my $tree = parseWithGrammar($grammar, qw/( [ { } ] + [ { n } ] ) * [ n + n ] /);
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 4 B
3 10 B
4 (
5 0 A
6 1 A
7 11 B
8 [
9 1 A
10 15 B
11 {
12 }
13 ]
14 +
15 11 B
16 [
17 1 A
18 12 B
19 {
20 1 A
21 9 B
22 n
23 }
24 ]
25 )
26 *
27 [
28 0 A
29 1 A
30 9 B
31 n
32 +
33 9 B
34 n
35 ]
END
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="1">
<B rule="4">
<B rule="10">
<"(" pos="0"/>
<A rule="0">
<A rule="1">
<B rule="11">
<"[" pos="1"/>
<A rule="1">
<B rule="15">
<"{" pos="2"/>
<"}" pos="3"/>
</B>
</A>
<"]" pos="4"/>
</B>
</A>
<"+" pos="5"/>
<B rule="11">
<"[" pos="6"/>
<A rule="1">
<B rule="12">
<"{" pos="7"/>
<A rule="1">
<B rule="9">
<n pos="8"/>
</B>
</A>
<"}" pos="9"/>
</B>
</A>
<"]" pos="10"/>
</B>
</A>
<")" pos="11"/>
</B>
<"*" pos="12"/>
<"[" pos="13"/>
<A rule="0">
<A rule="1">
<B rule="9">
<n pos="14"/>
</B>
</A>
<"+" pos="15"/>
<B rule="9">
<n pos="16"/>
</B>
</A>
<"]" pos="17"/>
</B>
</A>
END
ok printGrammarAsXml($grammar) eq <<END
<grammar>
<A><A/><"+"/><B/></A>
<A><B/></A>
<B><B/><"*"/><n/></B>
<B><B/><"*"/><"("/><A/><")"/></B>
<B><B/><"*"/><"["/><A/><"]"/></B>
<B><B/><"*"/><"{"/><A/><"}"/></B>
<B><B/><"*"/><"("/><")"/></B>
<B><B/><"*"/><"["/><"]"/></B>
<B><B/><"*"/><"{"/><"}"/></B>
<B><n/></B>
<B><"("/><A/><")"/></B>
<B><"["/><A/><"]"/></B>
<B><"{"/><A/><"}"/></B>
<B><"("/><")"/></B>
<B><"["/><"]"/></B>
<B><"{"/><"}"/></B>
</grammar>
END
}
done_testing;
' called at lib/Parser/LR.pm line 1831
Parser::LR::test("Parser::LR") called at test.pl line 11
at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 903, <DATA> line 506.
Data::Table::Text::makePath("/home/phil/z/z/z/zzz.txt") called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 911
Data::Table::Text::overWriteFile("/home/phil/z/z/z/zzz.txt", "Terminal: n, stack: (empty)\x{a} Accept first terminal: n to get"...) called at (eval 56) line 54
tpwg("n") called at (eval 56) line 58
eval 'use Test::More tests => 24;
if (1) {
my $g = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my sub tlmr(@)
{my $r = longestMatchingRule($g, @_);
if ($r)
{delete $r->{print} if $r;
my %r = $r->%*;
#say STDERR nws(dump(\\%r));
}
$r
}
is_deeply tlmr(qw(n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(n + n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(A + B)), {expandable=>"A", expansion=>["A", "+", "B"], rule=>0};
ok !tlmr(qw(n +));
my sub trswr($@)
{my ($rule, @stack) = @_;
my @tree = (q()) x @stack;
my $r = reduceStackWithRule($g->rules->[$rule], \\@stack, \\@tree);
#say STDERR nws(dump(\\@stack));
\\@stack
}
is_deeply trswr(0, qw(A + B)), [qw(A)];
is_deeply trswr(0, qw(n A + B)), [qw(n A)];
is_deeply trswr(4, qw(B * n)), [qw(B * C)];
is_deeply trswr(3, qw(B * n)), [qw(B * B)]; # There is no check that the rule actually applies
my sub tpm(@)
{my (@stack) = @_;
my $r = partialMatch($g, @stack);
$r
}
ok 3 == tpm qw(A + B);
ok 2 == tpm qw(A +);
ok 1 == tpm qw(A);
ok 0 == tpm qw(A -);
my sub tpwg(@)
{my (@stack) = @_;
my $r = parseWithGrammarAndLog($g, @stack) =~ s(\\s+\\Z) (\\n)gsr;;
owf($logFile, $r);
$r
}
ok tpwg(qw(n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Reduced in finals by rule 4, expandable: C, stack: C
Reduced in finals by rule 3, expandable: B, stack: B
Reduced in finals by rule 1, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 1 A
2 3 B
3 4 C
4 n
END
ok tpwg(qw(n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 3 B
4 4 C
5 n
6 +
7 3 B
8 4 C
9 n
END
ok tpwg(qw(n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 3 B
12 4 C
13 n
END
ok tpwg(qw(n * n + n * n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Reduced in finals by rule 4, expandable: C, stack: A + B * C
Reduced in finals by rule 2, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
ok tpwg(qw(n + n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Terminal: +, stack: A + B * n
Reduced by rule 4, expandable: C, stack: A + B * C
Reduced by rule 2, expandable: B, stack: A + B
Reduced by rule 0, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 0 A
3 1 A
4 3 B
5 4 C
6 n
7 +
8 2 B
9 3 B
10 4 C
11 n
12 *
13 4 C
14 n
15 +
16 3 B
17 4 C
18 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my $tree = parseWithGrammar($grammar, qw(n * n + n * n));
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A plus B
A B
B B times C
B C
C value
END
my $tree = parseWithGrammar($grammar, qw(value times value plus value times value));
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="0">
<A rule="1">
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="0"/>
</C>
</B>
<times pos="1"/>
<C rule="4">
<value pos="2"/>
</C>
</B>
</A>
<plus pos="3"/>
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="4"/>
</C>
</B>
<times pos="5"/>
<C rule="4">
<value pos="6"/>
</C>
</B>
</A>
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
END
my $tree = parseWithGrammar $grammar, qw/ n * ( n + ( n * [ n ] ) )/, subsitute=>0;
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 2 B
3 3 B
4 4 C
5 n
6 *
7 5 C
8 (
9 0 A
10 1 A
11 3 B
12 4 C
13 n
14 +
15 3 B
16 5 C
17 (
18 1 A
19 2 B
20 3 B
21 4 C
22 n
23 *
24 6 C
25 [
26 1 A
27 3 B
28 4 C
29 n
30 ]
31 )
32 )
END
}
if (1) { #TcompileGrammar #TprintGrammar #TparseWithGrammar #TprintParseTree #TprintParseTreeAsXml
my $grammar = compileGrammar(<<END);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
C { A }
C ( )
C [ ]
C { }
END
ok printGrammar($grammar) eq <<END;
Rule Symbol Expansion
1 0 A A + B
2 1 A B
3 2 B B * n
4 3 B B * ( A )
5 4 B B * [ A ]
6 5 B B * { A }
7 6 B B * ( )
8 7 B B * [ ]
9 8 B B * { }
10 9 B n
11 10 B ( A )
12 11 B [ A ]
13 12 B { A }
14 13 B ( )
15 14 B [ ]
16 15 B { }
END
my $tree = parseWithGrammar($grammar, qw/( [ { } ] + [ { n } ] ) * [ n + n ] /);
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 4 B
3 10 B
4 (
5 0 A
6 1 A
7 11 B
8 [
9 1 A
10 15 B
11 {
12 }
13 ]
14 +
15 11 B
16 [
17 1 A
18 12 B
19 {
20 1 A
21 9 B
22 n
23 }
24 ]
25 )
26 *
27 [
28 0 A
29 1 A
30 9 B
31 n
32 +
33 9 B
34 n
35 ]
END
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="1">
<B rule="4">
<B rule="10">
<"(" pos="0"/>
<A rule="0">
<A rule="1">
<B rule="11">
<"[" pos="1"/>
<A rule="1">
<B rule="15">
<"{" pos="2"/>
<"}" pos="3"/>
</B>
</A>
<"]" pos="4"/>
</B>
</A>
<"+" pos="5"/>
<B rule="11">
<"[" pos="6"/>
<A rule="1">
<B rule="12">
<"{" pos="7"/>
<A rule="1">
<B rule="9">
<n pos="8"/>
</B>
</A>
<"}" pos="9"/>
</B>
</A>
<"]" pos="10"/>
</B>
</A>
<")" pos="11"/>
</B>
<"*" pos="12"/>
<"[" pos="13"/>
<A rule="0">
<A rule="1">
<B rule="9">
<n pos="14"/>
</B>
</A>
<"+" pos="15"/>
<B rule="9">
<n pos="16"/>
</B>
</A>
<"]" pos="17"/>
</B>
</A>
END
ok printGrammarAsXml($grammar) eq <<END
<grammar>
<A><A/><"+"/><B/></A>
<A><B/></A>
<B><B/><"*"/><n/></B>
<B><B/><"*"/><"("/><A/><")"/></B>
<B><B/><"*"/><"["/><A/><"]"/></B>
<B><B/><"*"/><"{"/><A/><"}"/></B>
<B><B/><"*"/><"("/><")"/></B>
<B><B/><"*"/><"["/><"]"/></B>
<B><B/><"*"/><"{"/><"}"/></B>
<B><n/></B>
<B><"("/><A/><")"/></B>
<B><"["/><A/><"]"/></B>
<B><"{"/><A/><"}"/></B>
<B><"("/><")"/></B>
<B><"["/><"]"/></B>
<B><"{"/><"}"/></B>
</grammar>
END
}
done_testing;
' called at lib/Parser/LR.pm line 1831
Parser::LR::test("Parser::LR") called at test.pl line 11
at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 3576, <DATA> line 506.
Data::Table::Text::__ANON__("Cannot make path with make_path: because:\x{a}/home/phil/z/z/z\x{a}mk"...) called at /home/david/cpantesting/perl-5.30.0/lib/5.30.0/Carp.pm line 292
Carp::confess("Cannot make path with make_path: because:\x{a}/home/phil/z/z/z\x{a}mk"...) called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 903
Data::Table::Text::makePath("/home/phil/z/z/z/zzz.txt") called at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 911
Data::Table::Text::overWriteFile("/home/phil/z/z/z/zzz.txt", "Terminal: n, stack: (empty)\x{a} Accept first terminal: n to get"...) called at (eval 56) line 54
tpwg("n") called at (eval 56) line 58
eval 'use Test::More tests => 24;
if (1) {
my $g = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my sub tlmr(@)
{my $r = longestMatchingRule($g, @_);
if ($r)
{delete $r->{print} if $r;
my %r = $r->%*;
#say STDERR nws(dump(\\%r));
}
$r
}
is_deeply tlmr(qw(n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(n + n)), {expandable=>"C", expansion=>["n"], rule=>4};
is_deeply tlmr(qw(A + B)), {expandable=>"A", expansion=>["A", "+", "B"], rule=>0};
ok !tlmr(qw(n +));
my sub trswr($@)
{my ($rule, @stack) = @_;
my @tree = (q()) x @stack;
my $r = reduceStackWithRule($g->rules->[$rule], \\@stack, \\@tree);
#say STDERR nws(dump(\\@stack));
\\@stack
}
is_deeply trswr(0, qw(A + B)), [qw(A)];
is_deeply trswr(0, qw(n A + B)), [qw(n A)];
is_deeply trswr(4, qw(B * n)), [qw(B * C)];
is_deeply trswr(3, qw(B * n)), [qw(B * B)]; # There is no check that the rule actually applies
my sub tpm(@)
{my (@stack) = @_;
my $r = partialMatch($g, @stack);
$r
}
ok 3 == tpm qw(A + B);
ok 2 == tpm qw(A +);
ok 1 == tpm qw(A);
ok 0 == tpm qw(A -);
my sub tpwg(@)
{my (@stack) = @_;
my $r = parseWithGrammarAndLog($g, @stack) =~ s(\\s+\\Z) (\\n)gsr;;
owf($logFile, $r);
$r
}
ok tpwg(qw(n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Reduced in finals by rule 4, expandable: C, stack: C
Reduced in finals by rule 3, expandable: B, stack: B
Reduced in finals by rule 1, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 1 A
2 3 B
3 4 C
4 n
END
ok tpwg(qw(n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 3 B
4 4 C
5 n
6 +
7 3 B
8 4 C
9 n
END
ok tpwg(qw(n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 3 B
12 4 C
13 n
END
ok tpwg(qw(n * n + n * n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: *, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Accept * after 2 reductions to get: B *
Terminal: n, stack: B *
Accepted terminal: n as is, stack: B * n
Terminal: +, stack: B * n
Reduced by rule 4, expandable: C, stack: B * C
Reduced by rule 2, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Reduced in finals by rule 4, expandable: C, stack: A + B * C
Reduced in finals by rule 2, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
ok tpwg(qw(n + n * n + n)) eq <<END;
Terminal: n, stack: (empty)
Accept first terminal: n to get stack: n
Terminal: +, stack: n
Reduced by rule 4, expandable: C, stack: C
Reduced by rule 3, expandable: B, stack: B
Reduced by rule 1, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Terminal: *, stack: A + n
Reduced by rule 4, expandable: C, stack: A + C
Reduced by rule 3, expandable: B, stack: A + B
Accept * after 2 reductions to get: A + B *
Terminal: n, stack: A + B *
Accepted terminal: n as is, stack: A + B * n
Terminal: +, stack: A + B * n
Reduced by rule 4, expandable: C, stack: A + B * C
Reduced by rule 2, expandable: B, stack: A + B
Reduced by rule 0, expandable: A, stack: A
Accept + after 3 reductions to get: A +
Terminal: n, stack: A +
Accepted terminal: n as is, stack: A + n
Reduced in finals by rule 4, expandable: C, stack: A + C
Reduced in finals by rule 3, expandable: B, stack: A + B
Reduced in finals by rule 0, expandable: A, stack: A
Parse tree is:
Rule Expandable Terminal
1 0 A
2 0 A
3 1 A
4 3 B
5 4 C
6 n
7 +
8 2 B
9 3 B
10 4 C
11 n
12 *
13 4 C
14 n
15 +
16 3 B
17 4 C
18 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
END
my $tree = parseWithGrammar($grammar, qw(n * n + n * n));
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 0 A
2 1 A
3 2 B
4 3 B
5 4 C
6 n
7 *
8 4 C
9 n
10 +
11 2 B
12 3 B
13 4 C
14 n
15 *
16 4 C
17 n
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A plus B
A B
B B times C
B C
C value
END
my $tree = parseWithGrammar($grammar, qw(value times value plus value times value));
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="0">
<A rule="1">
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="0"/>
</C>
</B>
<times pos="1"/>
<C rule="4">
<value pos="2"/>
</C>
</B>
</A>
<plus pos="3"/>
<B rule="2">
<B rule="3">
<C rule="4">
<value pos="4"/>
</C>
</B>
<times pos="5"/>
<C rule="4">
<value pos="6"/>
</C>
</B>
</A>
END
}
if (1) {
my $grammar = compileGrammar(<<END, nosub=>1);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
END
my $tree = parseWithGrammar $grammar, qw/ n * ( n + ( n * [ n ] ) )/, subsitute=>0;
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 2 B
3 3 B
4 4 C
5 n
6 *
7 5 C
8 (
9 0 A
10 1 A
11 3 B
12 4 C
13 n
14 +
15 3 B
16 5 C
17 (
18 1 A
19 2 B
20 3 B
21 4 C
22 n
23 *
24 6 C
25 [
26 1 A
27 3 B
28 4 C
29 n
30 ]
31 )
32 )
END
}
if (1) { #TcompileGrammar #TprintGrammar #TparseWithGrammar #TprintParseTree #TprintParseTreeAsXml
my $grammar = compileGrammar(<<END);
A A + B
A B
B B * C
B C
C n
C ( A )
C [ A ]
C { A }
C ( )
C [ ]
C { }
END
ok printGrammar($grammar) eq <<END;
Rule Symbol Expansion
1 0 A A + B
2 1 A B
3 2 B B * n
4 3 B B * ( A )
5 4 B B * [ A ]
6 5 B B * { A }
7 6 B B * ( )
8 7 B B * [ ]
9 8 B B * { }
10 9 B n
11 10 B ( A )
12 11 B [ A ]
13 12 B { A }
14 13 B ( )
15 14 B [ ]
16 15 B { }
END
my $tree = parseWithGrammar($grammar, qw/( [ { } ] + [ { n } ] ) * [ n + n ] /);
ok printParseTree($grammar, $tree) eq <<END;
Rule Expandable Terminal
1 1 A
2 4 B
3 10 B
4 (
5 0 A
6 1 A
7 11 B
8 [
9 1 A
10 15 B
11 {
12 }
13 ]
14 +
15 11 B
16 [
17 1 A
18 12 B
19 {
20 1 A
21 9 B
22 n
23 }
24 ]
25 )
26 *
27 [
28 0 A
29 1 A
30 9 B
31 n
32 +
33 9 B
34 n
35 ]
END
ok printParseTreeAsXml($grammar, $tree) eq <<END;
<A rule="1">
<B rule="4">
<B rule="10">
<"(" pos="0"/>
<A rule="0">
<A rule="1">
<B rule="11">
<"[" pos="1"/>
<A rule="1">
<B rule="15">
<"{" pos="2"/>
<"}" pos="3"/>
</B>
</A>
<"]" pos="4"/>
</B>
</A>
<"+" pos="5"/>
<B rule="11">
<"[" pos="6"/>
<A rule="1">
<B rule="12">
<"{" pos="7"/>
<A rule="1">
<B rule="9">
<n pos="8"/>
</B>
</A>
<"}" pos="9"/>
</B>
</A>
<"]" pos="10"/>
</B>
</A>
<")" pos="11"/>
</B>
<"*" pos="12"/>
<"[" pos="13"/>
<A rule="0">
<A rule="1">
<B rule="9">
<n pos="14"/>
</B>
</A>
<"+" pos="15"/>
<B rule="9">
<n pos="16"/>
</B>
</A>
<"]" pos="17"/>
</B>
</A>
END
ok printGrammarAsXml($grammar) eq <<END
<grammar>
<A><A/><"+"/><B/></A>
<A><B/></A>
<B><B/><"*"/><n/></B>
<B><B/><"*"/><"("/><A/><")"/></B>
<B><B/><"*"/><"["/><A/><"]"/></B>
<B><B/><"*"/><"{"/><A/><"}"/></B>
<B><B/><"*"/><"("/><")"/></B>
<B><B/><"*"/><"["/><"]"/></B>
<B><B/><"*"/><"{"/><"}"/></B>
<B><n/></B>
<B><"("/><A/><")"/></B>
<B><"["/><A/><"]"/></B>
<B><"{"/><A/><"}"/></B>
<B><"("/><")"/></B>
<B><"["/><"]"/></B>
<B><"{"/><"}"/></B>
</grammar>
END
}
done_testing;
' called at lib/Parser/LR.pm line 1831
Parser::LR::test("Parser::LR") called at test.pl line 11
at /home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/Data/Table/Text.pm line 3576, <DATA> line 506.
Data::Table::Text::__ANON__("Cannot make path with make_path: because:\x{a}/home/phil/z/z/z\x{a}mk"...) called at lib/Parser/LR.pm line 1832
Parser::LR::test("Parser::LR") called at test.pl line 11
# Looks like your test exited with 2 just after 12.
test.pl ..
Dubious, test returned 2 (wstat 512, 0x200)
Failed 12/24 subtests
Test Summary Report
-------------------
test.pl (Wstat: 512 Tests: 12 Failed: 0)
Non-zero exit status: 2
Parse errors: Bad plan. You planned 24 tests but ran 12.
Files=1, Tests=12, 2 wallclock secs ( 0.02 usr 0.00 sys + 0.16 cusr 0.01 csys = 0.19 CPU)
Result: FAIL
Failed 1/1 test programs. 0/12 subtests failed.
------------------------------
PREREQUISITES
------------------------------
Prerequisite modules loaded:
requires:
Module Need Have
------------------------ -------- --------
Carp 0 1.50
Data::DFA 20180429 20191119
Data::Dump 0 1.23
Data::NFA 20191110 20191110
Data::Table::Text 20191110 20191110
Exporter 0 5.73
Math::Cartesian::Product 1.009 1.009
Test2::API 0 1.302169
Test::More 0 1.302169
configure_requires:
Module Need Have
------------------------ -------- --------
Module::Build 0.4224 0.4229
------------------------------
ENVIRONMENT AND OTHER CONTEXT
------------------------------
Environment variables:
AUTOMATED_TESTING = 1
LANG = en_US.UTF-8
NONINTERACTIVE_TESTING = 1
PATH = /usr/local/bin:/usr/bin:/bin:/usr/local/games:/usr/games
PERL = 5.30.0
PERL5LIB =
PERL5OPT =
PERL5_CPANPLUS_IS_RUNNING = 26683
PERL5_CPAN_IS_RUNNING = 26683
PERLVER = 5.30.0
PERL_INLINE_DIRECTORY = /home/david/.Inline-5.30.0
PERL_MM_USE_DEFAULT = 1
PERL_USE_UNSAFE_INC = 0
SHELL = /bin/bash
TERM = screen
Perl special variables (and OS-specific diagnostics, for MSWin32):
$^X = /home/david/cpantesting/perl-5.30.0/bin/perl
$UID/$EUID = 1000 / 1000
$GID = 1000 27 1000
$EGID = 1000 27 1000
Perl module toolchain versions installed:
Module Have
------------------- --------
CPAN 2.22
CPAN::Meta 2.150010
Cwd 3.78
ExtUtils::CBuilder 0.280231
ExtUtils::Command 7.39_04
ExtUtils::Install 2.14
ExtUtils::MakeMaker 7.39_04
ExtUtils::Manifest 1.72
ExtUtils::ParseXS 3.40
File::Spec 3.78
JSON 4.02
JSON::PP 4.02
Module::Build 0.4229
Module::Signature n/a
Parse::CPAN::Meta 2.150010
Test::Harness 3.42
Test::More 1.302169
YAML n/a
YAML::Syck n/a
version 0.9924
--
Summary of my perl5 (revision 5 version 30 subversion 0) configuration:
Platform:
osname=linux
osvers=4.9.0-8-amd64
archname=x86_64-linux-thread-multi
uname='linux pigsty.barnyard.co.uk 4.9.0-8-amd64 #1 smp debian 4.9.144-3 (2019-02-02) x86_64 gnulinux '
config_args='-de -Duse64bitall -Dusethreads -Dprefix=/home/david/cpantesting/perl-5.30.0'
hint=recommended
useposix=true
d_sigaction=define
useithreads=define
usemultiplicity=define
use64bitint=define
use64bitall=define
uselongdouble=undef
usemymalloc=n
default_inc_excludes_dot=define
bincompat5005=undef
Compiler:
cc='cc'
ccflags ='-D_REENTRANT -D_GNU_SOURCE -fwrapv -fno-strict-aliasing -pipe -fstack-protector-strong -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_FORTIFY_SOURCE=2'
optimize='-O2'
cppflags='-D_REENTRANT -D_GNU_SOURCE -fwrapv -fno-strict-aliasing -pipe -fstack-protector-strong -I/usr/local/include'
ccversion=''
gccversion='6.3.0 20170516'
gccosandvers=''
intsize=4
longsize=8
ptrsize=8
doublesize=8
byteorder=12345678
doublekind=3
d_longlong=define
longlongsize=8
d_longdbl=define
longdblsize=16
longdblkind=3
ivtype='long'
ivsize=8
nvtype='double'
nvsize=8
Off_t='off_t'
lseeksize=8
alignbytes=8
prototype=define
Linker and Libraries:
ld='cc'
ldflags =' -fstack-protector-strong -L/usr/local/lib'
libpth=/usr/local/lib /usr/lib/gcc/x86_64-linux-gnu/6/include-fixed /usr/include/x86_64-linux-gnu /usr/lib /lib/x86_64-linux-gnu /lib/../lib /usr/lib/x86_64-linux-gnu /usr/lib/../lib /lib
libs=-lpthread -lnsl -ldb -ldl -lm -lcrypt -lutil -lc
perllibs=-lpthread -lnsl -ldl -lm -lcrypt -lutil -lc
libc=libc-2.24.so
so=so
useshrplib=false
libperl=libperl.a
gnulibc_version='2.24'
Dynamic Linking:
dlsrc=dl_dlopen.xs
dlext=so
d_dlsymun=undef
ccdlflags='-Wl,-E'
cccdlflags='-fPIC'
lddlflags='-shared -O2 -L/usr/local/lib -fstack-protector-strong'
Characteristics of this binary (from libperl):
Compile-time options:
HAS_TIMES
MULTIPLICITY
PERLIO_LAYERS
PERL_COPY_ON_WRITE
PERL_DONT_CREATE_GVSV
PERL_IMPLICIT_CONTEXT
PERL_MALLOC_WRAP
PERL_OP_PARENT
PERL_PRESERVE_IVUV
USE_64_BIT_ALL
USE_64_BIT_INT
USE_ITHREADS
USE_LARGE_FILES
USE_LOCALE
USE_LOCALE_COLLATE
USE_LOCALE_CTYPE
USE_LOCALE_NUMERIC
USE_LOCALE_TIME
USE_PERLIO
USE_PERL_ATOF
USE_REENTRANT_API
USE_THREAD_SAFE_LOCALE
Built under linux
Compiled at May 23 2019 14:44:10
%ENV:
PERL="5.30.0"
PERL5LIB=""
PERL5OPT=""
PERL5_CPANPLUS_IS_RUNNING="26683"
PERL5_CPAN_IS_RUNNING="26683"
PERLVER="5.30.0"
PERL_INLINE_DIRECTORY="/home/david/.Inline-5.30.0"
PERL_MM_USE_DEFAULT="1"
PERL_USE_UNSAFE_INC="0"
@INC:
/home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0/x86_64-linux-thread-multi
/home/david/cpantesting/perl-5.30.0/lib/site_perl/5.30.0
/home/david/cpantesting/perl-5.30.0/lib/5.30.0/x86_64-linux-thread-multi
/home/david/cpantesting/perl-5.30.0/lib/5.30.0