File: seplist.t

package info (click to toggle)
libregexp-grammars-perl 1.058-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 1,328 kB
  • sloc: perl: 53,328; makefile: 2
file content (72 lines) | stat: -rw-r--r-- 1,487 bytes parent folder | download | duplicates (2)
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
use 5.010;
use warnings;

use Test::More 'no_plan';

use Regexp::Grammars;

my $list_nonempty = qr{
    <List>

    <rule: List>
        \(  <[Value]> ** [,]  \)

    <token: Value>
        \d+
}xms;

my $list_empty = qr{
    <List>

    <rule: List>
        \(  (?: <[Value]> ** , x? )?  \)
            (?{ $MATCH{Value} //= [] })

    <token: Value>
        \d+
}xms;

my $list_nonbracketed = qr{
    <List>

    <rule: List>
        \(  <[Value]> ** (?: , | ; )  \)

    <token: Value>
        \d+
}xms;

no Regexp::Grammars;

while (my $input = <DATA>) {
    chomp $input;
    my $input_copy = $input;
    my ($list, $data_structure) = split /\s*:\s*/, $input;

    if ($list !~ m{ \( \s* \) }xms) {
        ok +($input =~ $list_nonempty) => 'Matched non-empty list:' . $list;
        is_deeply $/{List}{Value}, eval($data_structure)
                                       => 'Build correct structure';
    }

    ok +($input_copy =~ $list_empty) => 'Matched possibly-empty list:' . $list;
    is_deeply $/{List}{Value}, eval($data_structure)
                                => 'Build correct structure';

    if ($list !~ m{ \( \s* \) }xms) {
        ok +($input_copy =~ $list_nonbracketed) => 'Matched nonbracketed list:' . $list;
        is_deeply $/{List}{Value}, eval($data_structure)
                                    => 'Build correct structure';
    }
}


__DATA__
() : []
(1) : [1]
(1,2) : [1,2]
(1,2,3) : [1,2,3]
(  ) : []
( 1 ) : [1]
(1, 2 ) : [1,2]
(1, 2,3 ) : [1,2,3]