Created
July 25, 2012 17:03
-
-
Save jeffreykegler/3177276 to your computer and use it in GitHub Desktop.
Code for partial parsing of Perl
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!perl | |
# Copyright 2012 Jeffrey Kegler | |
# This file is part of Marpa::R2. Marpa::R2 is free software: you can | |
# redistribute it and/or modify it under the terms of the GNU Lesser | |
# General Public License as published by the Free Software Foundation, | |
# either version 3 of the License, or (at your option) any later version. | |
# | |
# Marpa::R2 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 | |
# Lesser General Public License for more details. | |
# | |
# You should have received a copy of the GNU Lesser | |
# General Public License along with Marpa::R2. If not, see | |
# http://www.gnu.org/licenses/. | |
use 5.010; | |
use warnings; | |
use strict; | |
use English qw( -no_match_vars ); | |
use Test::More ( import => [] ); | |
use lib 'pperl'; | |
BEGIN { | |
my $PPI_problem; | |
CHECK_PPI: { | |
if ( not eval { require PPI } ) { | |
$PPI_problem = 'PPI not installed'; | |
last CHECK_PPI; | |
} | |
if ( not PPI->VERSION(1.206) ) { | |
$PPI_problem = 'PPI 1.206 not installed'; | |
} | |
} ## end CHECK_PPI: | |
if ($PPI_problem) { | |
Test::More::plan skip_all => $PPI_problem; | |
} | |
else { | |
Test::More::plan tests => 1; | |
} | |
} ## end BEGIN | |
use Marpa::R2; | |
use Marpa::R2::Perl; | |
use lib 'inc'; | |
use Marpa::R2::Test; | |
my $string = <<'END_OF_INPUT'; | |
Note: line:column figures include preceding whitepace | |
The next line is a perl fragment | |
{42;{1,2,3;4}} | |
Code block from 3:5 to 3:13 | |
Code block from 2:33 to 3:14 | |
The next line is a perl fragment | |
{42;{1,2,3,4}} | |
Hash from 7:5 to 7:13 | |
Code block from 7:5 to 7:13 | |
Code block from 6:33 to 7:14 | |
The next line is a perl fragment | |
{42;{;1,2,3;4}} | |
Code block from 12:5 to 12:14 | |
Code block from 11:33 to 12:15 | |
The next line is a perl fragment | |
{42;+{1,2,3,4}} | |
Hash from 16:6 to 16:14 | |
Code block from 15:33 to 16:15 | |
END_OF_INPUT | |
my $finder = Marpa::R2::Perl->new( { embedded => 1, closures => {} } ); | |
my $parser = Marpa::R2::Perl->new( { closures => {} } ); | |
sub linecol { | |
my ($token) = @_; | |
return '?' if not defined $token; | |
return $token->logical_line_number() . ':' . $token->column_number; | |
} | |
my $tokens = $finder->tokens(\$string); | |
$parser->clone_tokens($finder); | |
my $count_of_tokens = scalar @{$tokens}; | |
my $perl_found = 0; | |
my $start = 0; | |
my $next_start = 0; | |
my $result = q{}; | |
PERL_CODE: while (1) { | |
last PERL_CODE if $next_start >= $count_of_tokens; | |
my ( $start, $end ) = $finder->find_perl($next_start); | |
if ( not defined $start ) { | |
$next_start = $end + 1; | |
next PERL_CODE; | |
} ## end if ( not defined $start ) | |
$perl_found += ($end - $start) + 1; | |
my $perl_code = join q{}, map { $_->content() } @{$tokens}[ $start .. $end ]; | |
$perl_code =~ s/^\s*//; | |
$perl_code =~ s/\s*$//; | |
$result .= "Perl fragment: $perl_code\n"; | |
$result .= find_curly( $parser, $start, $end ); | |
$next_start = $end + 1; | |
} ## end PERL_CODE: while (1) | |
$result .= sprintf "perl tokens = %d; all tokens=%d; %.2f%%\n", $perl_found, | |
$count_of_tokens, ( $perl_found / $count_of_tokens ) * 100; | |
Marpa::R2::Test::is( $result, <<'END_OF_OUTPUT', 'Output' ); | |
Perl fragment: {42;{1,2,3;4}} | |
Code block at 3:5 3:13 {1,2,3;4} | |
Code block at 2:33 3:14 {42;{1,2,3;4}} | |
Perl fragment: {42;{1,2,3,4}} | |
Ambiguous Hash at 7:5 7:13 {1,2,3,4} | |
Ambiguous Code block at 7:5 7:13 {1,2,3,4} | |
Code block at 6:33 7:14 {42;{1,2,3,4}} | |
Perl fragment: {42;{;1,2,3;4}} | |
Code block at 12:5 12:14 {;1,2,3;4} | |
Code block at 11:33 12:15 {42;{;1,2,3;4}} | |
Perl fragment: {42;+{1,2,3,4}} | |
Hash at 16:6 16:14 {1,2,3,4} | |
Code block at 15:33 16:15 {42;+{1,2,3,4}} | |
perl tokens = 62; all tokens=267; 23.22% | |
END_OF_OUTPUT | |
sub find_curly { | |
my ( $parser, $start_ix, $end_ix ) = @_; | |
my $result = q{}; | |
$parser->read_tokens( $start_ix, $end_ix ); | |
my $recce = $parser->{recce}; | |
my $earleme_to_token = $parser->{earleme_to_PPI_token}; | |
my $PPI_tokens = $parser->{PPI_tokens}; | |
my $grammar = $recce->[Marpa::R2::Internal::Recognizer::GRAMMAR]; | |
my $grammar_c = $grammar->[Marpa::R2::Internal::Grammar::C]; | |
my $rules = $grammar->[Marpa::R2::Internal::Grammar::RULES]; | |
for my $earley_set_id ( 0 .. $recce->latest_earley_set() ) { | |
my @hash_locations = (); | |
my @code_locations = (); | |
my $progress_report = $recce->progress($earley_set_id); | |
ITEM: for my $progress_item ( @{$progress_report} ) { | |
my ( $rule_id, $position, $origin_earley_set_id ) = | |
@{$progress_item}; | |
last ITEM if not defined $rule_id; | |
next ITEM if $position >= 0; | |
$position = $grammar_c->rule_length($rule_id); | |
my $origin_earleme = $recce->earleme($origin_earley_set_id); | |
my $rule = $rules->[$rule_id]; | |
my $rule_name = $rule->[Marpa::R2::Internal::Rule::NAME]; | |
next ITEM if not defined $rule_name; | |
my $blocktype = | |
$rule_name eq 'anon_hash' ? 'hash' | |
: $rule_name eq 'block' ? 'code' | |
: $rule_name eq 'mblock' ? 'code' | |
: undef; | |
next ITEM if not defined $blocktype; | |
my $token = $PPI_tokens->[ $earleme_to_token->[$origin_earleme] ]; | |
push @hash_locations, [ $origin_earleme, $earley_set_id-1 ] | |
if $blocktype eq 'hash'; | |
push @code_locations, [ $origin_earleme, $earley_set_id-1 ] | |
if $blocktype eq 'code'; | |
} ## end ITEM: for my $progress_item ( @{$progress_report} ) | |
my @ambiguous = (); | |
push @ambiguous, 'Ambiguous' | |
if scalar @hash_locations and scalar @code_locations; | |
for my $hash_location (@hash_locations) { | |
my ( $start, $end ) = @{$hash_location}; | |
my $start_ix = $earleme_to_token->[$start]; | |
my $end_ix = $earleme_to_token->[$end]; | |
while (not defined $end_ix) { $end_ix = $earleme_to_token->[ --$end ] }; | |
my $string = join q{}, | |
map { $_->content() } @{$tokens}[ $start_ix .. $end_ix ]; | |
$string =~ s/^\s*//; | |
$string =~ s/\s*$//; | |
$result .= join q{ }, @ambiguous, 'Hash at', | |
linecol( $PPI_tokens->[$start_ix] ), | |
linecol( $PPI_tokens->[$end_ix] ), $string; | |
$result .= "\n"; | |
} ## end for my $hash_location (@hash_locations) | |
for my $code_location (@code_locations) { | |
my ( $start, $end ) = @{$code_location}; | |
my $start_ix = $earleme_to_token->[$start]; | |
my $end_ix = $earleme_to_token->[$end]; | |
while (not defined $end_ix) { $end_ix = $earleme_to_token->[ --$end ] }; | |
my $string = join q{}, | |
map { $_->content() } @{$tokens}[ $start_ix .. $end_ix ]; | |
$string =~ s/^\s*//; | |
$string =~ s/\s*$//; | |
$result .= join q{ }, @ambiguous, 'Code block at', | |
linecol( $PPI_tokens->[$start_ix] ), | |
linecol( $PPI_tokens->[$end_ix] ), $string; | |
$result .= "\n"; | |
} ## end for my $code_location (@code_locations) | |
} ## end for my $earley_set_id ( 0 .. $recce->latest_earley_set...) | |
return $result; | |
} ## end sub find_curly |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment