5 unstable releases
0.10.1 | Mar 20, 2023 |
---|---|
0.10.0 | Sep 13, 2021 |
0.9.1 | Aug 7, 2021 |
0.9.0 | Jun 8, 2021 |
0.8.0 | Apr 22, 2021 |
#181 in #nom
61,416 downloads per month
Used in 23 crates
(via nom-derive)
91KB
2K
SLoC
nom-derive
Overview
nom-derive is a custom derive attribute, to derive nom parsers automatically from the structure definition.
It is not meant to replace nom, but to provide a quick and easy way to generate parsers for structures, especially for simple structures. This crate aims at simplifying common cases. In some cases, writing the parser manually will remain more efficient.
- API documentation
- The docs::Nom pseudo-module. This is the main
documentation for the
Nom
attribute, with all possible options and many examples.
Feedback welcome !
#[derive(Nom)]
This crate exposes a single custom-derive macro Nom
which
implements parse
for the struct it is applied to.
The goal of this project is that:
derive(Nom)
should be enough for you to derive nom parsers for simple structures easily, without having to write it manually- it allows overriding any parsing method by your own
- it allows using generated parsing functions along with handwritten parsers and combining them without efforts
- it remains as fast as nom
nom-derive
adds declarative parsing to nom
. It also allows mixing with
procedural parsing easily, making writing parsers for byte-encoded formats
very easy.
For example:
use nom_derive::*;
#[derive(Nom)]
struct S {
a: u32,
b: u16,
c: u16
}
This adds static method parse
to S
. The generated code looks
like:
impl S {
pub fn parse(i: &[u8]) -> nom::IResult(&[u8], S) {
let (i, a) = be_u32(i)?;
let (i, b) = be_u16(i)?;
let (i, c) = be_u16(i)?;
Ok((i, S{ a, b, c }))
}
}
To parse input, just call let res = S::parse(input);
.
For extensive documentation of all attributes and examples, see the documentation of docs::Nom custom derive attribute.
Many examples are provided, and more can be found in the project tests.
Combinators visibility
All inferred parsers will generate code with absolute type path, so there is no need
to add use
statements for them. However, if you use any combinator directly (or in a Parse
statement, for ex.), it has to be imported as usual.
That is probably not going to change, since
- a proc_macro cannot export items other than functions tagged with
#[proc_macro_derive]
- there are variants of combinators with the same names (complete/streaming, bits/bytes), so re-exporting them would create side-effects.
Debug tips
- If the generated parser does not compile, add
#[nom(DebugDerive)]
to the structure. It will dump the generated parser tostderr
. - If the generated parser fails at runtime, try adding
#[nom(Debug)]
to the structure or to fields. It wraps subparsers indbg_dmp
and will print the field name and input tostderr
if the parser fails.
Changes
See CHANGELOG.md
, and UPGRADING.md
for instructions for upgrading major versions.
License
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
Dependencies
~1.5MB
~35K SLoC