Lambda/Grammar.pm

filter: Statementstmt 100% 17 / 17 Branchbran n/a Conditioncond n/a MC/DCmcdc n/a Subroutinesub 100% 5 / 5 Podpod 100% 1 / 1 totaltotal 100% 23 / 23 CC 1 SCAR 0.0
CC
1
Cov
100%
BEGIN
1.0
BEGIN
1.0
BEGIN
1.0
CRAP 1.0
« Lambda.pm ↑ Summary
1 package Sub::Lambda::Grammar;
2  
3 3 ▶use warnings;
Subroutine BEGIN: called CC=1 SCAR=0.0
4 3 ▶use strict;
Subroutine BEGIN: called CC=1 SCAR=0.0
5 3 ▶use Parse::RecDescent;
Subroutine BEGIN: called CC=1 SCAR=0.0
6  
7 3 ▶use base qw(Exporter);
Subroutine BEGIN: called CC=1 SCAR=0.0
8 3 our @EXPORT_OK = qw(parse);
9  
10 3 my $grammar = q{
11  
12 Parse : /^/ Expression /$/ { $item[2] }
13  
14 Expression : Unit(s)
15 { (join "->", map {qq(($_))} @{$item[1]}) }
16  
17 Unit : Code | Lambda | Parens | Symbol
18  
19 Parens : '(' Expression ')' { $item[2] }
20  
21 Lambda : /[\\\\]/ Pattern /\-\>/ Expression
22 { qq( sub { my $item[2] = \@_; $item[4] } ) }
23  
24 Pattern : (PWords | Words) { qq(($item[1])) }
25 Symbol : DWord | Word
26  
27 Code : '{' Block(s?) '}'
28 { my $x = join ' ', @{$item[2]}; "do {$x}" }
29 NoBlock : /[^{}]+/
30 Block : NoBlock | '{' Block(s?) '}'
31 { my $x = join ' ', @{$item[2]}; "{$x}" }
32  
33 PWords : '(' Words ')' { $item[2] }
34 Words : DWord | MWords
35 MWords : Word(s) DWord(?) { join ',', @{$item[1]}, @{$item[2]} }
36 Word : /[a-zA-Z]\w*/ { '$' . $item[1] }
37 DWord : '-' Word { '@' . substr($item[2],1) }
38  
39 };
40  
41 3 our $parser = new Parse::RecDescent($grammar);
42  
43 =head1 NAME
44  
45 Sub::Lambda::Grammar
46  
47 =head1 DESCRIPTION
48  
49 Defines the lambda grammar for L<Sub::Lambda::Filter>.
50  
51 =head2 METHODS
52  
53 =over
54  
55 =item parse($string)
56  
57 Runs a L<Parse::RecDescent> parser on its in put with a grammar defined in this
58 module. In effect, translates embedded lambda expressions to Perl code.
59  
60 =cut
61  
62 30 ▶sub parse ($) { $parser->Parse($_[0]) }
Subroutine parse: called CC=1 SCAR=0.0
Pod documented
63  
64 3 1;
65  
66 __END__
« Lambda.pm ↑ Summary