libregexp-grammars-perl 1.052-2 source package in Ubuntu
Changelog
libregexp-grammars-perl (1.052-2) unstable; urgency=medium [ Debian Janitor ] * Update standards version to 4.4.1, no changes needed. [ Salvatore Bonaccorso ] * Update copyright years for debian/* packaging files * debian/watch: use uscan version 4 -- Salvatore Bonaccorso <email address hidden> Thu, 02 Jan 2020 22:44:22 +0100
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- all
- Section:
- perl
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Focal | release | universe | perl |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libregexp-grammars-perl_1.052-2.dsc | 2.4 KiB | 6dfc7242e5676ebcf1bf85b3a164a23036b01151f39ec804b8250e0f40e4c7dd |
libregexp-grammars-perl_1.052.orig.tar.gz | 254.0 KiB | d552e7aaec956fc9ff0c56602fc95bc5c97ef815a0a8df7f42d1128f39534a62 |
libregexp-grammars-perl_1.052-2.debian.tar.xz | 3.8 KiB | 741682e7d4c8de0ccf9d77043414035e403e917791c05639296363b6a27650f8 |
Available diffs
- diff from 1.052-1 to 1.052-2 (812 bytes)
No changes file available.
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.