ꦫꦣꦺꦤ꧀ꦄꦤ꧀ꦠꦱꦺꦤ

PATH: usr / share / doc / perl-Parse-RecDescent-1.967009 / demo

#!/usr/bin/perl -w

# CONVERT FROM ONE EXTERNAL STRUCTURE TO A
# SLIGHTLY DIFFERENT INTERNAL STRUCTURE
#
# RETURNING NESTED LISTS AND THEN MUNGING THEM IS PAINFUL
# SEE demo_restructure_easy.pl FOR A BETTER TECHNIQUE

use strict;
use Parse::RecDescent;
use Data::Dumper;

my $grammar = q(

{
               sub consolidate {
                   my $aref = shift;
                   my @a = @{$aref};

my %new = ();
                   foreach my $a (@a) {
                       my %h = %{$a};
                       foreach my $k (keys %h) {
                           if (ref($h{$k})) {
                              foreach my $k2 (keys %{$h{$k}}) {
                                  $new{$k}->{$k2} = $h{$k}->{$k2};
                              }
                          } else {
                              $new{$k} = $h{$k};
                          }
                       }
                   }
                   return \%new;
               }

}

file:  section(s)
                { $return = consolidate($item[1]) }

section:  header '{' body '}'
                { $return = { $item[1] => $item[3] } }

header: 'Domain=' /.+/
                { $return = $item[2] }

body: line(s)
                { $return = consolidate($item[1])  }

line: lineA | lineB
                { $return = $item[1] }

lineA: /[^\W_]+/ '=' /.+/
                { $return = { $item[1] => $item[3] } }

lineB: /[^\W_]+/ '_' /[^\W_]+/ '=' /.+/
                { $return = { $item[1] => { $item[3] => $item[5] } } }
               );

my $parser = Parse::RecDescent->new($grammar);
my $text;
my @text = <DATA>;

foreach (@text)
{
    next if /^\#/;  # Strip comments
    $text .= $_;
}

my $f = $parser->file($text);
print Dumper ($f);

__DATA__
#
#
Domain=domain1
{
P1_Name=n1
P1_Address=host1:port1

P2_Name=n2
P2_Address=host2:port2
}

Domain=domain2
{
f1=v1
f2=v2a v2b
#comment
}

[-] demo_cpp.pl [edit]
[-] demo_autorule.pl [edit]
[-] demo_errors.pl [edit]
[-] demo_piecewise.pl [edit]
[-] demo_logic.pl [edit]
[-] demo_skipcomment.pl [edit]
[-] demo_implicit.pl [edit]
[-] demo_separators.pl [edit]
[-] demo_perlparsing.pl [edit]
[-] demo_street.pl [edit]
[-] demo_scoredsep.pl [edit]
[-] demo.c [edit]
[-] demo_textgen.pl [edit]
[-] demo.pl [edit]
[-] demo_calc.pl [edit]
[+] ..
[-] demo_another_Cgrammar.pl [edit]
[-] demo_matchrule2.pl [edit]
[-] demo_mccoy.pl [edit]
[-] demo_restructure_painful.pl [edit]
[-] demo_methods.pl [edit]
[-] demo_language.pl [edit]
[-] demo_selfmod.pl [edit]
[-] demo_OOautoparsetree.pl [edit]
[-] demo_codeblock.pl [edit]
[-] demo_simplequery.pl [edit]
[-] demo_restructure_easy.pl [edit]
[-] demo_tokens.pl [edit]
[-] demo_decomment.pl [edit]
[-] demo_recipe.pl [edit]
[-] demo_delete.pl [edit]
[-] demo_lisplike.pl [edit]
[-] demo_bad.pl [edit]
[-] demo_arithmetic.pl [edit]
[-] demo_leftassoc.pl [edit]
[-] demo_PerlCSV.pl [edit]
[-] demo_metaRD.pm [edit]
[-] demo_derived.pl [edit]
[-] demo_opreps.pl [edit]
[-] demo_matchrule.pl [edit]
[-] demo_LaTeXish_autoact.pl [edit]
[-] demo_operator.pl [edit]
[-] demo_autoscoresep.pl [edit]
[-] demo_Cgrammar_v2.pl [edit]
[-] demo_NL2SQL.pl [edit]
[-] demo_Cgrammar.pl [edit]
[-] demo_randomsentence.pl [edit]
[-] demo_template.pl [edit]
[-] demo_quicklist.pl [edit]
[-] demo_itemhash.pl [edit]
[-] demo_buildcalc.pl [edit]
[-] demo_leftop.pl [edit]
[-] demo_decomment_nonlocal.pl [edit]
[-] demo_dot.pl [edit]
[-] demo_LaTeXish.pl [edit]
[-] demo_precalc.pl [edit]
[-] demo_eval.pl [edit]
[-] demo_autostub.pl [edit]
[-] demo_whoson.pl [edit]
[-] demo_lexer.pl [edit]
[-] demo_OOparsetree.pl [edit]
[-] demo_parsetree.pl [edit]
[-] demo_simple.pl [edit]
[-] demo_embedding.pl [edit]
[-] demo_simpleXML.pl [edit]
[-] demo_undumper.pl [edit]