| line |
true |
false |
branch |
|
292
|
57 |
84 |
if $L > @stack |
|
301
|
332 |
118 |
if (my $next = $dfa->{$state}->transitions->{$symbol}) |
|
308
|
124 |
16 |
if $final |
|
317
|
105 |
237 |
if $L > @stack |
|
324
|
801 |
738 |
if (my $next = $dfa->{$state}->transitions->{$symbol}) |
|
338
|
125 |
0 |
if ($L <= @$stack) { } |
|
442
|
9 |
63 |
if (not @stack) { } |
|
448
|
4 |
59 |
if (&partialMatch($grammar, @stack, $terminal) >= 2) { } |
|
453
|
27 |
32 |
if ($grammar->startTerminals->{$terminal}) { } |
|
460
|
65 |
2 |
if (my $rule = &longestMatchingRule($grammar, @stack)) |
|
465
|
30 |
35 |
if (&partialMatch($grammar, @stack, $terminal) >= 2) { } |
|
484
|
18 |
9 |
if (my $rule = &longestMatchingRule($grammar, @stack)) |
|
493
|
0 |
9 |
unless @tree |
|
494
|
0 |
9 |
if @tree > 1 |
|
507
|
0 |
1 |
if -e $logFile |
|
513
|
111 |
59 |
$symbol =~ /\A[0-9a-z]+\Z/i ? : |
|
536
|
0 |
1 |
if -e $logFile |
|
548
|
84 |
61 |
if (ref $stack) { } |
|
549
|
84 |
0 |
if (defined(my($r) = @$stack)) |
|
563
|
0 |
8 |
unless $tree |
|
569
|
0 |
8 |
if -e $logFile |
|
582
|
27 |
25 |
if (ref $stack) { } |
|
583
|
27 |
0 |
if (defined(my($r) = @$stack)) |
|
602
|
0 |
5 |
unless $tree |
|
610
|
0 |
5 |
if -e $logFile |
|
624
|
27 |
25 |
if (ref $stack) { } |
|
625
|
27 |
0 |
if (defined(my($r) = @$stack)) |
|
645
|
0 |
2 |
unless $tree |
|
651
|
0 |
2 |
if -e $logFile |
|
664
|
0 |
0 |
if -e $logFile |
|
1874
|
0 |
1 |
if eval "eof(${p}::DATA)" |
|
1876
|
0 |
1 |
if $@ |
|
1878
|
0 |
1 |
if $@ |