libregexp-grammars-perl 1.014-1 source package in Ubuntu


libregexp-grammars-perl (1.014-1) unstable; urgency=low

  [ Ansgar Burchardt ]
  * debian/control: Convert Vcs-* fields to Git.

  [ Salvatore Bonaccorso ]
  * debian/copyright: Replace DEP5 Format-Specification URL from to URL.
  * Imported Upstream version 1.014
  * Remove obsoleted Build-Depends-Indep.
    Remove Build-Depends-Indep on libclass-accessor-perl
 -- Ubuntu Archive Auto-Sync <email address hidden>   Sun,  13 Nov 2011 01:31:40 +0000

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync on 2011-11-13
Uploaded to:
Original maintainer:
Debian Perl Group
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release on 2011-11-13 universe perl


Precise: [FULLYBUILT] i386


File Size SHA-256 Checksum
libregexp-grammars-perl_1.014.orig.tar.gz 244.0 KiB 9a17b8687ef0566d120f0b61f4f73c56299fa45486c5c3e68fccd4f71e6e7d09
libregexp-grammars-perl_1.014-1.debian.tar.gz 2.3 KiB 01c1ee06d59db7d3c80734358d9711b5186e2c5286a01ea4cc003098c9e24949
libregexp-grammars-perl_1.014-1.dsc 2.1 KiB 8c519aae3a08aa684a4f69842da0f7193bfdd0e627da95f53863633f1d811aeb

Available diffs

View changes file

Binary packages built by this source

libregexp-grammars-perl: Perl module to add grammatical parsing features to Perl 5.10 regexes

 Regexp::Grammars adds a small number of new regex constructs that can be used
 within Perl 5.10 patterns to implement complete recursive-descent parsing.
 Perl 5.10 already supports recursive=descent matching, via the new
 (?<name>...) and (?&name) constructs. This technique makes it possible
 to use regexes to recognize complex, hierarchical--and even recursive--
 textual structures. The problem is that Perl 5.10 doesn't provide any
 support for extracting that hierarchical data into nested data
 structures. In other words, using Perl 5.10 you can match complex data,
 but not parse it into an internally useful form.
 An additional problem when using Perl 5.10 regexes to match complex
 data formats is that you have to make sure you remember to insert whitespace-
 matching constructs (such as \s*) at every possible position where the
 data might contain ignorable whitespace. This reduces the readability
 of such patterns, and increases the chance of errors (typically caused
 by overlooking a location where whitespace might appear).
 The Regexp::Grammars module solves both those problems.