/usr/share/perl5/PPI/Statement/Compound.pm is in libppi-perl 1.215-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | package PPI::Statement::Compound;
=pod
=head1 NAME
PPI::Statement::Compound - Describes all compound statements
=head1 SYNOPSIS
# A compound if statement
if ( foo ) {
bar();
} else {
baz();
}
# A compound loop statement
foreach ( @list ) {
bar($_);
}
=head1 INHERITANCE
PPI::Statement::Compound
isa PPI::Statement
isa PPI::Node
isa PPI::Element
=head1 DESCRIPTION
C<PPI::Statement::Compound> objects are used to describe all current forms
of compound statements, as described in L<perlsyn>.
This covers blocks using C<if>, C<unless>, C<for>, C<foreach>, C<while>,
and C<continue>. Please note this does B<not> cover "simple" statements
with trailing conditions. Please note also that "do" is also not part of
a compound statement.
# This is NOT a compound statement
my $foo = 1 if $condition;
# This is also not a compound statement
do { ... } until $condition;
=head1 METHODS
C<PPI::Statement::Compound> has a number of methods in addition to the
standard L<PPI::Statement>, L<PPI::Node> and L<PPI::Element> methods.
=cut
use strict;
use PPI::Statement ();
use vars qw{$VERSION @ISA %TYPES};
BEGIN {
$VERSION = '1.215';
@ISA = 'PPI::Statement';
# Keyword type map
%TYPES = (
'if' => 'if',
'unless' => 'if',
'while' => 'while',
'until' => 'while',
'for' => 'for',
'foreach' => 'foreach',
);
}
# Lexer clues
sub __LEXER__normal { '' }
#####################################################################
# PPI::Statement::Compound analysis methods
=pod
=head2 type
The C<type> method returns the syntactic type of the compound statement.
There are four basic compound statement types.
The C<'if'> type includes all variations of the if and unless statements,
including any C<'elsif'> or C<'else'> parts of the compound statement.
The C<'while'> type describes the standard while and until statements, but
again does B<not> describes simple statements with a trailing while.
The C<'for'> type covers the C-style for loops, regardless of whether they
were declared using C<'for'> or C<'foreach'>.
The C<'foreach'> type covers loops that iterate over collections,
regardless of whether they were declared using C<'for'> or C<'foreach'>.
All of the compounds are a variation on one of these four.
Returns the simple string C<'if'>, C<'for'>, C<'foreach'> or C<'while'>,
or C<undef> if the type cannot be determined.
=begin testing type 52
my $Document = PPI::Document->new(\<<'END_PERL');
while (1) { }
until (1) { }
LABEL: while (1) { }
LABEL: until (1) { }
if (1) { }
unless (1) { }
for (@foo) { }
foreach (@foo) { }
for $x (@foo) { }
foreach $x (@foo) { }
for my $x (@foo) { }
foreach my $x (@foo) { }
for state $x (@foo) { }
foreach state $x (@foo) { }
LABEL: for (@foo) { }
LABEL: foreach (@foo) { }
LABEL: for $x (@foo) { }
LABEL: foreach $x (@foo) { }
LABEL: for my $x (@foo) { }
LABEL: foreach my $x (@foo) { }
LABEL: for state $x (@foo) { }
LABEL: foreach state $x (@foo) { }
for qw{foo} { }
foreach qw{foo} { }
for $x qw{foo} { }
foreach $x qw{foo} { }
for my $x qw{foo} { }
foreach my $x qw{foo} { }
for state $x qw{foo} { }
foreach state $x qw{foo} { }
LABEL: for qw{foo} { }
LABEL: foreach qw{foo} { }
LABEL: for $x qw{foo} { }
LABEL: foreach $x qw{foo} { }
LABEL: for my $x qw{foo} { }
LABEL: foreach my $x qw{foo} { }
LABEL: for state $x qw{foo} { }
LABEL: foreach state $x qw{foo} { }
for ( ; ; ) { }
foreach ( ; ; ) { }
for ($x = 0 ; $x < 1; $x++) { }
foreach ($x = 0 ; $x < 1; $x++) { }
for (my $x = 0 ; $x < 1; $x++) { }
foreach (my $x = 0 ; $x < 1; $x++) { }
LABEL: for ( ; ; ) { }
LABEL: foreach ( ; ; ) { }
LABEL: for ($x = 0 ; $x < 1; $x++) { }
LABEL: foreach ($x = 0 ; $x < 1; $x++) { }
LABEL: for (my $x = 0 ; $x < 1; $x++) { }
LABEL: foreach (my $x = 0 ; $x < 1; $x++) { }
END_PERL
isa_ok( $Document, 'PPI::Document' );
my $statements = $Document->find('Statement::Compound');
is( scalar @{$statements}, 50, 'Found the 50 test statements' );
is( $statements->[0]->type, 'while', q<Type of while is "while"> );
is( $statements->[1]->type, 'while', q<Type of until is "while"> );
is( $statements->[2]->type, 'while', q<Type of while with label is "while"> );
is( $statements->[3]->type, 'while', q<Type of until with label is "while"> );
is( $statements->[4]->type, 'if', q<Type of if is "if"> );
is( $statements->[5]->type, 'if', q<Type of unless is "if"> );
foreach my $index (6..37) {
my $statement = $statements->[$index];
is( $statement->type, 'foreach', qq<Type is "foreach": $statement> );
}
foreach my $index (38..49) {
my $statement = $statements->[$index];
is( $statement->type, 'for', qq<Type is "for": $statement> );
}
=end testing
=cut
sub type {
my $self = shift;
my $p = 0; # Child position
my $Element = $self->schild($p) or return undef;
# A labelled statement
if ( $Element->isa('PPI::Token::Label') ) {
$Element = $self->schild(++$p) or return 'label';
}
# Most simple cases
my $content = $Element->content;
if ( $content =~ /^for(?:each)?\z/ ) {
$Element = $self->schild(++$p) or return $content;
if ( $Element->isa('PPI::Token') ) {
return 'foreach' if $Element->content =~ /^my|our|state\z/;
return 'foreach' if $Element->isa('PPI::Token::Symbol');
return 'foreach' if $Element->isa('PPI::Token::QuoteLike::Words');
}
if ( $Element->isa('PPI::Structure::List') ) {
return 'foreach';
}
return 'for';
}
return $TYPES{$content} if $Element->isa('PPI::Token::Word');
return 'continue' if $Element->isa('PPI::Structure::Block');
# Unknown (shouldn't exist?)
undef;
}
#####################################################################
# PPI::Node Methods
sub scope { 1 }
#####################################################################
# PPI::Element Methods
sub _complete {
my $self = shift;
my $type = $self->type or die "Illegal compound statement type";
# Check the different types of compound statements
if ( $type eq 'if' ) {
# Unless the last significant child is a complete
# block, it must be incomplete.
my $child = $self->schild(-1) or return '';
$child->isa('PPI::Structure') or return '';
$child->braces eq '{}' or return '';
$child->_complete or return '';
# It can STILL be
} elsif ( $type eq 'while' ) {
die "CODE INCOMPLETE";
} else {
die "CODE INCOMPLETE";
}
}
1;
=pod
=head1 TO DO
- Write unit tests for this package
=head1 SUPPORT
See the L<support section|PPI/SUPPORT> in the main module.
=head1 AUTHOR
Adam Kennedy E<lt>adamk@cpan.orgE<gt>
=head1 COPYRIGHT
Copyright 2001 - 2011 Adam Kennedy.
This program is free software; you can redistribute
it and/or modify it under the same terms as Perl itself.
The full text of the license can be found in the
LICENSE file included with this module.
=cut
|