/usr/share/perl5/Gedcom/Grammar.pm is in libgedcom-perl 1.20-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 | # Copyright 1998-2013, Paul Johnson (paul@pjcj.net)
# This software is free. It is licensed under the same terms as Perl itself.
# The latest version of this software should be available from my homepage:
# http://www.pjcj.net
# documentation at __END__
use strict;
require 5.005;
package Gedcom::Grammar;
use Data::Dumper;
use Gedcom::Item 1.20;
use vars qw($VERSION @ISA);
$VERSION = "1.20";
@ISA = qw( Gedcom::Item );
sub structure {
my $self = shift;
my ($struct) = @_;
unless (exists $self->{top}{structures}) {
$self->{top}{structures} = {
map { $_->{structure} ? ($_->{structure} => $_) : () }
@{$self->{top}{items}}
};
}
# print Dumper $self->{top}{structures};
$self->{top}{structures}{$struct}
}
sub item {
my $self = shift;
my ($tag) = @_;
return unless defined $tag;
my $valid_items = $self->valid_items;
# use Data::Dumper; print "[$tag] -- ", Dumper($self), Dumper $valid_items;
return unless exists $valid_items->{$tag};
map { $_->{grammar} } @{$valid_items->{$tag}}
}
sub min {
my $self = shift;
exists $self->{min} ? $self->{min} : 1
}
sub max {
my $self = shift;
exists $self->{max} ? $self->{max} eq "M" ? 0 : $self->{max} : 1
}
sub items {
my $self = shift;
keys %{$self->valid_items}
}
sub _valid_items {
my $self = shift;
my %valid_items;
for my $item (@{$self->{items}}) {
my $min = $item->min;
my $max = $item->max;
if ($item->{tag}) {
push @{$valid_items{$item->{tag}}}, {
grammar => $item,
min => $min,
max => $max
};
} else {
die "What's a " . Data::Dumper->new([$item], ["grammar"])
unless my ($value) = $item->{value} =~ /<<(.*)>>/;
die "Can't find $value in gedcom structures"
unless my $structure = $self->structure($value);
$item->{structure} = $structure;
while (my($tag, $g) = each %{$structure->valid_items}) {
push @{$valid_items{$tag}}, map {
grammar => $_->{grammar},
# min and max can be calculated by multiplication because
# the grammar always permits multiple selection records, and
# selection records never have compulsory records. This may
# change in future grammars, but I would not expect it to -
# such a grammar would seem to have little practical use.
min => $_->{min} * $min,
max => $_->{max} * $max
}, @$g;
}
if (exists $item->{items} && @{$item->{items}}) {
my $extra_items = $item->_valid_items;
while (my ($sub_item, $sub_grammars) = each %valid_items) {
for my $sub_grammar (@$sub_grammars) {
$sub_grammar->{grammar}->valid_items;
while (my ($i, $g) = each %$extra_items) {
# print "adding $i to $sub_item\n";
$sub_grammar->{grammar}{_valid_items}{$i} = $g;
}
}
# print "giving @{[keys %{$sub_grammar->{grammar}->valid_items}]}\n";
}
}
}
}
# print "valid items are @{[keys %valid_items]}\n";
\%valid_items
}
sub valid_items {
my $self = shift;
$self->{_valid_items} ||= $self->_valid_items
}
1;
__END__
=head1 NAME
Gedcom::Grammar - a module to manipulate Gedcom grammars
Version 1.20 - 17th September 2017
=head1 SYNOPSIS
use Gedcom::Grammar;
my $st = $grammar->structure("GEDCOM");
my @sgr = $grammar->item("DATE");
my @items = $grammar->valid_items;
my $min = $grammar->min;
my $max = $grammar->max;
my @items = $grammar->items;
=head1 DESCRIPTION
A selection of subroutines to handle the grammar of a gedcom file.
Derived from Gedcom::Item.
=head1 HASH MEMBERS
Some of the more important hash members are:
=head2 $grammar->{top}
The top of the grammar tree.
=head2 $grammar->{top}{structures}
A reference to a hash mapping the names of all structures to the grammar
objects.
=head1 METHODS
=head2 structures
my $st = $grammar->structure("GEDCOM");
Return the grammar item of the specified structure, if it exists, or undef.
=head2 item
my @sgr = $grammar->item("DATE");
Return a list of the possible grammar items of the specified sub-item,
if it exists.
=head2 min
my $min = $grammar->min;
Return the minimum permissible number of $grammar items
=head2 max
my $max = $grammar->max;
Return the maximum permissible number of $grammar items
=head2 items
my @items = $grammar->items;
Return a list of tags of the grammar's sub-items
=head2 valid_items
my @items = $grammar->valid_items;
Return a hash detailing all the valid sub-items of the grammar item.
The key is the tag of the sub-item and the value is an array of hashes
with three members:
grammar => the sub-item grammar
min => the minimum permissible number of these sub-items
max => the maximum permissible number of these sub-items
=cut
|